论文信息 - Maslov's Class K Revisited

Maslov's Class K Revisited

This paper gives a new treatment of Maslov's class K in the framework of resolution. More specifically, we show that K and the class DK consisting of disjunction of formulae in K can be decided by a resolution refinement based on liftable orderings. We also discuss relationships to other solvable and unsolvable classes.

Ullrich Hustadt | Renate A. Schmidt

[1] Warren D. Goldfarb. The Unsolvability of the Godel Class with Identity , 1984, J. Symb. Log..

[2] J.M.G.G. de Nivelle. Ordering Refinements of Resolution , 1995 .

[3] Harald Ganzinger,et al. A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[4] Harald Ganzinger,et al. Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[5] Günter Asser,et al. Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[6] H. Ganzinger,et al. A theory of resolution , 1997 .

[7] Christian G. Fermüller,et al. Ordered Paramodulation and Resolution as Decision Procedure , 1993, LPAR.

[8] Ullrich Hustadt,et al. Issues of Decidability for Description Logics in the Framework of Resolution , 1998, FTP.

[9] Margus Veanes,et al. The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[10] George Gargov,et al. A Note on Boolean Modal Logic , 1990 .

[11] Harald Ganzinger,et al. A Resolution-Based Decision Procedure for Extensions of K4 , 1998, Advances in Modal Logic.

[12] Michael Mortimer,et al. On languages with two variables , 1975, Math. Log. Q..