Automated theorem proving by resolution in non-classical logics

Annals of Mathematics and Artificial Intelligence

Volumn 49, Issue 1-4, 2007, Pages 221-252

  Sofronie Stokkermans, Viorica ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Automated theorem proving; Non classical logics; Representation theorems

Indexed keywords

EID: 34547680312     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-007-9051-8     Document Type: Article

References (57)

1. Anderson, A.R., Belnap, N.D.: Entailment: The Logic of Relevance and Necessity, vol. 1. Princeton University Press, Princeton, NJ (1975)
2. Andréka, H., van Benthem, J., Németi, I.: Modal languages and bounded fragments of predicate logic. J. Philos. Logic 27, 217-274 (1998)
3. Aguzzoli, S., Ciabattoni, A.: Finiteness of infinite-valued Łukasiewicz logic. J. Logic, Lang. Inf. 9, 5-29 (2000)
4. Andréka, H., Németi, I., Sain, I.: Algebraic logic. In: Handbook of Philosophical Logic, 2nd edn., vol. 2. Kluwer, Dordrecht (2001)
5. Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds) Proceedings of the 18th International Joint Conference on Artificial Intelligence, (IJCAR 2003), pp. 325-330. Morgan Kaufmann, San Mateo, CA (2003)
6. Baader, F.: The instance problem and the most specific concept in the description logic w.r.t. terminological cycles with descriptive semantics. In: Günter, A., Kruse, R., Neumann, B. (eds) Proceedings of the 26th Annual German Conference on Artificial Intelligence, (KI 2003). LNAI, vol. 2821, pp. 64-78. Springer, Berlin Heidelberg New York (2003)
7. Baaz, M., Fermüller, C.G.: Resolution-based theorem proving for many-valued logics. J. Symb. Comput. 19, 353-391 (1995)
8. Baaz, M., Fermüller, C.G., Ciabattoni, A.: Herbrand's theorem for prenex Gödel logic and its consequences for theorem proving. In: Nieuwenhuis, R., Voronkov, A. (eds) Proceedings of LPAR'2001. Lecture Notes in Computer Science, vol. 2250, pp. 201-215. Springer, Berlin Heidelberg New York (2001)
9. Baaz, M., Fermüller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Robinson, A., Voronkov, A. (eds) Handbook of Automated Reasoning, vol. II, pp. 1355-1402. Elsevier, Amsterdam, The Netherlands (2001)
10. Bachmair, L., Ganzinger, H.: Rewrite-based equational theorem proving with selection and simplification. J. Log. Comput. 4(3), 217-247 (1994)
11. Bachmair, L., Ganzinger, H.: Ordered chaining calculi for first-order theories of transitive relations. Journal of the ACM 45(6), 1007-1049 (1998)
12. Beckert, B., Hähnle, R., Manyà, F.: Transformations between signed and classical clause logic. In: Proceedings of the 29th International Symposium on Multiple-valued Logic (ISMVL'99), Freiburg, Germany, pp. 248-255. IEEE Press, Piscataway, NJ (1999)
13. Beckert, B., Hähnle, R., Manyà, F.: The 2-SAT problem of regular signed CNF formulas. In: Proceedings of the 30th International Symposium on Multiple-valued Logic (ISMVL'2000), Portland, USA, pp. 331-336. IEEE Press, Piscataway, NJ (2000)
14. Béjar, R., Hähnle, R., Manyà, F.: A modular reduction of regular logic to classical logic. In: Proceedings if the 31st International Symposium on Multiple-valued Logic (ISMVL'01), Warsaw, Poland, pp. 221-226. IEEE Press, Piscataway, NJ (2001)
15. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge, UK (2001)
16. Burris, S., Sankappanavar, H.P.: A course in universal algebra. In: Graduate Texts in Mathematics. Springer, Berlin Heidelberg New York (1981)
17. Burris, S.: Polynomial time uniform word problems. Math. Log. Q. 41, 173-182 (1995)
18. Caferra, R., Zabel, N.: An application of many-valued logic to decide propositional S5 formulae: A strategy designed for a parametric tableaux-based theorem prover. In: Artificial Intelligence IV: Methodology, Systems, Applications, pp. 23-32. Elsevier, Amsterdam, The Netherlands (1990)
19. Dezani-Ciangaglini, M., Frisch, A., Giovannetti, E., Motohama, Y.: The relevance of semantic subtyping. Electronic Notes in Theoretical Computer Science 70(1) (2002)
20. Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge, UK (1990)
21. Dummet, M.: A propositional calculus with denumerable matrix. J. Symb. Log. 24(2), 97-106 (1959)
22. Dunn, J.M.: Positive modal logic. Stud. Log. 55, 301-317 (1995)
23. Ganzinger, H., Hustadt, U., Meyer, C., Schmidt, R.A.: A resolution-based decision procedure for extensions of K4. In: Zakharyaschev, M., Segerberg, K., de Rijke, M., Wansing, H. (eds.) Advances in Modal Logic, vol. 119. CSLI Lecture Notes, chapter 9, vol. 2, pp. 225-246. CSLI, Stanford, USA (2001)
24. Ganzinger, H., de Nivelle, H.: A superposition decision procedure for the guarded fragment with equality. In: Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science (LICS'99), pp. 295-303. IEEE Computer Society Press, Los Alamitos, CA (1999)
25. Goldblatt, R.: Mathematics of modality, vol. 43 of Center for the Study of Language and Information. University of Chicago Press, Chicago, IL (1993)
26. Ganzinger, H., Sofronie-Stokkermans, V.: Chaining techniques for automated theorem proving in many-valued logics. In: Proceedings of the 30th International Symposium on Multiple-valued Logic (ISMVL'2000), Portland, USA, pp. 337-344. IEEE Press, Piscataway, NJ (2000)
27. Hähnle, R.: Automated Theorem Proving in Multiple-valued Logics. Oxford University Press, London, UK (1993)
28. Hähnle, R.: Many-valued logic and mixed integer programming. Ann. Math. Artif. Intell. 12(3,4), 231-264 (1994)
29. Hähnle, R.: Short conjunctive normal forms in finitely valued logics. J. Log. Comput. 4(6), 905-927 (1994)
30. Hähnle, R.: Exploiting data dependencies in many-valued logics. J. Appl. Non-Class. Log. 6(1), 49-69 (1996)
31. Hähnle, R.: Proof theory of many-valued logic - linear optimization - logic design. Soft Computing - A Fusion of Foundations, Methodologies and Applications 1(3), 107-119 (1997)
32. Hähnle, R.: Proof theory of many-valued logic - linear optimization - logic design: connections and interactions. Soft Computing - A Fusion of Foundations, Methodologies and Applications 1(3), 107-119 (1997)
33. Hähnle, R.: Advanced many-valued logics. In: Handbook of Philosophical Logic, vol. 2, pp. 297-395. Kluwer, Dordrecht, 2nd edn. (2001)
34. Hähnle, R.: Complexity of many-valued logics. In: Fitting, M., Orłowska, E. (eds) Beyond Two: Theory and Applications of Multiple Valued Logic. Studies in Fuzziness and Soft Computing, vol. 114, chapter 3, pp. 211-233. Springer, Berlin (2003)
35. Hájek, P.: Metamathematics of fuzzy logic. In: Trends in Logic, vol. 4. Kluwer, Dordrecht (1998)
36. Iturrioz, L., Orłowska, E.: A Kripke-style and relational semantics for logics based on Łukasiewicz algebras. Conference in honour of J. Łukasiewicz, Dublin (1996)
37. Ishtiaq, S.,O'Hearn, P.: BI as an assertion language for mutable data structures. In: Proceedings of 28th Symposium on Principles of Programming Languages (POPL'01), pp. 14-26. ACM, New York (2001)
38. Iturrioz, L.: Symmetrical Heyting algebras with operators. Z. Math. Log. Grundl. Math. 29, 33-70 (1983)
39. Kifer, M., Lozinskii, M.: A logic for reasoning with inconsistency. J. Autom. Reason. 9, 179-215 (1992)
40. Kazakov, Y., de Nivelle, H.: Subsumption of concepts in for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In: Calvanese, D., De Giacomo, G., Franconi, E. (eds) 2003 International Workshop on Description Logics (DL-03), vol. 81 of CEUR Workshop Proceedings, pp. 56-64, University of Rome "La Sapienza" and Free University of Bolzano/Bozen, CEUR, Rome, Italy (September 2003)
41. Lu, J., Murray, N.V., Rosenthal, E.: A framework for reasoning in multiple-valued logics. J. Autom. Reason. 21(1), 39-67 (1998)
42. Łukasiewicz, J.: Philosophische Bemerkungen zu mehrwertigen Systemen des Aussagenkalküls. Comptes rendus de la Société des Sciences et Lettres de Varsovie, cl.iii 23, 51-77 (1930)
43. Manyà, F.: The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic. An International Journal 5 (2000)
44. McAllester, D., Givan, R., Kozen, D., Witty, C.: Tarskian set constraints. Inf. Comput. 174, 105-131 (2002)
45. Mundici, D., Olivetti, N.: Resolution and model building in the infinite-valued calculus of Łukasiewicz. Theor. Comp. Sci. 200, 335-366 (1998)
46. Mundici, D.: Satisfiability of many-valued sentential logics is NP-complete. Theor. Comp. Sci. 52, 145-153 (1987)
47. Ohlbach, H.J.: Translation methods for non-classical logics: An overview. Bulletin of the IGPL 1(1), 69-89 (1993)
48. Ono, H., Komori, Y.: Logics without the contraction rule. J. Symb. Log. 50, 169-201 (1985)
49. Ono, H.: Semantics for substructural logics. In: Schroeder-Heister, P., Došen, K. (eds) Substructural Logics, pp. 259-291. Oxford University Press, London, UK (1993)
50. Pym, D.J.: The semantics and proof theory of the logic of bunched implications. In: Applied Logics Series, vol. 26. Kluwer, Boston, MA (2002)
51. Rasiowa, H.: An algebraic approach to non-classical logics. In: Studies in Logic and the Foundations of Mathematics, vol. 78. North Holland, Amsterdam, The Netherlands (1974)
52. Schmidt, R.A.: Decidability by resolution for propositional modal logics. J. Autom. Reason. 22(4), 379-396 (1999)
53. Sofronie-Stokkermans, V.: Automated theorem proving by resolution for finitely-valued logics based on distributive lattices with operators. Multiple-valued Logic - An International Journal 6(3/4), 289-344 (2001)
54. Sofronie-Stokkermans, V.: On uniform word problems involving bridging operators on distributive lattices. In: Egly, U., Fermüller, Ch. (eds) Proceedings of TABLEAUX 2002. LNAI, Copenhagen, Denmark, vol. 2381, pp. 235-250. Springer, Berlin Heidelberg New York (2002)
55. Sofronie-Stokkermans, V.: Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. J. Symb. Comput. 36(6), 891-924 (2003)
56. Urquhart, A.: Many-valued logic. In: Gabbay, D., Guenthner, F. (eds) Handbook of Philosophical Logic, vol. III, pp. 71-116. Reidel, Amsterdam, The Netherlands (1986)
57. Urquhart, A.: Duality for algebras of relevant logics. Stud. Log. 56(1,2), 263-276 (1996)