A theory of complete logic programs with equality
From MaRDI portal
Publication:3707362
DOI10.1016/0743-1066(84)90010-4zbMath0584.68021OpenAlexW2017637575MaRDI QIDQ3707362
Michael J. Maher, Jean-Louis Lassez, Joxan Jaffar
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
completeness theoremlogic programmingHorn clause programproof search treeClark schemafinite failureFixed point semanticssuccess set
Mechanization of proofs and logical operations (03B35) General topics in the theory of software (68N01)
Related Items
Semantics of infinite tree logic programming, Logic programming with external procedures: Introducing S-unification, Default reasoning by deductive planning, Kernel-LEAF: A logic plus functional language, Combination problems for commutative/monoidal theories or how algebra can help in equational unification, Unification properties of commutative theories: A categorical treatment, Ramification and causality, Unification in varieties of completely regular semigroups, A new deductive approach to planning, A compositional semantic basis for the analysis of equational Horn programs, Unification theory, Reasoning about actions: steady versus stabilizing state constraints, Horn equational theories and paramodulation
