A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Concept of Weak Substitution in Theorem-Proving
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Symbolic Computation
Associative-commutative unification
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
The concurrent logic programming language CP: Definition and operational semantics
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
Type inference and semi-unification
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Constrained equational reasoning
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Dataflow for logic program as substitution manipulator
ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
A rewrite-based type discipline for a subset of computer algebra
Journal of Symbolic Computation
Fundamentals of Deductive Program Synthesis
IEEE Transactions on Software Engineering
A general framework for semantics-based bottom-up abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
Fundamenta Informaticae - Concurrency specification and programming
Leftmost outside-in narrowing calculi
Journal of Functional Programming
Model checking linear logic specifications
Theory and Practice of Logic Programming
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Improving precision of type analysis using non-discriminative union
Theory and Practice of Logic Programming
A Kleene Theorem for Forest Languages
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Toward the Concept of Backtracking Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Anti-unification algorithms and their applications in program analysis
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Java SAM Typed Closures: A Sound and Complete Type Inference System for Nominal Types
Fundamenta Informaticae - Concurrency, Specification and Programming
| Hi-index | 0.00 |
In this paper the set of first order substitutions with a partial ordering ''more general than'' is investigated. It is proved that the set of equivalence classes of idempotent substitutions together with an added greatest element is a complete lattice. A simultaneous unification of finitely many finite sets of terms can be reduced to unifying each of the sets of terms separately and to building the supremum of the most general unifiers in this lattice afterwards. This saves time in an automatic proof procedure when combined with the concept of weak unification also introduced in this paper.