Searching for "Completion for Unification." – sorted by Relevance.
-
AC-complete Unification and its Application to Theorem Proving
- AC-complete Unification and its Application to Theorem Proving ? Alexandre Boudet, Evelyne
- Cited by 5 (0 self) – Add To MetaCart
-
Unification with Sequence Variables And Flexible Arity Symbols and its Extension with Pattern-Terms
- , Hagenberg, Autsria teimuraz.kutsia@(email omitted); Abstract. A minimal and complete unification procedure for a
- Cited by 22 (10 self) – Add To MetaCart
-
Unification in a Process Algebra With Choice and Sequential Composition.
- , and is proved sound and complete. As unification in this algebra is infinitary, the algorithm does not terminate
- Add To MetaCart
-
Higher-order unification, polymorphism, and subsorts (extended abstract
- a new type system for the λ-calculus which may pave the way to a complete unification algorithm
- Cited by 3 (0 self) – Add To MetaCart
-
Equational logic programming, actions, and change
- . We give a minimal and complete unification algorithm for the equational theory which defines
- Add To MetaCart
-
A High Performance Prolog Processor with Multiple Functional Units
- completely overlapped by unification, and the performance of the processor is limited only by the available
- Cited by 1 (0 self) – Add To MetaCart
-
Unification in Prolog by Connectionist Models
- the correctness and completness of the unification-rules are proven. We introduce Clash- and Occurrence- units
- Cited by 5 (1 self) – Add To MetaCart
-
Difference Unification
- rule-based algorithm for difference unification, and analyze its correctness, completeness
- Cited by 25 (4 self) – Add To MetaCart
-
Symbolic Reasoning by Difference Reduction
- difference unification" can be easily made. We prove the algorithm given is both sound and complete
- Cited by 1 (0 self) – Add To MetaCart
-
Proof Search in Minimal Logic
- . Section 2 defines the pattern unification algorithm, and in section 3 its correctness and completeness
- Add To MetaCart

