TY - GEN
T1 - Tabling with answer subsumption
T2 - 12th European Conference on Logics in Artificial Intelligence, JELIA 2010
AU - Swift, Terrance
AU - Warren, David S.
PY - 2010
Y1 - 2010
N2 - Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.
AB - Tabled Logic Programming (TLP) is becoming widely available in Prolog systems, but most implementations of TLP implement only answer variance in which an answer A is added to the table for a subgoal S only if A is not a variant of any other answer already in the table for S. While TLP with answer variance is powerful enough to implement the well-founded semantics with good termination and complexity properties, TLP becomes much more powerful if a mechanism called answer subsumption is used. XSB implements two forms of answer subsumption. The first, partial order answer subsumption, adds A to a table only if A is greater than all other answers already in the table according to a user-defined partial order. The second, lattice answer subsumption, may join A to some other answer in the table according to a user-defined upper semi-lattice. Answer subsumption can be used to implement paraconsistent and quantitative logics, abstract analysis domains, and preference logics. This paper discusses the semantics and implementation of answer subsumption in XSB, and discusses performance and scalability of answer subsumption on a variety of problems.
UR - http://www.scopus.com/inward/record.url?scp=78049400748&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78049400748&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-15675-5_26
DO - 10.1007/978-3-642-15675-5_26
M3 - Conference contribution
AN - SCOPUS:78049400748
SN - 3642156746
SN - 9783642156748
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 300
EP - 312
BT - Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Proceedings
Y2 - 13 September 2010 through 15 September 2010
ER -