Formalizing a logic for logic programming

DOI10.1007/BF01543479zbMath0998.68514OpenAlexW2000740920MaRDI QIDQ1354044

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) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (7)

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 ⋮ The alternating fixpoint of logic programs with negation ⋮ A general theory of confluent rewriting systems for logic programming and its applications ⋮ Equivalence for the \(G_3^\prime\)-stable models semantics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Why not negation by fixpoint?
• A kripke-kleene semantics for logic programs*
• Negation as failure. II
• Negation in logic programming
• Contributions to the Theory of Logic Programming
• A procedural semantics for well-founded negation in logic programs
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• The well-founded semantics for general logic programs

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