An Order Hyperresolution Calculus for Gödel Logic - General First-order Case

Dušan Guller

Abstract

This paper addresses the deduction problem of a formula from a countable theory in the first-order G\"{o}del logic from a perspective of automated deduction. Our approach is based on the translation of a formula to an equivalent satisfiable CNF one, which contains literals of the augmented form: either a or a → b or (a→b) →b or Qx c→ a or a→Qx c where a, c are atoms different from 0 (the false), 1 (the true); b is an atom different from 1; Q ∈ {∀,∃}; x is a variable occurring in c. A CNF formula is further translated to an equivalent satisfiable finite order clausal theory, which consists of order clauses - finite sets of order literals of the form: either a ≖ b or Qx c ≖ a or a ≖ Qx c or a ≺ b or Qx c ≺ a or a ≺ Qx c where a, b, c are atoms; Q ∈ {∀,∃}; x is a variable occurring in c. ≖ and ≺ are interpreted by the equality and strict linear order on [0,1], respectively. For an input theory, the proposed translation produces a so-called semantically admissible order clausal theory. An order hyperresolution calculus, operating on semantically admissible order clausal theories, is devised. The calculus is proved to be refutation sound and complete for the countable case.

References

  1. Baaz, M., Ciabattoni, A., and Fermüller, C. G. (2001). Herbrand's theorem for prenex Gödel logic and its consequences for theorem proving. In Nieuwenhuis, R. and Voronkov, A., editors, LPAR, volume 2250 of Lecture Notes in Computer Science, pages 201-215. Springer.
  2. Baaz, M., Ciabattoni, A., and Fermüller, C. G. (2003). Hypersequent calculi for Gödel logics - a survey. J. Log. Comput., 13(6):835-861.
  3. Baaz, M. and Fermüller, C. G. (2010). A resolution mechanism for prenex Gödel logic. In Dawar, A. and Veith, H., editors, CSL, volume 6247 of Lecture Notes in Computer Science, pages 67-79. Springer.
  4. Bachmair, L. and Ganzinger, H. (1994). Rewrite-based equational theorem proving with selection and simplification. J. Log. Comput., 4(3):217-247.
  5. Bachmair, L. and Ganzinger, H. (1998). Ordered chaining calculi for first-order theories of transitive relations. J. ACM, 45(6):1007-1049.
  6. de la Tour, T. B. (1992). An optimality result for clause form translation. J. Symb. Comput., 14(4):283-302.
  7. 3 jlj
  8. 3 jlj
  9. Guller, D. (2010). A DPLL procedure for the propositional G ödel logic. In Filipe, J. and Kacprzyk, J., editors, IJCCI (ICFC-ICNC), pages 31-42. SciTePress.
  10. Guller, D. (2012). On the satisfiability and validity problems in the propositional Gö del logic. In Madani, K., Dourado Correia, A., Rosa, A., and Filipe, J., editors, Computational Intelligence, volume 399 of Studies in Computational Intelligence, pages 211-227. Springer Berlin / Heidelberg.
  11. Marchioni, E. and Metcalfe, G. (2010). Interpolation properties for uninorm based logics. In ISMVL, pages 205- 210. IEEE Computer Society.
  12. Nonnengart, A., Rock, G., and Weidenbach, C. (1998). On generating small clause normal forms. In Kirchner, C. and Kirchner, H., editors, CADE, volume 1421 of Lecture Notes in Computer Science, pages 397-411. Springer.
  13. Plaisted, D. A. and Greenbaum, S. (1986). A structurepreserving clause form translation. J. Symb. Comput., 2(3):293-304.
  14. Sheridan, D. (2004). The optimality of a fast CNF conversion and its use with SAT. In SAT.
Download


Paper Citation


in Harvard Style

Guller D. (2012). An Order Hyperresolution Calculus for Gödel Logic - General First-order Case . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 329-342. DOI: 10.5220/0004104103290342


in Bibtex Style

@conference{fcta12,
author={Dušan Guller},
title={An Order Hyperresolution Calculus for Gödel Logic - General First-order Case},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012)},
year={2012},
pages={329-342},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004104103290342},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: FCTA, (IJCCI 2012)
TI - An Order Hyperresolution Calculus for Gödel Logic - General First-order Case
SN - 978-989-8565-33-4
AU - Guller D.
PY - 2012
SP - 329
EP - 342
DO - 10.5220/0004104103290342