Skip to main content

Research Perspectives for Logic and Deduction

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4155))

Abstract

The article is meant to be kind of the author’s manifesto for the role of logic and deduction within Intellectics. Based on a brief analysis of this role the paper presents a number of proposals for future scientific research along the various dimensions in the space of logical explorations. These dimensions include the range of possible applications including modelling intelligent behavior, the grounding of logic in some semantic context, the choice of an appropriate logic from the great variety of alternatives, then the choice of an appropriate formal system for representing the chosen logic, and finally the issue of developing the most efficient search strategies. Among the proposals is a conjecture concerning the treatment of cuts in proof search.

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

Buying options

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. Aiello, L.: Automatic generation of semantic attachments in FOL. In: Balzer, R. (ed.) Proceedings of AAAI 1980. AAAI, Menlo Park (1980)

    Google Scholar 

  2. Becket, R., de la Banda, M.G., Marriott, K., Somogyi, Z., Stuckey, P.J., Wallace, M.: Adding constraint solving to mercury. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 118–133. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Bibel, W.: Syntax–directed, semantics–supported program synthesis. Artificial Intelligence 14, 243–261 (1980)

    Article  Google Scholar 

  4. Bibel, W.: Automated Theorem Proving, 2nd edn. Vieweg Verlag, Braunschweig (1987)

    MATH  Google Scholar 

  5. Bibel, W.: Short proofs of the pigeonhole formulas based on the connection method. Journal of Automated Reasoning (1990)

    Google Scholar 

  6. Bibel, W.: Intellectics. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, pp. 705–706. John Wiley, New York (1992)

    Google Scholar 

  7. Bibel, W.: Deduction: Automated Logic. Academic Press, London (1993)

    Google Scholar 

  8. Bibel, W.: Lehren vom Leben – Essays über Mensch und Gesellschaft. In: Sozialwissenschaft. Deutscher Universitäts Verlag, Wiesbaden (2003)

    Google Scholar 

  9. Bibel, W.: Transition logic revisited (submitted, 2004)

    Google Scholar 

  10. Bibel, W.: AI and the conquest of complexity in law. Artificial Intelligence and Law Journal 12, 159–180 (2005)

    Article  MathSciNet  Google Scholar 

  11. Bibel, W.: Information technology. Technical report, European Commission (2005), ftp://ftp.cordis.lu/pub/foresight/docs/kte_informationtech.pdf

  12. Birattari, M.: The Problem of Tuning Metaheuristics as seen from a machine learning perspective. In: DISKI, vol. 292. Akademische Verlagsgesellschaft Aka, Berlin (2005)

    Google Scholar 

  13. Brünnler, K., Guglielmi, A.: A first order system with finite choice of premises. In: Hendricks, V., Neuhaus, F., Pedersen, S.A., Scheffler, U., Wansing, H. (eds.) First-Order Logic Revisited, Logische Philosophie, pp. 59–74. Logos Verlag, Berlin (2004)

    Google Scholar 

  14. Eder, E.: The cut rule in theorem proving. In: Hölldobler, S. (ed.) Intellectics and Computational Logic. Applied Logic Series, vol. 19, pp. 101–123. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  15. Emmott, S.: Towards 2020 science. Technical report, Microsoft Research Cambridge (2006), http://research.microsoft.com/towards2020science/

  16. Feigenbaum, E.A.: Stories of AAAI – Before the beginning and after – A love letter. AI Magazine 26(4), 30–35 (2005)

    Google Scholar 

  17. Haken, A.: The intractability of resolution. Theor. Comput. Sci. 39, 297–308 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  18. Japaridze, G.: Introduction to cirquent calculus and abstract resource semantics. Journal of Logic and Computation (to appear, 2005), see: http://arxiv.org/abs/math.LO/0506553

  19. Johnson-Laird, P.N., Byrne, R.M.J.: Deduction. Lawrence Erlbaum Associates, Hove (1991)

    Google Scholar 

  20. Kahramanoğulları, O.: Towards planning as concurrency. In: Hamza, M.H. (ed.) Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, AIA 2005, February 14-16, pp. 387–394. Acta Press, Innsbruck (2005)

    Google Scholar 

  21. Kurzweil, R.: The Singularity Is Near – When Humans Transcend Biology, Viking. Penguin Group, New York (2005)

    Google Scholar 

  22. Lamarche, F., Straßburger, L.: Naming proofs in classical propositional logic. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 246–261. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  23. Letz, R., Mayr, K., Goller, C.: Controlled integration of the cut rule into connection tableaux calculi. Journal of Automated Reasoning 13, 297–337 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  24. Letz, R., Schumann, J., Bayerl, S., Bibel, W.: SETHEO — A high-performance theorem prover for first-order logic. Journal of Automated Reasoning 8(2), 183–212 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  25. Lovelock, J.: The Revenge of Gaia: Why the Earth Is Fighting Back – and How We Can Still Save Humanity, Allen Lane (2006)

    Google Scholar 

  26. Otten, J.: Clausal connection-based theorem proving in intuitionistic first-order logic. In: Beckert, B. (ed.) TABLEAUX 2005. LNCS, vol. 3702, pp. 245–261. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  27. Otten, J., Bibel, W.: leanCoP: Lean connection-based theorem proving. Journal of Symbolic Computation 36, 139–161 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  28. Poole, D.: First-order probabilistic inference. In: Proceedings of the 8th International Joint Conference on Artificial Intelligence, pp. 985–991 (2003)

    Google Scholar 

  29. Robinson, J.A.: Proof = guarantee + explanation. In: Hölldobler, S. (ed.) Intellectics and Computational Logic. Applied Logic Series, vol. 19, pp. 277–294. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bibel, W. (2006). Research Perspectives for Logic and Deduction. In: Stock, O., Schaerf, M. (eds) Reasoning, Action and Interaction in AI Theories and Systems. Lecture Notes in Computer Science(), vol 4155. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11829263_2

Download citation

  • DOI: https://doi.org/10.1007/11829263_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37901-0

  • Online ISBN: 978-3-540-37902-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics