Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
From MaRDI portal
Publication:4649731
DOI10.1007/978-3-642-02846-5_18zbMath1251.68069MaRDI QIDQ4649731
Publication date: 13 November 2012
Published in: Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02846-5_18
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperequivalence of logic programs with respect to supported models
- Logic programming and knowledge representation---The A-Prolog perspective
- On the computational cost of disjunctive logic programming: Propositional case
- Logic programs with stable model semantics as a constraint programming paradigm
- Nested expressions in logic programs
- Characterizations of the disjunctive stable semantics by partial evaluation
- Logics in Artificial Intelligence
- Propositional theories are strongly equivalent to logic programs
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs