Formalizing a logic for logic programming

DOI10.1007/BF01543479MaRDI QIDQ1354044zbMATH OpenOpenAlexFDO

Authors John S. Schlipf

Publication date 13 May 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01543479

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites work

• A kripke-kleene semantics for logic programs*
• A procedural semantics for well-founded negation in logic programs
• Autoepistemic logic
• Contributions to the Theory of Logic Programming
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4147563 (Why is no real title available?)
• Negation as failure. II
• Negation in logic programming
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Why not negation by fixpoint?

Cited in

(9)

• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Complexity and undecidability results for logic programming
• On the extension of logic programming with negation through uniform proofs
• Default consequence relations as a logical framework for logic programs
• A general theory of confluent rewriting systems for logic programming and its applications
• On logics and semantics for general logic programs
• Aggregation and well-founded semantics\textsuperscript{+}
• The alternating fixpoint of logic programs with negation
• Equivalence for the G₃^-stable models semantics

This page was built for publication: Formalizing a logic for logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354044)