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.

• Type: Conference
• Year: 2008
• Where: AAAI
• Authors: Jia-Huai You, Guohua Liu
• Keywords: AAAI 2008, Arbitrary Constraint Atoms, Intelligent Agents, Pseudo-boolean Constraint Solvers, Pseudo-boolean Constraints