TY  - JOUR
A1  - Gebser, Martin
A1  - Janhunen, Tomi
A1  - Rintanen, Jussi
T1  - Declarative encodings of acyclicity properties
JF  - Journal of logic and computation
N2  - 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.
KW  - acyclicity properties
KW  - logic-based modeling
KW  - answer set programming
KW  - satisfiability
Y1  - 2015
U6  - https://doi.org/10.1093/logcom/exv063
SN  - 0955-792X
SN  - 1465-363X
VL  - 30
IS  - 4
SP  - 923
EP  - 952
PB  - Oxford Univ. Press
CY  - Eynsham, Oxford
ER  -