Loop-separable programs and their first-order definability

DOI10.1016/J.ARTINT.2010.12.001zbMath1223.68027OpenAlexW1971924127MaRDI QIDQ543631

Yong-Cai Geng, Sumit K. Garg

Publication date: 17 June 2011

Published in: Artificial Intelligence (Search for Journal in Brave)

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

zbMATH Keywords

knowledge representationnonmonotonic reasoningfirst-order definabilityanswer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logic programming (68N17)

Related Items (4)

Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ A progression semantics for first-order logic programs ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Preferred First-Order Answer Set Programs

Uses Software

• ASSAT
• Smodels

Cites Work

• Unnamed Item
• A non-ground realization of the stable and well-founded semantics
• ASSAT: computing answer sets of a logic program by SAT solvers
• Hypothesizing about signaling networks
• Modeling biological networks by action languages via answer set programming
• Datalog vs first-order logic
• Computing circumscription revisited: A reduction algorithm
• Combining answer set programming with description logics for the semantic web
• Well-founded and stable semantics of logic programs with aggregates
• The Semantics of Predicate Logic as a Programming Language
• Logic Programming
• The DLV system for knowledge representation and reasoning
• Conflict-Driven Answer Set Enumeration
• Quantified Equilibrium Logic and Foundations for Answer Set Programs

This page was built for publication: Loop-separable programs and their first-order definability