A fixpoint semantics for disjunctive logic programs

DOI10.1016/0743-1066(90)90033-2zbMath0713.68016OpenAlexW2082367267MaRDI QIDQ3198867

Arcot Rajasekar, Jack Minker

Publication date: 1990

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(90)90033-2

zbMATH Keywords

logic programmingdisjunctive logic programsLinear resolutionHerbrand base

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

A semantics for a class of non-deterministic and causal production system programs ⋮ To Vladimir Lifschitz on His 65th Birthday ⋮ SATCHMORE: SATCHMO with RElevancy ⋮ Generalized disjunctive well-founded semantics for logic programs. ⋮ On stratified disjunctive programs ⋮ Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation ⋮ Jack Minker --- A profile ⋮ Negation as failure for disjunctive logic programming ⋮ Propositional semantics for disjunctive logic programs ⋮ Avoiding duplicate proofs with the foothold refinement ⋮ The least fixpoint transformation for disjunctive logic programs ⋮ Stable classes and operator pairs for disjunctive programs ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Complexity results for answer set programming with bounded predicate arities and implications ⋮ Semantics of Horn and disjunctive logic programs ⋮ Paraconsistent disjunctive deductive databases ⋮ Linear resolution for consequence finding ⋮ Temporal disjunctive logic programming ⋮ Relating minimal models and pre-requisite-free normal defaults ⋮ On reasoning about structural equality in XML: a description logic approach ⋮ Syntax and semantics of multi-adjoint normal logic programming ⋮ An efficient strategy for non-Horn deductive databases ⋮ The semantics of incomplete databases as an expression of preferences ⋮ Weak generalized closed world assumption ⋮ Hyper tableaux ⋮ Computing only minimal answers in disjunctive deductive databases ⋮ Completeness of hyper-resolution via the semantics of disjunctive logic programs ⋮ Disjunctive logic programs, answer sets, and the cut rule ⋮ Interpreting disjunctive logic programs based on a strong sense of disjunction

This page was built for publication: A fixpoint semantics for disjunctive logic programs