Searching for "An Efficient Unification Algorithm." – sorted by Relevance.
-
Lazy Unification with Simplification
- process, more efficient unification algorithms can be achieved. Moreover, simplification reduces
- Cited by 14 (3 self) – Add To MetaCart
-
Set Constraints and Logic Programming
- an efficient unification algorithm and operational, declarative, and fixpoint semantics. We show how
- Cited by 16 (1 self) – Add To MetaCart
-
Efficient Feature Structure Operations without Compilation
- the grammar. In this paper we describe novel extensions to an existing ecient unication algorithm which
- Cited by 27 (1 self) – Add To MetaCart
-
An Algorithm for the Solution of Tree Equations
- ? 1. We describe an efficient unification algorithm that on input an ff-ary tree equation, computes a
- Cited by 2 (2 self) – Add To MetaCart
-
Theorem proving with structure sharing and efficient unification
- proof of n steps may require 2 2 operations. Efficient unification Quasi linear and linear algorithms
- Cited by 6 (1 self) – Add To MetaCart
-
A Parser for HPSG
- unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258--282. [Moshier
- Cited by 14 (2 self) – Add To MetaCart
-
Automated Reasoning (Bibliography)
- . February 13, 1997, 18:14 [MM 82] A. Martelli and U. Montanari. An efficient unification algorithm. ACM
- Add To MetaCart
-
Bibliography
- . 313--327. Martelli, A. and Montanari, U. (1982) An efficient unification algorithm. ACM Transactions
- Add To MetaCart
-
Tabled Evaluation with Delaying for General Logic Programs
- unification algorithm. ACM Transactions on Programming Languages and Systems, 4(2):258--282, 1982. [26] S
- Cited by 187 (25 self) – Add To MetaCart
-
Guiding Program Development Systems by a Connection Based Proof Strategy
- described above strongly depends on the efficiency of the unification algorithms computing both the first
- Cited by 20 (14 self) – Add To MetaCart

