Complete logic programs with domain-closure axiom

DOI10.1016/0743-1066(88)90013-1MaRDI QIDQ3789103zbMATH OpenOpenAlexWikidataFDO

Authors Simone Martini, Dino Pedreschi, P. Mancarella

Publication date 1988

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

Full work available at URL https://doi.org/10.1016/0743-1066(88)90013-1

zbMATH Keywords

negation as failurelogic programminginference ruleSLD-resolutiondomain-closure axiomproof by case analysis

Mathematics Subject Classification ID

Recommendations

• Complete extension of general logic programs
• Negation as failure as resolution
• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• Commonsense axiomatizations for logic programs
• A theory of complete logic programs with equality

Cited in

(15)

• Negation by default and unstratifiable logic programs
• Strict completion of logic programs
• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Programming in three-valued logic
• Compositional model-theoretic semantics for logic programs
• scientific article; zbMATH DE number 515746 (Why is no real title available?)
• Completeness issues in RUE-NRF deduction: The undecidability of viability
• Quantifier elimination for infinite terms
• What is failure? An approach to constructive negation
• Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
• Clausal logic and logic programming in algebraic domains
• Protected completions of first-order general logic programs
• PDL with intersection of programs: a complete axiomatization
• Commonsense axiomatizations for logic programs
• Complete extension of general logic programs

This page was built for publication: Complete logic programs with domain-closure axiom

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