1990
DOI: 10.1007/bf01810294
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic constraint handling through unification in finite algebras

Abstract: Abstract. The constraint satisfaction problem (CSP) over finite domains is reduced to unification in finite algebras. A CSP defines a unification problem with a most general unifier that naturally expresses the solution of the given CSP in symbolic form. The approach is based on a unitary unification algorithm for arbitrary finite algebras, which is presented. The unification algorithm has been incorporated in the experimental Prolog system PROLOG-XT, which has been successfully applied to the verification of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1993
1993
2001
2001

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
references
References 14 publications
0
0
0
Order By: Relevance