A sound and complete semantics for a version of negation as failure

DOI10.1016/0304-3975(89)90106-0zbMath0682.68095OpenAlexW1987764156MaRDI QIDQ1824413

John C. Shepherdson

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90106-0

zbMATH Keywords

completenesssemanticsintuitionistic logicclosed world assumptionsoundnessfixpointcompleted databasedefault operatorleast HerbrandNegation as failureSLDNFS-resolutionvalued logicweaker consequence relations

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Semantics in the theory of computing (68Q55) Mechanization of proofs and logical operations (03B35) Many-valued logic (03B50)

Related Items (10)

The role of standardising apart in logic programming ⋮ What is failure? An approach to constructive negation ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ A LOGICAL ANALYSIS OF RULE INCONSISTENCY ⋮ Between constructive mathematics and PROLOG ⋮ Mints type deductive calculi for logic programming ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics ⋮ Programming in three-valued logic ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A completeness theorem for SLDNF resolution
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• A kripke-kleene semantics for logic programs*
• Negation as failure. II
• Negation in logic programming
• Partial evaluation in logic programming
• Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen

This page was built for publication: A sound and complete semantics for a version of negation as failure