Semantics of Horn and disjunctive logic programs
From MaRDI portal
Publication:1177928
DOI10.1016/0304-3975(91)90006-NzbMath0744.68090WikidataQ109585677 ScholiaQ109585677MaRDI QIDQ1177928
Jorge Lobo, Arcot Rajasekar, Jack Minker
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (4)
Modal logics with relative accessibility relations ⋮ Parsing as non-Horn deduction ⋮ Temporal disjunctive logic programming ⋮ Completeness of hyper-resolution via the semantics of disjunctive logic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An extension to linear resolution with selection function
- Generalized disjunctive well-founded semantics for logic programs.
- On stratified disjunctive programs
- Deduction in non-Horn databases
- Weak generalized closed world assumption
- A fixpoint semantics for disjunctive logic programs
- Contributions to the Theory of Logic Programming
- The Semantics of Predicate Logic as a Programming Language
This page was built for publication: Semantics of Horn and disjunctive logic programs