Oriented equational clauses as a programming language

DOI10.1016/0743-1066(84)90003-7MaRDI QIDQ3692850zbMATH OpenOpenAlexFDO

Authors Laurent Fribourg

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)90003-7

zbMATH Keywords

equalityequational theoryHorn clauseslogic programmingparamodulationreflectingsuperposition

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Semantics in the theory of computing (68Q55) Symbolic computation and algebraic computation (68W30)

Recommendations

• Horn equational theories and paramodulation
• An inference system for horn clause logic with equality
• scientific article; zbMATH DE number 826301
• Oriented equational logic programming is complete
• The homogeneous form of logic programs with equality

Cited in

(12)

• A superposition oriented theorem prover
• Modelling the combination of functional and logic programming languages
• On solving the equality problem in theories defined by Horn clauses
• Unification in combinations of collapse-free regular theories
• Functional-logic integration via minimal reciprocal extensions
• A strong restriction of the inductive completion procedure
• Horn equational theories and paramodulation
• Kernel-LEAF: A logic plus functional language
• scientific article; zbMATH DE number 3921956 (Why is no real title available?)
• An inference system for horn clause logic with equality
• Conditional equational theories and complete sets of transformations
• The homogeneous form of logic programs with equality

This page was built for publication: Oriented equational clauses as a programming language

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