Complete extension of general logic programs

DOI10.1016/0304-3975(92)90039-IMaRDI QIDQ1190477zbMATH OpenFDO

Authors Bernhard Gil

Publication date 26 September 1992

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

Full work available at URL https://doi.org/10.1016/0304-3975(92)90039-I

zbMATH Keywords

declarative semanticsnegation-as-failureprocedural semantics

Mathematics Subject Classification ID

Logic programming (68N17)

Review text

The author defines the declarative semantics of a general logic program. It requires the assignment of a system of axioms to the program \(P\), which is called the complete extension of \(P\). Then the relations between the different semantics of a positive program \(P\) are discussed. The soundness of the complete extension semantics is proved. However, although the negation-as-failure rule is still not complete with regard to the introduced semantics, the latter is closer than the Clark's one to the procedural semantics given by SLDNF-resolution.

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

Cites work

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

Cited in

(11)

• Negation-as-failure rule for general logic programs with equality
• Complete logic programs with domain-closure axiom
• scientific article; zbMATH DE number 4074450 (Why is no real title available?)
• scientific article; zbMATH DE number 1200168 (Why is no real title available?)
• scientific article; zbMATH DE number 1292287 (Why is no real title available?)
• Négation constructive et axiomatique interne
• scientific article; zbMATH DE number 1482189 (Why is no real title available?)
• Decidability of the Clark's completion semantics for monadic programs and queries
• Program generic set: Semantics of medium logic program described by forcing
• Is there an axiomatic semantics for standard pure Prolog?
• Protected completions of first-order general logic programs

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)