Negation in logic programming

DOI10.1016/0743-1066(87)90007-0zbMath0655.68018OpenAlexW2010104109MaRDI QIDQ3802588

Kenneth Kunen

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0743-1066(87)90007-0

zbMATH Keywords

quantifier eliminationPROLOGdecidabilitynegationlogic programmingequational theoryinterpreters3-valued semantics

Mathematics Subject Classification ID

Related Items (70)

Correctness and Completeness of Logic Programs ⋮ The role of standardising apart in logic programming ⋮ A kind of logical compilation for knowledge bases ⋮ A three-valued semantics for deductive databases and logic programs ⋮ Implementing constructive intensional negation ⋮ The liberalized \(\delta\)-rule in free variable semantic tableaux ⋮ Autoepistemic logic programming ⋮ A logic programming system for nonmonotonic reasoning ⋮ First-order theories for pure Prolog programs with negation ⋮ What is failure? An approach to constructive negation ⋮ SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Formalizing a logic for logic programming ⋮ Definite clause programs are canonical (over a suitable domain) ⋮ Intuitionistic three-valued logic and logic programming ⋮ Decomposable theories ⋮ Truth versus information in logic programming ⋮ Ultimate approximation and its application in nonmonotonic knowledge representation systems ⋮ Integration of Abductive Reasoning and Constraint Optimization in SCIFF ⋮ A rewrite mechanism for logic programs with negation ⋮ A note on the stable model semantics for logic programs ⋮ On inductive inference of cyclic structures ⋮ Well-founded and stationary models of logic programs ⋮ Complexity and undecidability results for logic programming ⋮ An equivalence preserving first order unfold/fold transformation system ⋮ A logical semantics for depth-first Prolog with ground negation ⋮ A transformation of propositional Prolog programs into classical logic ⋮ Annotated defeasible logic ⋮ A formalised theorem in the partition calculus ⋮ Decidability of the Clark's completion semantics for monadic programs and queries ⋮ On correctness of normal logic programs ⋮ Semantic-based construction of arguments: an answer set programming approach ⋮ An extended constraint deductive database: theory and implementation ⋮ Semantics of structured normal logic programs ⋮ Between constructive mathematics and PROLOG ⋮ Three-valued nonmonotonic formalisms and semantics of logic programs ⋮ A simple fixed point characterization of three-valued stable model semantics ⋮ Three-valued completion for abductive logic programs ⋮ Combining explicit negation and negation by failure via Belnap's logic ⋮ Complete extension of general logic programs ⋮ A completeness result for allowed semi-strict programs with respect to well-behaved and allowed query clauses ⋮ A slight strengthening of a theorem of Blair and Kunen ⋮ An improved lower bound for the elementary theories of trees ⋮ On the autoepistemic reconstruction of logic programming ⋮ The alternating fixpoint of logic programs with negation ⋮ Transforming normal logic programs to constraint logic programs ⋮ Equivalence-preserving first-order unfold/fold transformation systems ⋮ Négation constructive et axiomatique interne ⋮ A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete ⋮ Constructive negation and constraint logic programming with sets ⋮ A rewrite mechanism for logic programs with negation ⋮ Mapping deontic operators to abductive expectations ⋮ Nonmonotonic Trust Management for P2P Applications ⋮ Strict completion of logic programs ⋮ Quantifier elimination for infinite terms ⋮ Data types over multiple-valued logics ⋮ Programming in three-valued logic ⋮ Negation in rule-based database languages: A survey ⋮ A semantics for modular general logic programs ⋮ Extending Constructive Logic Negation with Types ⋮ The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments ⋮ A sound and complete semantics for a version of negation as failure ⋮ Dischargeable Obligations in the 𝒮CIFF Framework ⋮ Interdefinability of defeasible logic and logic programming under the well-founded semantics ⋮ Logic programs, well-orderings, and forward chaining ⋮ Approximation Schemes in Logic and Artificial Intelligence ⋮ On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games ⋮ Nonground Abductive Logic Programming with Probabilistic Integrity Constraints ⋮ Is there an axiomatic semantics for standard pure Prolog? ⋮ Logic programming and knowledge representation---The A-Prolog perspective ⋮ Fixpoint semantics for logic programming a survey

This page was built for publication: Negation in logic programming