A procedural semantics for well-founded negation in logic programs

DOI10.1016/0743-1066(92)90019-YzbMath0773.68064MaRDI QIDQ3992225

Kenneth A. Ross

Publication date: 13 August 1992

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

zbMATH Keywords

SLS-resolutionnegation in logic programs

Mathematics Subject Classification ID

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

Related Items (20)

Bottom-up evaluation of datalog with negation ⋮ A three-valued semantics for deductive databases and logic programs ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ A logic programming system for nonmonotonic reasoning ⋮ Formalizing a logic for logic programming ⋮ A note on the stable model semantics for logic programs ⋮ Well-founded and stationary models of logic programs ⋮ On the strong completion of logic programs ⋮ Eliminating negation from normal logic programs ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ An abstract machine for fixed-order dynamically stratified programs ⋮ The alternating fixpoint of logic programs with negation ⋮ Transforming normal logic programs to constraint logic programs ⋮ Enhancing global SLS-resolution with loop cutting and tabling mechanisms ⋮ The limits of fixed-order computation ⋮ Making assumptions in the automated derivation ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Negation in rule-based database languages: A survey ⋮ Characterizing D-WFS: Confluence and iterated GCWA ⋮ Logic programming and knowledge representation---The A-Prolog perspective

This page was built for publication: A procedural semantics for well-founded negation in logic programs