Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mathematical Knowledge Management

MKM 2004: Mathematical Knowledge Management pp 205–219Cite as

Predicate Logic with Sequence Variables and Sequence Function Symbols

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3119))

Abstract

We extend first-order logic with sequence variables and sequence functions. We describe syntax, semantics and inference system for the extension, define an inductive theory with sequence variables and formulate induction rules. The calculus forms a basis for the top-down systematic theory exploration paradigm.

Supported by the Austrian Science Foundation (FWF) under Project SFB F1302, and Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. An Interactive Mathematical Proof System, http://imps.mcmaster.ca/

  2. The Coq Proof Assistant, http://coq.inria.fr/

  3. The MIZAR Project, http://www.mizar.org/

  4. The OMEGA System, http://www.ags.uni-sb.de/~omega/

  5. Bledsoe, W.W., Feng, G.: SET-VAR. J. Automated Reasoning 11(3), 293–314 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Boley, H.: A Tight, Practical Integration of Relations and Functions. LNCS (LNAI), vol. 1712. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  7. Buchberger, B.: Mathematica as a rewrite language. In: Ida, T., Ohori, A., Takeichi, M. (eds.) Proc. of the 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village Center, Japan, November 1-4, 1996, pp. 1–13. World Scientific, Singapore (1996)

    Google Scholar 

  8. Buchberger, B.: Theory exploration with theorema. Analele Universitatii Din Timisoara, ser. Matematica-Informatica XXXVIII(2), 9–32 (2000)

    MathSciNet  MATH  Google Scholar 

  9. Buchberger, B.: Algorithm invention and verification by lazy thinking. In: Petcu, D., Zaharie, D., Negru, V., Jebelean, T. (eds.) Proc. of the 5th Int. Workshop on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2003), Timisoara, Romania, October 1-4, 2003, pp. 2–26. Mirton (2003)

    Google Scholar 

  10. Buchberger, B., Craciun, A.: Algorithm synthesis by lazy thinking: Examples and implementation in theorema. In: Proc. of the Mathematical Knowledge Management Symposium, Edinburgh, UK, November 25-29, 2003. ENTCS, vol. 93, pp. 24–59. Elsevier Science, Amsterdam (2003)

    Google Scholar 

  11. Clarke, E., Kohlhase, M., Ouaknine, J., Sutner, K.: System description: analytica 2. In: Hardin, T., Rioboo, R. (eds.) Proc. of the 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2003), Rome, Italy, September 10-12, 2003, pp. 10–12. Aracne Editrice S.R.L (2003)

    Google Scholar 

  12. Constable, R.: Implementing Mathematics Using the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs (1986)

    Google Scholar 

  13. de Bruijn, N.G.: The mathematical language automath, its usage, and some of its extensions. In: Laudet, M., Lacombe, D., Nolin, L., Schützenberger, M. (eds.) Proc. of Symposium on Automatic Demonstration, Versailles, France. LN in Mathematics, vol. 125, pp. 29–61. Springer, Berlin (1970)

    Chapter  Google Scholar 

  14. Degtyarev, A., Voronkov, A.: Equality reasoning in sequent-based calculi. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. I, ch 10, pp. 611–706. Elsevier Science, Amsterdam (2001)

    Chapter  Google Scholar 

  15. Genesereth, M.R., Petrie, Ch., Hinrichs, T., Hondroulis, A., Kassoff, M., Love, N., Mohsin, W.: Knowledge Interchange Format, draft proposed American National Standard (dpANS), Technical Report NCITS.T2/98-004 (1998), http://logic.stanford.edu/kif/dpans.html

  16. Gentzen, G.: Untersuchungen über das logische schließen. Mathematical Zeitschrift 39, 176–210 (1934)

    Article  MathSciNet  MATH  Google Scholar 

  17. Gordon, M., Melham, T.: Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge (1993)

    MATH  Google Scholar 

  18. Common Logic Working Group, Common logic: Abstract syntax and semantics (2003), http://cl.tamu.edu/docs/cl/1.0/cl-1.0.pdf

  19. Hayes, P., Menzel, C.: Semantics of knowledge interchange format (2001), http://reliant.teknowledge.com/IJCAI01/HayesMenzel-SKIF-IJCAI2001.pdf

  20. Konev, B., Jebelean, T.: Using meta-variables for natural deduction in Theorema. In: Kerber, M., Kohlhase, M. (eds.) Proc. of Calculemus 2000 Conference, August 6-7, 2000, St. Andrews, UK (2000)

    Google Scholar 

  21. Kutsia, T.: Solving and proving in equational theories with sequence variables and flexible arity symbols, Technical Report 02-31, RISC. Johannes Kepler University, Linz, Austria (2002)

    Google Scholar 

  22. Kutsia, T.: Theorem proving with sequence variables and flexible arity symbols. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 278–291. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  23. Kutsia, T.: Solving equations involving sequence variables and sequence functions, Technical Report 04-01, RISC. Johannes Kepler University, Linz, Austria (2004)

    Google Scholar 

  24. Kutsia, T., Buchberger, B.: Predicate logic with sequence variables and sequence function symbols, Technical report, SFB, Linz, Austria (2004)

    Google Scholar 

  25. Luo, Zh., Pollack, R.: LEGO proof development system: User’s manual, Technical Report ECS-LFCS-92-211. University of Edinburgh (1992)

    Google Scholar 

  26. Magnusson, L., Nordström, B.: The ALF proof editor and its proof engine. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol. 806, pp. 213–237. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  27. Nieuwenhuis, R., Rubio, A.: Theorem proving with ordering and equality constrained clauses. J. Symbolic Computation 19, 321–351 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  28. Paulson, L.: Isabelle: the next 700 theorem provers. In: Odifreddi, P. (ed.) Logic and Computer Science, pp. 361–386. Academic Press, London (1990)

    Google Scholar 

  29. Pfenning, F.: ELF: A meta-language for deductive systems. In: Bundy, A. (ed.) CADE 1994. LNCS (LNAI), vol. 814, pp. 811–815. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  30. Windsteiger, W.: Exploring an algorithm for polynomial interpolation in the Theorema system. In: Hardin, T., Rioboo, R. (eds.) Proc. of the 11th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (Calculemus 2003), Rome, Italy, September 10-12, 2003, pp. 130–136. Aracne Editrice S.R.L (2003)

    Google Scholar 

  31. Wolfram, S.: The MATHEMATICA Book, 4th edn. Cambridge University Press and Wolfram Research, Inc. (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes Kepler University Linz, A-4040, Linz, Austria

    Temur Kutsia & Bruno Buchberger

Authors
  1. Temur Kutsia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Buchberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Bologna, Mura Anteo Zamboni, 7, 40127, Bologna, Italy

    Andrea Asperti

  2. Faculty of Computer Science, Białystok Technical University, Poland

    Grzegorz Bancerek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kutsia, T., Buchberger, B. (2004). Predicate Logic with Sequence Variables and Sequence Function Symbols. In: Asperti, A., Bancerek, G., Trybulec, A. (eds) Mathematical Knowledge Management. MKM 2004. Lecture Notes in Computer Science, vol 3119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27818-4_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27818-4_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23029-8

  • Online ISBN: 978-3-540-27818-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation