An ATP of a Relational Proof System for Order of Magnitude Reasoning with Negligibility, Non-closeness and Distance

  • Joanna Golińska-Pilarek
  • Angel Mora
  • Emilio Muñoz-Velasco
Conference paper

DOI: 10.1007/978-3-540-89197-0_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5351)
Cite this paper as:
Golińska-Pilarek J., Mora A., Muñoz-Velasco E. (2008) An ATP of a Relational Proof System for Order of Magnitude Reasoning with Negligibility, Non-closeness and Distance. In: Ho TB., Zhou ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science, vol 5351. Springer, Berlin, Heidelberg

Abstract

We introduce an Automatic Theorem Prover (ATP) of a dual tableau system for a relational logic for order of magnitude qualitative reasoning, which allows us to deal with relations such as negligibility, non-closeness and distance. Dual tableau systems are validity checkers that can serve as a tool for verification of a variety of tasks in order of magnitude reasoning, such as the use of qualitative sum of some classes of numbers. In the design of our ATP, we have introduced some heuristics, such as the so called phantom variables, which improve the efficiency of the selection of variables used un the proof.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Joanna Golińska-Pilarek
    • 1
  • Angel Mora
    • 2
  • Emilio Muñoz-Velasco
    • 2
  1. 1.Institute of PhilosophyWarsaw University, National Institute of TelecommunicationsPoland
  2. 2.Dept. Matemática AplicadaUniversidad de MálagaSpain

Personalised recommendations