Complete extension of general logic programs

DOI10.1016/0304-3975(92)90039-IzbMATH Open0754.68028MaRDI QIDQ1190477FDOQ1190477

Authors: Bernhard Gil 

Publication date: 26 September 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Negation-as-failure rule for general logic programs with equality
• Modal Logic and Negation as Failure
• Complete logic programs with domain-closure axiom
• scientific article; zbMATH DE number 18533
• A sound and complete semantics for a version of negation as failure

zbMATH Keywords

declarative semanticsprocedural semanticsnegation-as-failure

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Title not available (Why is that?)
• The Semantics of Predicate Logic as a Programming Language
• A kripke-kleene semantics for logic programs*
• On the declarative and procedural semantics of logic programs
• Negation in logic programming
• Contributions to the Theory of Logic Programming
• Closures and fairness in the semantics of programming logic
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Negation as failure. II
• Sémantique logique et dénotationnelle des interpréteurs PROLOG

Cited In (10)

• Title not available (Why is that?)
• Complete logic programs with domain-closure axiom
• Title not available (Why is that?)
• Negation-as-failure rule for general logic programs with equality
• Title not available (Why is that?)
• Decidability of the Clark's completion semantics for monadic programs and queries
• Protected completions of first-order general logic programs
• Is there an axiomatic semantics for standard pure Prolog?
• Title not available (Why is that?)
• Négation constructive et axiomatique interne

This page was built for publication: Complete extension of general logic programs

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