Sciweavers

Share
AAAI
2008

Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

8 years 10 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
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.
Jia-Huai You, Guohua Liu
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2008
Where AAAI
Authors Jia-Huai You, Guohua Liu
Comments (0)
books