Boolean unification - The story so far

Authors:
Urusula Martin;Tobias Nipkow
Affiliations:
Department of Computer Science, RHBNC, University of LondonEgham, Surrey TW20 0EX, UK and MIT Laboratory for Computer Science, 545 Technology Square, Cambridge MA 02139, U.S.A.;Department of Computer Science, RHBNC, University of LondonEgham, Surrey TW20 0EX, UK and MIT Laboratory for Computer Science, 545 Technology Square, Cambridge MA 02139, U.S.A.
Venue:
Journal of Symbolic Computation
Year:
1989

Unification in primal algebras, their powers and their varieties

Journal of the ACM (JACM)
Constraint solving on terms

Constraints in computational logics
A Methodological View of Constraint Solving

Constraints
Pythagorean Triples in Unification Theory of Nilpotent Rings

FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Constraint synthesis for environment modeling in functional verification

Proceedings of the 40th annual Design Automation Conference
Set unification

Theory and Practice of Logic Programming
Semantics of an effect analysis for exceptions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics

Information and Computation - Special issue: Combining logical systems
The unification type of the Pythagorean equation in varieties of nilpotent rings

Journal of Symbolic Computation
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Explicitly heterogeneous metaprogramming with MetaHaskell

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming

Hi-index	0.00