A theory of complete logic programs with equality

DOI10.1016/0743-1066(84)90010-4MaRDI QIDQ3707362zbMATH OpenOpenAlexFDO

Authors Joxan Jaffar, Jean-Louis Lassez, Michael J. Maher

Publication date 1984

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

Full work available at URL https://doi.org/10.1016/0743-1066(84)90010-4

zbMATH Keywords

Clark schemacompleteness theoremfinite failureFixed point semanticsHorn clause programlogic programmingproof search treesuccess set

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)

Recommendations

• Negation-as-failure rule for general logic programs with equality
• SLDNF-resolution with equality
• Logic programming with equations
• scientific article; zbMATH DE number 1984523
• A note on semantics of logic programs with equality based on complete sets of E-unifiers

Cited in

(45)

• Incorporating equality into logic programming via surface deduction
• Semantics of infinite tree logic programming
• Logic programming with external procedures: Introducing S-unification
• SLDNF-resolution with equality
• Reasoning about actions: steady versus stabilizing state constraints
• On elementary equivalence for equality-free logic
• Ramification and causality
• Horn equational theories and paramodulation
• First-order theories for pure Prolog programs with negation
• Default reasoning by deductive planning
• Combination problems for commutative/monoidal theories or how algebra can help in equational unification
• SCL(EQ): SCL for first-order logic with equality
• A goal-type driven method of solving Horn logic with equality
• Kernel-LEAF: A logic plus functional language
• Unifying theories for logic programming
• An equational approach to logic programming
• scientific article; zbMATH DE number 4018380 (Why is no real title available?)
• A note on semantics of logic programs with equality based on complete sets of E-unifiers
• Computing All Implied Equalities via SMT-Based Partition Refinement
• Equivalent logic programs
• scientific article; zbMATH DE number 3846863 (Why is no real title available?)
• Comments on “logic programming with equations”
• Inference rules and proof procedures for inequations
• A complete axiomatization of strict equality
• Negation-as-failure rule for general logic programs with equality
• scientific article; zbMATH DE number 3958699 (Why is no real title available?)
• Logic programming with equations
• scientific article; zbMATH DE number 4043302 (Why is no real title available?)
• Complete logic programs with domain-closure axiom
• Prolog: subsumption of equality axioms by the homogeneous form
• scientific article; zbMATH DE number 4102471 (Why is no real title available?)
• scientific article; zbMATH DE number 517069 (Why is no real title available?)
• scientific article; zbMATH DE number 1984523 (Why is no real title available?)
• scientific article; zbMATH DE number 1858070 (Why is no real title available?)
• Unification properties of commutative theories: a categorical treatment
• Logic Programming
• scientific article; zbMATH DE number 970711 (Why is no real title available?)
• Completion of first-order clauses with equality by strict superposition
• Equality, types, modules, and (why not?) generics for logic programming
• Equality, types, modules, and (why not?) generics for logic programming
• Unification in varieties of completely regular semigroups
• Unification theory
• A compositional semantic basis for the analysis of equational Horn programs
• The homogeneous form of logic programs with equality
• A new deductive approach to planning

This page was built for publication: A theory of complete logic programs with equality

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