Declarative encodings of acyclicity properties. (8th September 2015)

• Record Type: Journal Article
• Authors: Gebser, Martin; Janhunen, Tomi; Rintanen, Jussi
• Is Part Of: Journal of logic and computation. Volume 30:Number 4(2020)
• Page Start: 923
• Page End: 952
• Publication Date: 2015-09-08
• Subjects: Acyclicity properties -- logic-based modeling -- answer set programming -- satisfiability; Logic programming -- Periodicals; Logic, Symbolic and mathematical -- Periodicals; Computational complexity -- Periodicals; 005.115
• DOI: 10.1093/logcom/exv063
• Languages: English
• ISSNs: 0955-792X

Abstract

Abstract: 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.