On the complexity of equational problems in CNF

Journal of Symbolic Computation

Volumn 36, Issue 1-2, 2003, Pages 235-269

  Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complexity; Equational reasoning; NP completeness; Polynomial hierarchy

Indexed keywords

EID: 22944469970     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(03)00029-4     Document Type: Article

References (23)

1. Abiteboul, S., Hull, R., Vianu, V., 1995. Foundations of Databases, Addison-Wesley Publishing Company.
2. Baader, F., Siekmann, J.H., 1994. Unification theory. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (Eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, pp. 41-125.
3. Caferra, R., Peltier, N., 1995. Extending semantic resolution via automated model building: applications. In: IJCAI' 95, Proc. 14th Int. Joint Conf. on Artificial Intelligence, Morgan Kaufmann, Montreal, Canada, pp. 328-334.
4. Caferra, R., Zabel, N., 1991. Extending resolution for model construction. In: van Eijck, J. (Ed.), JELIA' 90, Proc. Logics in AI, European Workshop, Lecture Notes in Artificial Intelligence, no. 478. Springer-Verlag, Amsterdam, The Netherlands, pp. 153-169.
5. Colmerauer, A., 1984. Equations and inequations on finite and infinite trees. In: FGCS' 84, Proc. Int. Conf. on Fifth Generation Computer Systems, OHMSHA Ltd. Tokyo and North-Holland, Tokyo, Japan, pp. 85-99.
6. Comon, H., Delor, C., 1994. Equational formulae with membership constraints. Information and Computation 112 (2), 167-216.
7. Comon, H., Lescanne, P., 1989. Equational problems and disunification. Journal of Symbolic Computation 7 (3/4), 371-425.
8. Fermüller, Ch., Leitsch, A., 1996. Hyperresolution and automated model building. Journal of Logic and Computation 6 (2), 173-203.
9. Gottlob, G., Pichler, R., 1999. Working with ARMs: complexity results on atomic representations of Herbrand models. In: LICS' 99, Proc. 14th Annual IEEE Symp. on Logic in Computer Science, IEEE Computer Society, Trento, Italy, pp. 306-315 (full version to appear in Information and Computation).
10. Kunen, K., 1987. Answer sets and negation as failure. In: Lassez, J.-L. (Ed.), ICLP' 87, Proc. 4th Int. Conf. on Logic Programming, MIT Press, Melbourne, Victoria, Australia, pp. 219-228.
11. Lassez, J.-L., Maher, M., Marriott, K., 1991. Elimination of negation in term algebras. In: Tarlecki, A. (Ed.), MFCS' 91, Proc. 16th Int. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, no. 520. Springer-Verlag, Kazimierz Dolny, Poland, pp. 1-16.
12. Lassez, J.-L., Marriott, K., 1987. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning 3 (3), 301-317.
13. Lugiez, D., 1989. A deduction procedure for first order programs. In: Levi, G., Martelli, M. (Eds.), ICLP' 89, Proc. 6th Int. Conf. on Logic Programming, MIT Press, Lisbon, Portugal, pp. 585-599.
14. Maher, M., 1988. Complete axiomatizations of the algebras of finite, rational and infinite trees. In: LICS' 88, Proc. 3rd Annual Symp. on Logic in Computer Science, IEEE Computer Society, Edinburgh, Scotland, UK, pp. 348-357.
15. Martelli, A., Montanari, U., 1982. An efficient unification algorithm. ACM Transactions on Programming Languages and Systems 4 (2), 258-282.
16. Pichler, R., 1999. Solving equational problems efficiently. In: Ganzinger, H. (Ed.), CADE-16, Proc. 16th Int. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, no. 1632. Springer-Verlag, Trento, Italy, pp. 97-111.
17. Pichler, R., 2000a. On the complexity of equational problems in CNF over a finite domain. In: Baumgartner, P., Zhang, H. (eds), FTP 2000, Proc. 3rd Int. Workshop on First-Order Theorem Proving. Fachberichte Informatik der Universität Koblenz-Landau, St. Andrews, Scotland, UK, pp. 182-193. Available at http://www.uni-koblenz.de/fb4/publikationen/gelbereihe/RR-5-2000/.
18. Pichler, R., 2000b. Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria. Journal of Symbolic Computation 29 (2), 213-257.
19. Robinson, J.A., 1965. A machine oriented logic based on the resolution principle. Journal of the ACM 12 (1), 23-41.
20. Sato, T., Motoyoshi, F., 1991. A complete top-down interpreter for first order programs. In: Saraswat, V.A., Ueda, K. (Eds.), ILPS' 91, Proc. Int. Symp. on Logic Programming, MIT Press, San Diego, California, USA, pp. 35-53.
21. Stockmeyer, L.J., 1976. The polynomial time hierarchy. Theoretical Computer Science 3 (1-12).
22. Ullman, J.D., 1989. Principles of Database and Knowledge Base Systems, no. II. Computer Science Press, Rockville, MD, USA.
23. Vorobyov, S., 1996. An improved lower bound for the elementary theories of trees. In: McRobbie, M.A., Slaney, K. (Eds.), CADE- 13, Proc. 13th Int. Conf. on Automated Deduction, Lecture Notes in Artificial Intelligence, no. 690. Spfinger-Verlag, New Brunswick, NJ, USA, pp. 316-327.