34 search results - page 1 / 7 » An Efficient Nominal Unification Algorithm |
RTA
2010
Springer
13 years 8 months ago
2010
Springer
JAR
2010
12 years 11 months ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
ITP
2010
13 years 2 months ago
2010
Using HOL4, we mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other fo...
ACL
2000
13 years 6 months ago
2000
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the me...
AAAI
1993
13 years 6 months ago
1993
The Rete and Treat algorithms are considered the most efficient implementation techniques for Forward Chaining rule systems. These algorithms support a language of limited express...