Ordered completion for first-order logic programs on finite structures

DOI10.1016/j.artint.2011.11.001zbMath1244.68072OpenAlexW2014272228MaRDI QIDQ420824

J. Herrera, H. S. Yoon

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

knowledge representationnonmonotonic reasoninganswer set programmingordered completion

Mathematics Subject Classification ID

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

Related Items (6)

Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ A progression semantics for first-order logic programs ⋮ Ordered completion for logic programs with aggregates ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Fuzzy answer set computation via satisfiability modulo theories ⋮ Preferred First-Order Answer Set Programs

Uses Software

• ASSAT
• Cmodels
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stable models and circumscription
• From answer set logic programming to circumscription via logic of GK
• Loop-separable programs and their first-order definability
• ASSAT: computing answer sets of a logic program by SAT solvers
• Stable models and difference logic
• Propositional semantics for disjunctive logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Solving SAT and SAT Modulo Theories
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning

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