A framework for the flexible integration of a class of decision procedures into theorem provers

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

Volumn 1632, Issue , 1999, Pages 127-141

  Janičić, Predrag ^a   Bundy, Alan ^b   Green, Ian ^b  

^a UNIVERSITY OF BELGRADE   (Serbia)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; OPEN SYSTEMS;

DECISION PROCEDURE; FLEXIBLE INTEGRATION; PROOF METHODS; PROOF PLANNING SYSTEM; SEARCH SPACES; THEOREM PROVERS;

THEOREM PROVING;

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

References (20)

1. L. Bachmair and H. Ganzinger. Strict basic superposition. In Kirchner and Kirchner [12], pages 160-174.
2. L. Bachmair, H. Ganzinger, and A. Voronkov. Elimination of equality via transformation with ordering constraints. In Kirchner and Kirchner [12], pages 175-190.
3. R. S. Boyer and J S. Moore. Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic. In J. E. Hayes, J. Richards, and Michie, editors, Machine Intelligence 11, pages 83-124, 1988.
4. A. Bundy. The use of proof plans for normalization. In R. S. Boyer, editor, Essays in Honor of Woody Bledsoe, pages 149-166. Kluwer, 1991.
5. A. Bundy, F. van Harmelen, C. Horn, and A. Smaill. The Oyster-Clam system. In M. E. Stickel, editor, 10th International Conference on Automated Deduction, pages 647-648. Springer-Verlag, 1990. Lecture Notes in Artificial Intelligence No. 449.
6. D. C. Cooper. Theorem proving in arithmetic without multiplication. In B. Meltzer and D. Michie, editors, Machine Intelligence 7, pages 91-99. Edinburgh University Press, 1972.
7. D. Cyrluk, P. Lincoln, and N. Shankar. On Shostak's decision procedure for combinations of theories. In M. McRobbie and J. Slaney, editors, 13th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, Vol. 1104, New Brunswick, NJ, USA, 1996. Springer-Verlag.
8. User guide for the EHdM specification language and verification system, version 6.1. Technical report, SRI Computer Science Laboratory, 1993.
9. L. Hodes. Solving problems by formula manipulation in logic and linear inequalities. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence, pages 553-559, Imperial College, London, England, 1971. The British Computer Society.
10. P. Janicic, I. Green, and A. Bundy. A comparison of decision procedures in Presburger arithmetic. In R. Tosic and Z. Budimac, editors, Proceedings of the VIII Conference on Logic and Computer Science (LIRA’97), pages 91-101, Novi Sad, Yugoslavia, September 1-4 1997. University of Novi Sad.
11. D. Kapur and X. Nie. Reasoning about numbers in Tecton. In Proceedings of 8th International Symposium on Methodologies for Intelligent Systems, Charlotte, North Carolina, USA, October 1994.
12. C. Kirchner and H. Kirchner, editors. 15th International Conference on Automated Deduction, Lindau, Germany, July 1998.
13. G. Kreisel and J. L. Krivine. Elements of mathematical logic: Model theory. North Holland, Amsterdam, 1967.
14. D. C. Luckham, S. M. German, F. W. von Henke, R. A. Karp, P. W. Milne, D. C. Oppen, W. Polak, and W. L. Scherlis. Stanford Pascal verifier user manual. CSD Report STAN-CS-79-731, Stanford University, 1979.
15. Z. Manna et al. STeP: The Stanford Temporal Prover. Technical Report STAN- CS-TR;94-1518, Stanford University, 1994.
16. G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, October 1979.
17. S. Owre, S. Rajan, J. M. Rushby, N. Shankar, and M. K. Srivas. PVS: Combining specification, proof checking, and model checking. In R. Alur and T. A. Henzinger, editors, Proceedings of the 1996 Conference on Computer-Aided Verification, number 1102 in LNCS, pages 411-414, New Brunswick, New Jersey, U. S. A., 1996. Springer-Verlag.
18. M. Presburger. Uber die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Sprawozdanie z I Kongresu metematykow slowianskich, Warszawa 1929, pages 92-101, 395. Warsaw, 1930. Annotated English version also available [20].
19. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, January 1984.
20. R. Stansifer. Presburger's article on integer arithmetic: Remarks and translation. Technical Report TR 84-639, Department of Computer Science, Cornell University, September 1984.