Many knowledge representation tasks involve trees or similar structures as abstract datatypes. However, devising compact and efficient declarative representations of such structural properties is non-obvious and can be challenging indeed. In this article, we take a number of acyclicity properties into consideration and investigate various 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 propositional logic, difference logic and linear programming. We study the compactness of encodings and the resulting computational performance on benchmarks involving acyclic or tree structures.
|Number of pages||30|
|Journal||Journal of Logic and Computation|
|Early online date||10 Sep 2015|
|Publication status||Published - 2015|
|MoE publication type||A1 Journal article-refereed|
- acyclicity properties, logic-based modeling, answer set programming, satisfiability