Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

Jia-Huai You, Guohua Liu

We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computation by computing models of completion. One particular attractive candidate for the latter task is pseudo-boolean constraint solvers. To strengthen this connection, we show examples of compact encoding of aggregates and global constraints by pseudo-boolean constraints.

Subjects: 11. Knowledge Representation; 3.3 Nonmonotonic Reasoning

Submitted: Apr 10, 2008


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.