On the complexity of Boolean unification

Information Processing Letters

Volumn 67, Issue 4, 1998, Pages 215-220

  Baader, Franz ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Automatic theorem proving; Computational complexity

Indexed keywords

EID: 0347028102     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00106-9     Document Type: Article

References (20)

1. F. Baader, K.U. Schulz, Unification in the union of disjoint equational theories: Combining decision procedures, J. Symbolic Comput. 21 (1996) 211-243.
2. G. Boole, The Mathematical Analysis of Logic: Being an Essay Towards a Calculus of Deductive Reasoning, Macmillan, Barclay, 1847.
3. A. Boudet, J.-P. Jouannaud, M. Schmidt-Schauß, Unification in Boolean rings and Abelian groups, J. Symbolic Comput. 8 (1989) 449-477.
4. H.-J. Bürckert, A Resolution Principle for a Logic with Restricted Quantifiers, Lecture Notes in Artificial Intelligence, Vol. 568, Springer, Berlin, 1991.
5. W. Büttner, H. Simonis, Embedding Boolean expressions into logic programming, J. Symbolic Comput. 4 (2) (1987) 191-205.
6. C.C. Chang, H.J. Keisler, Model Theory, 3rd ed., Studies in Logic and the Foundations of Mathematics, Vol. 73, North-Holland, Amsterdam, 1990.
7. M.R. Garey, D.S. Johnson, Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
8. M. Hermann, P.G. Kolaitis, Unification algorithms cannot be combined in polynomial time, in: M.A. McRobbie, J.K. Slaney (Eds.), Proc. 13th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 1104, Springer, Berlin, 1996, pp. 246-260.
9. J. Jaffar, J.-L. Lassez, Constraint logic programming, in: Proc. 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, 1987, pp. 111-119.
10. A. Kandri-Rody, D. Kapur, P. Narendran, An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras, in: J.-P. Jouannaud (Ed.), Proc. 1st International Conference on Rewriting Techniques and Applications, Dijon, France, Lecture Notes in Computer Sci., Vol. 202, Springer, Berlin, 1985, pp. 345-364.
11. C. Kirchner, H. Kirchner, Constrained equational reasoning, in: Proc. ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon, ACM Press, 1989.
12. D. Kozen, Complexity of Boolean algebras, Theoret. Comput. Sci. 10 (3) (1980) 221-247.
13. L. Löwenheim, Über das Auflösungsproblem im logischen Klassenkalkül, Sitzungsberichte Berliner Math. Gesell. 7 (1908) 89-94.
14. U. Martin, T. Nipkow, Boolean unification - The story so far, J. Symbolic Comput. 7 (3,4) (1989) 275-293.
15. U. Martin, T. Nipkow, Unification in Boolean rings, J. Automated Reasoning 4 (1989) 381-396.
16. R. Nieuwenhuis, A. Rubio, AC-supperposition with constraints: No AC-unifiers needed, in: A. Bundy (Ed.), Proc. 12th International Conference on Automated Deduction, Nancy, France, Lecture Notes in Artificial Intelligence, Vol. 814, Springer, Berlin, 1990, pp. 545-559.
17. S. Rudeanu, Boolean Functions and Equations, North-Holland, Amsterdam, 1974.
18. M. Schmidt-Schauß, Unification in a combination of arbitrary disjoint equational theories, J. Symbolic Comput. 8 (1,2) (1989) 51-99.
19. H. Simonis, M. Dincbas, Using an extended Prolog for digital circuit design, in: IEEE International Workshop on AI Applications to CAD Systems for Electronics, Munich, Germany, 1987, pp. 165-188.
20. L.J. Stockmeyer, A.R. Meyer, Word problems requiring exponential time, in: Proc. 5th ACM Symp. on Theory of Computing, New York, Association for Computing Machinery, 1973, pp. 1-9.