History

Fedor Isakov 5ee965a88d Renamed Node to Term, changed the API accordingly		2015-08-01 12:12:50 +02:00
..
.idea	Now allowing REF nodes to point to variables too, adapted the algorithm, removed obsolete interfaces, created more tests	2015-03-20 12:57:35 +01:00
code	Renamed Node to Term, changed the API accordingly	2015-08-01 12:12:50 +02:00
doc	Initial commit	2014-06-11 18:21:31 +02:00
lib	Initial commit	2014-06-11 18:21:31 +02:00
tests	Renamed Node to Term, changed the API accordingly	2015-08-01 12:12:50 +02:00
.gitignore	Ignore list	2014-07-21 16:08:22 +02:00
README.md	Published with https://stackedit.io/	2014-06-11 10:00:22 -07:00

README.md

Unification

This small package contains a Java implementation of a "near linear" time syntactic unification algorithm.¹

In order to make use of the API one must implement two interfaces:

Term
Var

These are used by the algorithm to analyze the syntax graph.

The results are provided in the form of variable bindings. On successful unification, the algorithm returns the solution in a triangular form.

License

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

Written with StackEdit.

1: Baader, Franz, and Wayne Snyder. "Unification Theory." Handbook of automated reasoning 1 (2001): 445-532.