Completeness of hyper-resolution via the semantics of disjunctive logic programs
From MaRDI portal
Publication:1041788
DOI10.1016/j.ipl.2005.02.003zbMath1185.68630OpenAlexW1991020124MaRDI QIDQ1041788
Publication date: 4 December 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.02.003
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semantics of Horn and disjunctive logic programs
- Positive unit hyperresolution tableaux and their application to minimal model generation
- A fixpoint semantics for disjunctive logic programs
- Contributions to the Theory of Logic Programming
- Modal Theorem Proving: An Equational Viewpoint
- The Semantics of Predicate Logic as a Programming Language
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Resolution-based calculi for modal and temporal logics
- Logics in Artificial Intelligence
- A Machine-Oriented Logic Based on the Resolution Principle
This page was built for publication: Completeness of hyper-resolution via the semantics of disjunctive logic programs