Solving equational problems efficiently

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1632, Issue , 1999, Pages 97-111

  Pichler, Reinhard ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; LOGIC PROGRAMMING; THEOREM PROVING;

APPROPRIATE MODELS; AUTOMATED DEDUCTION; AUTOMATED MODELING; COMPLEXITY ANALYSIS; INFERENCE RULES; NP-COMPLETENESS; SATISFIABILITY PROBLEMS; THEOREM PROVERS;

PROBLEM SOLVING;

EID: 84957617412     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48660-7_7     Document Type: Conference Paper

References (16)

1. F. Baader, J.H. Siekmann: Unification Theory, in Handbook of Logic in Artificial Intelligence and Logic Programming, D.M. Gabbay, C.J. Hogger, J.A. Robinson (eds.), Oxford University Press (1994).
2. H. Comon, C. Delor: Equational Formulae with Membership Constraints, Journal of Information and Computation, Vol 112, pp. 167-216 (1994).
3. H. Comon, P. Lescanne: Equational Problems and Disunification, Journal of Symbolic Computation, Vol 7, pp. 371-425 (1989).
4. R. Caferra, N. Peltier: Extending semantic Resolution via automated Model Building: applications, Proceedings of IJCAI'95, Morgan Kaufmann, (1995)
5. R. Caferra, N. Zabel: Extending Resolution for Model Construction, in Proceedings of Logics in AI - JELIA’90, LNAI 478, pp. 153-169, Springer (1991).
6. C. Fermuller, A. Leitsch: Hyperresolution and Automated Model Building, Journal of Logic and Computation, Vol 6 No 2, pp.173-230 (1996).
7. G. Gottlob, R. Pichler: Working with ARMs: Complexity Results on Atomic Rep-resentations of Herbrand Models, to appear in Proceedings of LICS’99, IEEE Computer Society Press, (1999).
8. J.-L. Lassez, K. Marriott: Explicit Representation of Terms defined by Counter Examples, Journal of Automated Reasoning, Vol 3, pp. 301-317 (1987).
9. J.-L. Lassez, M. Maher, K. Marriott: Elimination of Negation in Term Algebras, in Proceedings of MFCS’91, LNCS 520, pp. 1-16, Springer (1991).
10. D. Lugiez: A Deduction Procedure for First Order Programs, in Proceedings of ICLP’89, pp. 585-599, Lisbon (1989).
11. M. Maher: Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees, in Proceedings of LICS’88, pp. 348-357, IEEE Computer Society Press, (1988).
12. A. Martelli, U. Montanari: An efficient unification algorithm, ACM Transactions on Programming Languages and Systems, Vol 4 No 2, pp. 258-282 (1982).
13. R. Pichler: Algorithms on Atomic Representations of Herbrand Models, in Proceedings of Logics in AI - JELIA’98, LNAI 1489, pp. 199-215, Springer (1998).
14. J.A. Robinson: A machine oriented logic based on the resolution principle, Journal of the ACM, Vol 12, No 1, pp. 23-41 (1965).
15. T. Sato, F. Motoyoshi: A complete Top-down Interpreter for First Order Programs, in Proceedings of ILPS’91, pp. 35-53, (1991).
16. S. Vorobyov: An Improved Lower Bound for the Elementary Theories of Trees, in Proceedings of CADE-13, LNAI 1104, pp. 275-287, Springer (1996)