Integrating constraint solving into proof planning

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

Volumn 1794, Issue , 2000, Pages 32-46

  Melis, Erica ^a   Zimmer, Jürgen ^a   Müller, Tobias ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS);

CONSTRAINT SOLVERS; CONSTRAINT SOLVING; INTEGRATING CONSTRAINTS; MATHEMATICAL OBJECTS; N EXTENSIONS; PROOF-PLANNING; SPECIFIC PROPERTIES;

LOGIC PROGRAMMING;

EID: 84949204840     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10720084_3     Document Type: Conference Paper

References (20)

1. A. Aiba and R. Hasegawa. Constraint Logic Programming System - CAL, GDCC and Their Constraint Solvers. In Proc. of the Conference on Fifth Generation Computer Systems., pages 113-131. ICOT, 1992.
2. R.G. Bartle and D.R. Sherbert. Introduction to Real Analysis. John Wiley& Sons, New York, 1982.
3. C. Benzmueller, L. Cheikhrouhou, D. Fehrer, A. Fiedler, X. Huang, M. Kerber, M. Kohlhase, K. Konrad, A. Meier, E. Melis, W. Schaarschmidt, J. Siekmann, and V. Sorge. OMEGA: Towards a Mathematical Assistant. In W. McCune, editor, Proc. of CADE-14. Springer, 1997.
4. R. S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study of Linear Arithmetic. Machine Intelligence (Logic and the Acquisition of Knowledge), 11, 1988.
5. A. Bundy. The Use of Explicit Plans to Guide Inductive Proofs. In E. Lusk and R. Overbeek, editors, Proc. CADE-9, LNCS 310, Argonne, 1988. Springer.
6. H.-J. Burckert. A Resolution Principle for Constrained Logics. Artificial Intelligence, 66(2), 1994.
7. T. Fruhwirth. Constraint Handling Rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, LNCS 910. Springer, 1995.
8. J. Jaffar and J-L. Lassez. Constraint Logic Programming. In Proc. 14th ACM Symposium on Principles of Programming Languages, 1987.
9. A. K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99-118, 1977.
10. E. Melis. AI-Techniques in Proof Planning. In European Conference on Artificial Intelligence. Kluwer Academic, 1998.
11. E. Melis. Combining Proof Planning with Constraint Solving. In Proceedings of Calculemus and Types’98, 1998. Electronic Proceedings http://www.win.tue.nl/math/dw/pp/calc/proceedings.html.
12. E. Melis and J.H. Siekmann. Knowledge-based Proof Planning. Artificial Intelligence, 115(1):65-105, 1999.
13. E. Melis and V. Sorge. Employing External Reasoners in Proof Planning. In A. Armando and T. Jebelean, editors, Calculemus’99, 1999.
14. S. Mittal and B. Falkenhainer. Dynamic Constraint Satisfaction Problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAI-90, pages 25-32, Boston, MA, 1990.
15. E. Monfroy and Ch. Ringeissen. SoleX: a Domain-Independent Scheme for Constraint Solver Extension. In J. Calmet and J. Plaza, editors, Artificial Intelligence and Symbolic Computation AISC’98, LNAI 1476. Springer, 1998.
16. The Mozart Consortium. The Mozart Programming System. http://www.mozart-oz.org/.
17. D. Prawitz. Natural Deduction - A Proof Theoretical Study. Almquist and Wiksell, Stockholm, 1965.
18. G. Smolka. The Oz programming model. In Jan van Leeuwen, editor, Current Trends in Computer Science. Springer, 1995.
19. M.K. Stickel. Automated Deduction by Theory Resolution. In Proc. of the 9th International Joint Conference on Artificial Intelligence, 1985.
20. F. Stolzenburg. Membership Constraints and Complexity in Logic Programming with Sets. In F. Baader and U. Schulz, editors, Frontiers in Combining Systems. Kluwer Academic, 1996.