Ordered completion for first-order logic programs on finite structures

DOI10.1016/J.ARTINT.2011.11.001MaRDI QIDQ420824zbMATH OpenOpenAlexFDO

Authors Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou

Publication date 23 May 2012

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2011.11.001

zbMATH Keywords

answer set programmingknowledge representationnonmonotonic reasoningordered completion

Mathematics Subject Classification ID

Classical first-order logic (03B10) Model theory of finite structures (03C13) Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• Ordered completion for logic programs with aggregates
• A progression semantics for first-order logic programs
• Expressiveness of logic programs under the general stable model semantics
• Lloyd-Topor completion and general stable models
• scientific article; zbMATH DE number 2090537

Cites work

• ASSAT: computing answer sets of a logic program by SAT solvers
• First-order stable model semantics and first-order loop formulas
• From answer set logic programming to circumscription via logic of GK
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 25193 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 803291 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with stable model semantics as a constraint programming paradigm
• Logics in Artificial Intelligence
• Loop-separable programs and their first-order definability
• Nested expressions in logic programs
• Propositional semantics for disjunctive logic programs
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Stable models and circumscription
• Stable models and difference logic

Cited in

(8)

• A progression semantics for first-order logic programs
• Translation of first order formulas into ground formulas via a completion theory
• Knowledge compilation of logic programs using approximation fixpoint theory
• Fuzzy answer set computation via satisfiability modulo theories
• Preferred first-order answer set programs
• Expressiveness of logic programs under the general stable model semantics
• Loop-separable programs and their first-order definability
• Ordered completion for logic programs with aggregates

Describes a project that uses

Uses Software

• ASSAT
• Cmodels
• Datalog

This page was built for publication: Ordered completion for first-order logic programs on finite structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420824)