A resolution decision procedure for fluted logic

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1831, Issue , 2000, Pages 433-448

  Schmidt, Renate A ^a   Hustadt, Ullrich ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTABILITY AND DECIDABILITY; THEOREM PROVING;

DECISION PROCEDURE; FIRST ORDER; FIRST ORDER LOGIC; FUNCTION SYMBOLS; NEW FORMS;

FORMAL LOGIC;

EID: 84937415261     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10721959_34     Document Type: Conference Paper

References (28)

1. L. Bachmair and H. Ganzinger. Rewrite-based equational theorem proving with selection and simplification. J. Logic Computat., 4 (3) : 217-247, 1994.
2. L. Bachmair and H. Ganzinger. Resolution theorem proving. In J. A. Robinson and A. Voronkov, eds., Handbook of Automated Reasoning. Elsevier, 2000. To appear.
3. L. Bachmair, H. Ganzinger, and U. Waldmann. Superposition with simplification as a decision procedure for the monadic class with equality. In Proc. Third Kurt Gödel Colloquium (KGC'93), vol. 713 of LNCS, pp. 83-96. Springer, 1993.
4. H. de Nivelle. A resolution decision procedure for the guarded fragment. In Automated DeductioniCADE-15, vol. 1421 of LNAI, pp. 191-204. Springer, 1998.
5. C. Fermüller, A. Leitsch, T. Tammet, and N. Zamov. Resolution Method for the Decision Problem, vol. 679 of LNCS. Springer, 1993.
6. C. G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet. Resolution theorem proving. In J. A. Robinson and A. Voronkov, eds., Handbook of Automated Reasoning. Elsevier, 2000. To appear.
7. H. Ganzinger and H. de Nivelle. A superposition decision procedure for the guarded fragment with equality. In Fourteenth Annual IEEE Symposium on Logic in Computer Science, pp. 295-303. IEEE Computer Society Press, 1999.
8. G. Gargov and S. Passy. A note on Boolean modal logic. In P. P. Petkov, ed., Mathematical Logic: Proceedings of the 1988 Heyting Summerschool, pp. 299-309. Plenum Press, 1990.
9. V. Goranko and S. Passy. Using the universal modality: Gains and questions. J. Logic Computat., 2 (1) : 5-30, 1992.
10. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54: 319-379, 1992.
11. A. Herzig. A new decidable fragment of first order logic, 1990. In Abstracts of the Third Logical Biennial, Summer School & Conference in Honour of S. C. Kleene, Varna, Bulgaria.
12. I. L. Humberstone. Inaccessible worlds. Notre Dame J. Formal Logic, 24 (3) : 346-352, 1983.
13. I. L. Humberstone. The modal logic of 'all and only'. Notre Dame J. Formal Logic, 28 (2) : 177-188, 1987.
14. U. Hustadt and R. A. Schmidt. An empirical analysis of modal theorem provers. J. Appl. Non-Classical Logics, 9 (4), 1999.
15. U. Hustadt and R. A. Schmidt. Maslov's class K revisited. In Automated DeductioniCADE-16, vol. 1632 of LNAI, pp. 172-186. Springer, 1999.
16. U. Hustadt and R. A. Schmidt. Issues of decidability for description logics in the framework of resolution. In Automated Deduction in Classical and Non-Classical Logics, vol. 1761 of LNAI, pp. 192-206. Springer, 2000.
17. U. Hustadt and R. A. Schmidt. A resolution decision procedure for fluted logic. Technical Report UMCS-00-3-1, University of Manchester, UK, 2000.
18. W. H. Joyner Jr. Resolution strategies as decision procedures. J. ACM, 23 (3) : 398-417, 1976.
19. H. J. Ohlbach and R. A. Schmidt. Functional translation and second-order frame properties of modal logics. J. Logic Computat., 7 (5) : 581-603, 1997.
20. D. A. Plaisted and S. Greenbaum. A structure-preserving clause form translation. J. Symbolic Computat., 2: 293-304, 1986.
21. W. C. Purdy. Decidability of fluted logic with identity. Notre Dame J. Formal Logic, 37 (1) : 84-104, 1996.
22. W. C. Purdy. Fluted formulas and the limits of decidability. J. Symbolic Logic, 61 (2) : 608-620, 1996.
23. W. C. Purdy. Surrogate variables in natural language. To appear in M. Böttner, ed., Proc. of the Workshop on Variable-Free Semantics, 1996.
24. W. C. Purdy. Quine's 'limits of decision'. J. Symbolic Logic, 64: 1439-1466, 1999.
25. W. V. Quine. Variables explained away. In Proc. American Philosophy Society, vol. 104, pp. 343-347, 1960.
26. R. A. Schmidt. Decidability by resolution for propositional modal logics. J. Automated Reasoning, 22 (4) : 379-396, 1999.
27. G. S. Tseitin. On the complexity of derivations in propositional calculus. In A. O. Slisenko, ed., Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 115-125. Consultants Bureau, New York, 1970.
28. C. Weidenbach. Spass, 1999. http://spass.mpi-sb.mpg.de.