On the extension of logic programming with negation through uniform proofs
From MaRDI portal
Publication:5101453
DOI10.1007/3-540-59487-6_17zbMath1496.68094OpenAlexW1575317731MaRDI QIDQ5101453
Publication date: 30 August 2022
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59487-6_17
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cumulative default logic: In defense of nonmonotonic inference rules
- Stable and extension class theory for logic programs and default logics
- Autoepistemic circumscription and logic programming
- Adding closed world assumptions to well-founded semantics
- A three-valued semantics for deductive databases and logic programs
- Autoepistemic logic of first order and its expressive power
- An alternative approach to the semantics of disjunctive logic programs and deductive databases
- Formalizing a logic for logic programming
- Uniform proofs as a foundation for logic programming
- The well-founded semantics for general logic programs
This page was built for publication: On the extension of logic programming with negation through uniform proofs