Oriented equational clauses as a programming language

DOI10.1016/0743-1066(84)90003-7zbMath0574.68024OpenAlexW2008851176MaRDI QIDQ3692850

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

Horn clausessuperpositionlogic programmingequalityequational theoryparamodulationreflecting

Mathematics Subject Classification ID

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

Related Items

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, Kernel-LEAF: A logic plus functional language, Conditional equational theories and complete sets of transformations, Functional-logic integration via minimal reciprocal extensions, A strong restriction of the inductive completion procedure, Horn equational theories and paramodulation, A superposition oriented theorem prover