ASP encodings of acyclicity properties
Martin Gebser, Tomi Janhunen, Jussi Rintanen · 2014
Many knowledge representation tasks involve trees or similar structures as abstract datatypes. However, devising compact and efficient declarative representations of such properties is non-obvious and can be challenging indeed. In this paper, we take acyclicity properties into consideration and investi-gate logic-based approaches to encode them. We use answer set programming as the primary representation language but also consider mappings to related formalisms, such as propo-sitional logic, difference logic, and linear programming.