Skip to main content
SpringerLink
Log in

Reasoning Theories

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Our long-term goal is the development of a general framework for specifying, structuring, and interoperating provers. Our main focus is on the formalization of the architectural and implementational choices that underlie the construction of such systems. This paper has two main goals. The first is to introduce the main intuitions underlying the proposed framework. We concentrate on its use in the integration of provers. The second is the development of the notion of reasoning theory, meant as the formalization of the notion of “implementation of the logic” of a prover. As an example we sketch an analysis, at the reasoning theory level, of the integration of linear arithmetic into the NQTHM simplification process.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Allen, S., Constable, R., Howe, D. and Aitken, W.: The semantics of reflected proof, in Fifth Annual Symposium on Logic in Computer Science, 1990, pp. 95-197.

  • Archer, M., Fink, G. and Yang, L.: Linking other theorem provers to HOL using PM: Proof manager, in Higher Order Logic Theorem Proving and its Applications (HUG'91), 1993, pp. 539-549.

  • Armando, A. and Ranise, S.: From integrated reasoning specialists to plug-and-play reasoning components, in Fourth International Conference on Artificial Intelligence and Symbolic Computation (AISC98), Plattsburgh, NY, 1998.

  • Ballarin, C., Homann, K. and Calmet, J.: Theorems and algorithms: An interface between Isabelle and Maple, in Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC'95), 1995, pp. 150-157.

  • Barwise, J. and Etchemendy, J.: Valid inference and visual representation, in W. Zimmerman and S. Cunningham (eds.), Visualization in Mathematics, Mathematical Association of America, 1990.

  • Bertoli, P.: Using OMRS for Real: A Case Study with ACL2, Ph.D. thesis, Computer Science Dept., University Rome 3, Rome, 1997.

    Google Scholar 

  • Bertoli, P., Calmet, J. and Giunchiglia, K. H. F.: Specification and integration of theorem provers and computer algebra systems, Technical Report 9804-03, IRST, Trento, Italy. Fourth International Conference on Artificial Intelligence and Symbolic Computation (AISC'98), 1998a.

  • Bertoli, P., Cimatti, A., Giunchiglia, F. and Traverso, P.: A structured approach to the formal certification of safety of computer aided development tools, Technical Report 9710-14, IRST, Trento, Italy. Seventeenth International Conference on Computer Safety, Reliability and Security (SAFECOMP'98), 1998b.

    Google Scholar 

  • Blaine, L., Gilham, L., Liu, J., Smith, D. and Westfold, S.: Planware-domain-specific synthesis of high-performance schedulers, in http://www.kestrel.edu, 1998.

  • Boyer, R. S. and Moore, J. S.: Integrating decision procedures into heuristic theorem provers: A case study of linear arithmetic, Technical Report ICSCA-CMP-44, Institute for Computing Science, University of Texas at Austin, 1985. Also published in Machine Intelligence 11, Oxford University Press, 1981.

  • Boyer, R. S. and Moore, J. S.: A Computational Logic Handbook, Academic Press, 1988.

  • Coglio, A.: Definizione di un formalismo per la specifica delle strategie di inferenza dei sistemi di ragionamento meccanizzato e sua applicazione ad un sistema allo stato dell'arte, Master's thesis, Faculty of Engineering, Genoa, Italy, 1996. English short abstract available at http://www.mrg.dist.unige.it/omrs.

    Google Scholar 

  • Coglio, A., Giunchiglia, F., Meseguer, J. and Talcott, C.: Composing and controlling search in reasoning theories using mappings, Technical Report, IRST, Trento, Italy, 1998.

    Google Scholar 

  • Coglio, A., Giunchiglia, F., Pecchiari, P. and Talcott, C.: A logic level specification of the NQTHM simplification process, Technical Report 9700-48, DIST-University of Genova, Genoa, Italy, 1997. Also IRST-Technical Report 9706-07, IRST, Trento, Italy.

    Google Scholar 

  • Constable, R. L. et al.: Implementing Mathematics with the Nuprl Development System, Prentice-Hall, 1986.

  • Farmer, W. M., Guttman, J. D. and Thayer, F. J.: IMPS: An interactive mathematical proof system, J. Automated Reasoning 11 (1993), 213-248.

    Google Scholar 

  • Feferman, S.: Inductively presented systems and the formalization of meta-mathematics, in D. van Dalen, D. Lascar and J. Smiley (eds.), Logic Colloquium 80, 1982, pp. 95-128.

  • Feferman, S.: Finitary inductively presented logics, in: Logic Colloquium 88, 1988, pp. 191-220.

  • Giunchiglia, F.: Multilanguage systems, in Proceedings of AAAI Spring Symposium on Logical Formalizations of Commonsense Reasoning, 1991. Also IRST-Technical Report no. 9011-17.

  • Giunchiglia, F.: Contextual reasoning, Epistemologia, special issue on I Linguaggi e le Macchine XVI (1993), 345-364.

    Google Scholar 

  • Giunchiglia, F., Pecchiari, P. and Armando, A.: Towards provably correct system synthesis and extension, J. Future Generation Computer Systems 12 (1996), 123-137.

    Google Scholar 

  • Goguen, J.,Winkler, T., Meseguer, J., Futatsugi, K. and Jouannaud, J.-P.: Introducing OBJ, Technical Report SRI-CSL-92-03, SRI International, Computer Science Laboratory, 1993. To appear in J. A. Goguen (ed.): Applications of Algebraic Specification Using OBJ, Cambridge University Press.

  • Gordon, M. J., Milner, A. J. and Wadsworth, C. P.: Edinburgh LCF: A Mechanized Logic of Computation, Lecture Notes in Computer Sci. 78, 1979, Springer-Verlag.

  • Harper, R., Honsell, H. and Plotkin, G.: A framework for defining logics, in Second Annual Symposium on Logic in Computer Science, 1987.

  • Harrison, J. and Théry, L.: Extending the HOL theorem prover with a computer algebra system to reason about the reals, in Higher Order Logic and Its Applications (HUG'93), 1993, pp. 174-184.

  • Janssen, G.: ROBDD Software, Department of Electrical Engineering Eindhoven, 1993.

  • Joyce, J. and Seger, C.: The HOL-Voss system: Model-checking inside a general-purpose theoremprover, in Higher Order Logic and Its Applications (HUG'93), 1993, pp. 187-200.

  • Kapur, D., Musser, D. and Niem, X.: The tecton proof system, in Proceedings of a Workshop on Formal Methods in Databases and Software Engineering, 1992, pp. 54-79.

  • Martí-Oliet, N. and Meseguer, J.: Rewriting logic as a logical and semantic framework, Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, 1993.

  • Meseguer, J.: General logics, in H.-D. E et al. (eds.), Logic Colloquium'87, 1989, pp. 275-329.

  • Meseguer, J.: Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci. 96(1) (1992), 73-155.

    Google Scholar 

  • Miller, D.: A logic programming language with lambda abstraction, function variables and simple unification, in P. Schroeder-Heister (ed.), Extensions of Logic Programming, Lecture Notes in Comput. Sci. 475, 1991, pp. 253-281.

  • Monk, L. G.: Inference rules using local contexts, J. Automated Reasoning 4 (1988), 445-462.

    Google Scholar 

  • Nelson, G. and Oppen, D.: Simplification by cooperating decision procedures, ACM Trans. on Programming Languages and Systems 1(2) (1979).

  • Owre, S., Rushby, J. and Shankar, N.: PVS: A prototype verification system, in Automated Deduction-CADE-11, Lecture Notes in Artificial Intelligence, 607, 1992, pp. 748-752.

  • Paulson, L. C.: Isabelle: The next 700 theorem provers, in P. Odifreddi (ed.), Logic and Computer Science, Academic Press, 1990, pp. 361-385.

  • Prawitz, D.: Natural Deduction: A Proof-Theoretical Study, Almquist and Wiksell, 1965.

  • Rajan, S., Shankar, N. and Srivas, M.: An integration of model-checking with automated proof checking, in P. Wolper (ed.), Computer-Aided Verification, CAV '95, Lecture Notes in Comput. Sci. 939, 1995, pp. 84-97.

  • Schneider, K., Kumar, R. and Kropf, T.: Automating most parts of hardware proofs in HOL, in Proceedings of the Third Workshop on Computer Aided Verification, CAV 91, 1991, pp. 454-465.

  • Scott, D. S.: Rules and derived rules, in S. Stenlund (ed.), Logical Theory and Semantic Analysis, D. Reidel, 1974, pp. 147-161.

  • Shaw, M. andGarlan, D.: Software Architecture-Perspectives on an Emerging Discipline, Prentice-Hall, 1996

  • Shoenfield, J. R.: Mathematical Logic, Addison-Wesley, 1967.

  • Shostak, R. E.: Deciding combinations of theories, Technical Report CSL-132, SRI International, 1982.

  • Srinivas, Y. and Jullig, R.: Specware (TM): Formal support for composing software, in Proceedings of the Conference on Mathematics of Program Construction, Kloster Irsee, Germany, 1995.

    Google Scholar 

  • Talcott, C.: Database of automated reasoning systems, 1999. Accessible by anonymous ftp or WWW. URL = file://sail.stanford.edu/pub/clt/ARS.

  • Talcott, C. L.: A theory of binding structures and its applications to rewriting, Theoret. Comput. Sci. 112 (1993), 99-143.

    Google Scholar 

  • Talcott, C. L.: Reasoning specialists should be logical services, not black boxes, in Proceedings of CADE-12 Workshop on Theory Reasoning in Automated Deduction, 1994, pp. 1-6.

  • Tarski, A.: On some fundamental concepts of Metamathematics, in J. Corcoran (ed.), Logic, Semantics, Metamathematics, Hackett Publishing Company, 1983, Chapt. III, pp. 30-37. Originally published 1930.

  • Weyhrauch, R. W.: Prolegomena to a theory of formal reasoning, Artif. Intell. 13 (1980), 133-170.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Trento and IRST, Trento, Italy

    F. Giunchiglia

  2. University of Genova, Genoa, Italy

    P. Pecchiari

  3. Stanford University, Stanford, California, U.S.A.

    C. Talcott

Authors
  1. F. Giunchiglia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Pecchiari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Talcott
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giunchiglia, F., Pecchiari, P. & Talcott, C. Reasoning Theories. Journal of Automated Reasoning 26, 291–331 (2001). https://doi.org/10.1023/A:1006407208923

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006407208923

Search

Navigation