Properties of substitutions and unifications
From MaRDI portal
Publication:1074342
DOI10.1016/S0747-7171(85)80027-4zbMath0589.68063MaRDI QIDQ1074342
Publication date: 1985
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Related Items
A New Algorithm for Computing Least Generalization of a Set of Atoms, Unification for infinite sets of equations between finite terms, On the termination of clause graph resolution, Unification, weak unification, upper bound, lower bound, and generalization problems, SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs, Unification in combinations of collapse-free regular theories, On complexity of the anti-unification problem, The model evolution calculus as a first-order DPLL method, Specialisation of Prolog and FCP programs using abstract interpretation, Implication of clauses is undecidable, Reduction of cycle unification of type \(Cpg+r\), On inductive inference of cyclic structures, Finite limits and anti-unification in substitution categories, On the membership problem for finite automata over symmetric groups, Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming, Unnamed Item, A rewrite-based type discipline for a subset of computer algebra, Semantic models for concurrent logic languages, A non-ground realization of the stable and well-founded semantics, Reduction rules for resolution-based systems, Multi-valued logic programming semantics An algebraic approach, C-expressions: A variable-free calculus for equational logic programming, Essential unifiers, Improving precision of type analysis using non-discriminative union, Unification in a combination of arbitrary disjoint equational theories, A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics, A Kleene Theorem for Forest Languages, Detecting non-provable goals, Learning from Łukasiewicz and Meredith: investigations into proof structures, Short story of the term “algebraic analysis”, Compositionality properties of SLD-derivations, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, On equational theories, unification, and (un)decidability, A theory of observables for logic programs, Weighted systems of equations, A compositional semantics for logic programs, A denotational semantics and dataflow construction for logic programs, Automated inferencing
Cites Work
