An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta

Dušan Guller

2015

Abstract

In (Guller, 2014), we have generalised the well-known hyperresolution principle to the first-order Godel logic ¨ with truth constants. This paper is a continuation of our work. We propose a hyperresolution calculus suitable for automated deduction in a useful expansion of Godel logic by intermediate truth constants and the equality, ¨ P, strict order, ≺, projection, ∆, operators. We solve the deduction problem of a formula from a countable theory in this expansion. We expand Godel logic by a countable set of intermediate truth constants ¯ ¨ c, c ∈ (0,1). Our approach is based on translation of a formula to an equivalent satisfiable finite order clausal theory, consisting of order clauses. An order clause is a finite set of order literals of the form ε1  ε2 where εi is an atom or a quantified atom, and  is the connective P or ≺. P and ≺ are interpreted by the equality and standard strict linear order on [0,1], respectively. We shall investigate the so-called canonical standard completeness, where the semantics of Godel logic is given by the standard ¨ G-algebra and truth constants are interpreted by ’themselves’. The hyperresolution calculus is refutation sound and complete for a countable order clausal theory under a certain condition for the set of truth constants occurring in the theory. As an interesting consequence, we get an affirmative solution to the open problem of recursive enumerability of unsatisfiable formulae in Godel logic with truth constants and the equality, ¨ P, strict order, ≺, projection, ∆, operators.

References

  1. Apt, K. R. (1988). Introduction to logic programming. Technical Report CS-R8826, Centre for Mathematics and Computer Science, Amsterdam, The Netherlands.
  2. Baaz, M., Ciabattoni, A., and Ferm üller, C. G. (2012). Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability. Logical Methods in Computer Science, 8(1).
  3. de la Tour, T. B. (1992). An optimality result for clause form translation. J. Symb. Comput., 14(4):283-302.
  4. Esteva, F., Gispert, J., Godo, L., and Noguera, C. (2007a). Adding truth-constants to logics of continuous tnorms: axiomatization and completeness results. Fuzzy Sets and Systems, 158(6):597-618.
  5. Esteva, F., Godo, L., and Montagna, F. (2001). The L ? and L ? 12 logics: two complete fuzzy systems joining Lukasiewicz and Product logics. Arch. Math. Log., 40(1):39-67.
  6. Esteva, F., Godo, L., and Noguera, C. (2007b). On completeness results for the expansions with truthconstants of some predicate fuzzy logics. In Stepnicka, M., Novák, V., and Bodenhofer, U., editors, New Dimensions in Fuzzy Logic and Related Technologies. Proceedings of the 5th EUSFLAT Conference, Ostrava, Czech Republic, September 11-14, 2007, Volume 2: Regular Sessions, pages 21-26. Universitas Ostraviensis.
  7. Esteva, F., Godo, L., and Noguera, C. (2009). First-order t-norm based fuzzy logics with truth-constants: distinguished semantics and completeness properties. Ann. Pure Appl. Logic, 161(2):185-202.
  8. Esteva, F., Godo, L., and Noguera, C. (2010a). Expanding the propositional logic of a t-norm with truthconstants: completeness results for rational semantics. Soft Comput., 14(3):273-284.
  9. Esteva, F., Godo, L., and Noguera, C. (2010b). On expansions of WNM t-norm based logics with truthconstants. Fuzzy Sets and Systems, 161(3):347-368.
  10. Guller, D. (2009). On the refutational completeness of signed binary resolution and hyperresolution. Fuzzy Sets and Systems, 160(8):1162 - 1176. Featured Issue: Formal Methods for Fuzzy Mathematics, Approximation and Reasoning, Part II.
  11. Guller, D. (2010). A DPLL procedure for the propositional G ödel logic. In Filipe, J. and Kacprzyk, J., editors, ICFC-ICNC 2010 - Proceedings of the International Conference on Fuzzy Computation and International Conference on Neural Computation, [parts of the International Joint Conference on Computational Intelligence IJCCI 2010], Valencia, Spain, October 24-26, 2010, pages 31-42. SciTePress.
  12. Guller, D. (2012). An order hyperresolution calculus for G ödel logic - General first-order case. In Rosa, A. C., Correia, A. D., Madani, K., Filipe, J., and Kacprzyk, J., editors, IJCCI 2012 - Proceedings of the 4th International Joint Conference on Computational Intelligence, Barcelona, Spain, 5 - 7 October, 2012, pages 329-342. SciTePress.
  13. Guller, D. (2014). An order hyperresolution calculus for G ödel logic with truth constants. In Rosa, A. C., Dourado, A., Correia, K. M., Filipe, J., and Kacprzyk, J., editors, FCTA 2014 - Proceedings of the 6th International Joint Conference on Computational Intelligence, Rome, Italy, 22-24 October, 2014, pages 37- 52. SciTePress.
  14. Guller, D. (2015). A generalisation of the hyperresolution principle to first order Gödel logic. In Computational Intelligence - International Joint Conference, IJCCI 2012 Barcelona, Spain, October 5-7, 2012 Revised Selected Papers, volume 577 of Studies in Computational Intelligence, pages 159-182. Springer.
  15. Hähnle, R. (1994). Short conjunctive normal forms in finitely valued logics. J. Log. Comput., 4(6):905-927.
  16. Hájek, P. (2001). Metamathematics of Fuzzy Logic. Trends in Logic. Springer.
  17. Mandelíkov á, L. (2012). Analysis and interpretation of scientific text. TnUni Press, Trenchin, Slovakia.
  18. Mandelíkov á, L. (2014). Sociocultural connections of the language. TnUni Press, Trenchin, Slovakia.
  19. Nonnengart, A., Rock, G., and Weidenbach, C. (1998). On generating small clause normal forms. In Kirchner, C. and Kirchner, H., editors, Automated Deduction - CADE-15, 15th International Conference on Automated Deduction, Lindau, Germany, July 5-10, 1998, Proceedings, volume 1421 of Lecture Notes in Computer Science, pages 397-411. Springer.
  20. Novák, V., Perfilieva, I., and Moc?ko?r, J. (1999). Mathematical Principles of Fuzzy Logic. The Springer International Series in Engineering and Computer Science. Springer US.
  21. Pavelka, J. (1979). On fuzzy logic I, II, III. Semantical completeness of some many-valued propositional calculi. Mathematical Logic Quarterly, 25(2529):45-52, 119-134, 447-464.
  22. Plaisted, D. A. and Greenbaum, S. (1986). A structurepreserving clause form translation. J. Symb. Comput., 2(3):293-304.
  23. SavickÉ, P., Cignoli, R., Esteva, F., Godo, L., and Noguera, C. (2006). On Product logic with truth-constants. J. Log. Comput., 16(2):205-225.
  24. 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. (2015). An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta . In Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015) ISBN 978-989-758-157-1, pages 31-46. DOI: 10.5220/0005587600310046


in Bibtex Style

@conference{fcta15,
author={Dušan Guller},
title={An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta},
booktitle={Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015)},
year={2015},
pages={31-46},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005587600310046},
isbn={978-989-758-157-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 7th International Joint Conference on Computational Intelligence - Volume 2: FCTA, (ECTA 2015)
TI - An Order Hyperresolution Calculus for Gödel Logic with Truth Constants and Equality, Strict Order, Delta
SN - 978-989-758-157-1
AU - Guller D.
PY - 2015
SP - 31
EP - 46
DO - 10.5220/0005587600310046