Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

AAAI
2008

favoriteEmaildiscussreport

164views Intelligent Agents» more AAAI 2008»

Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

13 years 6 months ago

Loop Formulas for Logic Programs with Arbitrary Constraint Atoms

Download www.aaai.org

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

Real-time Traffic

AAAI 2008 | Arbitrary Constraint Atoms | Intelligent Agents | Pseudo-boolean Constraint Solvers | Pseudo-boolean Constraints |

claim paper

Related Content

» A Default Approach to Semantics of Logic Programs with Constraint Atoms

» Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms

» Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

» Set Constraints in Logic Programming

» Reducing Propositional Theories in Equilibrium Logic to Logic Programs

» Reasoning over Conceptual Schemas and Queries in Temporal Databases

» HeadElementarySetFree Logic Programs

» ASSAT computing answer sets of a logic program by SAT solvers

» The 2SAT Problem of Regular Signed CNF Formulas

Post Info
More Details (n/a)

Added	02 Oct 2010
Updated	02 Oct 2010
Type	Conference
Year	2008
Where	AAAI
Authors	Jia-Huai You, Guohua Liu

Comments (0)