Negation as failure. II

DOI10.1016/0743-1066(85)90018-4zbMath0603.68094OpenAlexW2057124712MaRDI QIDQ3740275

John C. Shepherdson

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0743-1066(85)90018-4

zbMATH Keywords

intuitionistic logiclogic programmingclosed world assumptionclassical logiccompleted database

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (14)

SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs ⋮ Formalizing a logic for logic programming ⋮ Intuitionistic three-valued logic and logic programming ⋮ A note on measures of fuzziness applied to nonmonotonic fuzzy propositional logic ⋮ Minimalism, justification and non-monotonicity in deductive databases ⋮ Complexity and undecidability results for logic programming ⋮ Sémantique logique et dénotationnelle des interpréteurs PROLOG ⋮ Complete extension of general logic programs ⋮ Mints type deductive calculi for logic programming ⋮ The alternating fixpoint of logic programs with negation ⋮ Strict completion of logic programs ⋮ Negation by default and unstratifiable logic programs ⋮ Soundness of abductive proof procedure with respect to constraint for non-ground abducibles ⋮ A sound and complete semantics for a version of negation as failure

This page was built for publication: Negation as failure. II