Tight, consistent, and computable completions for unrestricted logic programs
From MaRDI portal
Publication:4036289
DOI10.1016/0743-1066(93)90041-EzbMath0787.68021MaRDI QIDQ4036289
No author found.
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Related Items (8)
A formalization of programs in first-order logic with a discrete linear order ⋮ What is failure? An approach to constructive negation ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ Stable models and circumscription ⋮ Thirteen Definitions of a Stable Model ⋮ Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator ⋮ Twelve Definitions of a Stable Model
This page was built for publication: Tight, consistent, and computable completions for unrestricted logic programs