Applications of Automated Reasoning

  • Ulrich Furbach
  • Claudia Obermaier
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4314)

Abstract

This paper offers an informal overview and discussion on first order predicate logic reasoning systems together with a description of applications which are carried out in the Artificial Intelligence Research Group of the University in Koblenz. Furthermore the technique of knowledge compilation is shortly introduced.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABB+02]
    Ahrendt, W., et al.: The KeY System: Integrating Object-Oriented Design and Formal Methods. In: Kutsche, R.-D., Weber, H. (eds.) ETAPS 2002 and FASE 2002. LNCS, vol. 2306, pp. 327–330. Springer, Heidelberg (2002)Google Scholar
  2. [BCM+03]
    Baader, F., et al. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)MATHGoogle Scholar
  3. [BF97]
    Baumgartner, P., Furbach, U.: Calculi for Disjunctive Logic Programming. In: Maluszynski, J. (ed.) Logic Programming - Proceedings of the 1997 International Symposium, New York, The MIT Press, Cambridge (1997)Google Scholar
  4. [BFGHK04]
    Baumgartner, P., et al.: Model Based Deduction for Database Schema Reasoning. In: Biundo, S., Frühwirth, T., Palm, G. (eds.) KI 2004. LNCS (LNAI), vol. 3238, pp. 168–182. Springer, Heidelberg (2004)Google Scholar
  5. [BFGHS04]
    Baumgartner, P., et al.: Living Book - Deduction, Slicing, and Interaction. J. Autom. Reasoning 32(3), 259–286 (2004)CrossRefGoogle Scholar
  6. [BFN96]
    Baumgartner, P., Furbach, U., Niemelä, I.: Hyper Tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol. 1126, pp. 1–17. Springer, Heidelberg (1996)Google Scholar
  7. [BG01]
    Bachmair, L., Ganzinger, H.: Resolution Theorem Proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning (in 2 volumes), pp. 19–99. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  8. [BHOS96]
    Beckert, B., et al.: The Tableau-based Theorem Prover \(_{\mbox{3}}\)T\(^{\mbox{A}}\)P Version 4.0. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol. 1104, pp. 303–307. Springer, Heidelberg (1996)Google Scholar
  9. [Dar01]
    Darwiche, A.: Decomposable Negation Normal Form. Journal of the ACM 48(4) (2001), citeseer.ist.psu.edu/477720.html
  10. [Dar04]
    Darwiche, A.: New Advances in Compiling CNF into Decomposable Negation Normal Form. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI’2004, pp. 328–332 (2004)Google Scholar
  11. [DFN01]
    Dix, J., Furbach, U., Niemelä, I.: Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning (in 2 volumes), pp. 1241–1354. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  12. [FGHT+04]
    Furbach, U., et al.: Issues Management: Erkennen und Beherrschen von kommunikativen Risiken und Chancen. Fachberichte Informatik 2–2004, Universität Koblenz-Landau, Institut für Informatik, Koblenz (2004)Google Scholar
  13. [Fur03]
    Furbach, U.: AI – A Multiple Book Review. Artificial Intelligence 145(1-2), 245 (2003)CrossRefGoogle Scholar
  14. [Hen96]
    Henzinger, T.A.: The Theory of Hybrid Automata. In: Proceedings of the IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 278–292. IEEE Computer Society Press, Los Alamitos (1996)CrossRefGoogle Scholar
  15. [HL02]
    Hillenbrand, T., Löchner, B.: The Next WALDMEISTER Loop. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol. 2392, pp. 486–500. Springer, Heidelberg (2002)Google Scholar
  16. [KK71]
    Kowalski, R.A., Kuehner, D.: Linear Resolution with Selection Function. Artificial Intelligence 2, 227–260 (1971)MATHCrossRefMathSciNetGoogle Scholar
  17. [KS05a]
    Kleemann, T., Sinner, A.: Decision Support for Personalization on Mobile Devices. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 404–406. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. [KS05b]
    Kleemann, T., Sinner, A.: Krhyper - in your Pocket, System Description. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 452–458. Springer, Heidelberg (2005)Google Scholar
  19. [Lov68]
    Loveland, D.: Mechanical Theorem Proving by Model Elimination. JACM 15(2) (1968)Google Scholar
  20. [Mas99]
    Massacci, F.: Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol. 1617, pp. 14–18. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  21. [McC90]
    McCune, W.: Otter 2.0. In: Stickel, M.E. (ed.) CADE 1990. LNCS, vol. 449, pp. 663–664. Springer, Heidelberg (1990)Google Scholar
  22. [McC97]
    McCune, W.: Solution of the Robbins Problem. J. Autom. Reasoning 19(3), 263–276 (1997)MATHCrossRefMathSciNetGoogle Scholar
  23. [PMG97]
    Poole, D., Mackworth, A., Goebel, R.: Computational Intelligence: A Logical Approach. Oxford University Press, Oxford (1997)Google Scholar
  24. [PSS02]
    Pelletier, F., Sutcliffe, G., Suttner, C.: The Development of CASC. AI Communications 15(2-3), 79–90 (2002)MATHGoogle Scholar
  25. [RV01]
    Robinson, J.A., Voronkov, A.: Handbook of Automated Reasoning (in 2 volumes). Elsevier, Amsterdam (2001)MATHGoogle Scholar
  26. [RV02]
    Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2-3), 91–110 (2002)MATHGoogle Scholar
  27. [Sch04]
    Schulz, S.: System description: E 0.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 223–228. Springer, Heidelberg (2004)Google Scholar
  28. [SS98]
    Sutcliffe, G., Suttner, C.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning 21(2), 177–203 (1998)MATHCrossRefMathSciNetGoogle Scholar
  29. [Wei97]
    Weidenbach, C.: Spass - version 0.49. Journal of Automated Reasoning 18(2), 247–252 (1997)CrossRefGoogle Scholar
  30. [Wer03]
    Wernhard, C.: System Description: KRHyper. Fachberichte Informatik 14–2003, Universität Koblenz-Landau, Institut für Informatik, Koblenz (2003)Google Scholar
  31. [Wer06]
    Wernhard, C.: Tableaux Between Proving, Projection and Compilation. Technical report, Universität Koblenz-Landau. In preparation (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Ulrich Furbach
    • 1
  • Claudia Obermaier
    • 1
  1. 1.Universität Koblenz-Landau, D56070 KoblenzGermany

Personalised recommendations