A progression semantics for first-order logic programs
From MaRDI portal
Publication:1680677
DOI10.1016/j.artint.2017.06.001zbMath1419.68035OpenAlexW2623765780MaRDI QIDQ1680677
Publication date: 16 November 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2017.06.001
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ordered completion for first-order logic programs on finite structures
- 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
- Ordered completion for logic programs with aggregates
- A logic for default reasoning
- A logic of knowledge and justified assumption
- Datalog vs first-order logic
- Conflict-driven answer set solving: from theory to practice
- Logic programs with stable model semantics as a constraint programming paradigm
- Infinitary equilibrium logic and strongly equivalent logic programs
- FLP answer set semantics without circular justifications for general logic programs
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
- Undecidable optimization problems for database logic programs
- Solving SAT and SAT Modulo Theories
- On the foundations of the universal relation model
- Global inductive definability
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
- Logics in Artificial Intelligence
- Two-Valued Logic Programs
- A Tarskian Informal Semantics for Answer Set Programming
- On the stable model semantics for intensional functions
This page was built for publication: A progression semantics for first-order logic programs
