Declarative encodings of acyclicity properties

Martin Gebser*, Tomi Janhunen, Jussi Rintanen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)923-952
Number of pages30
JournalJournal of Logic and Computation
Issue number4
Publication statusPublished - Jun 2020
Externally publishedYes


Dive into the research topics of 'Declarative encodings of acyclicity properties'. Together they form a unique fingerprint.

Cite this