MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

A Survey of Decidable First-Order Fragments and Description Logics (2004) [7 citations — 2 self]

by U. Hustadt ,  R. A. Schmidt ,  L. Georgieva
Journal of Relational Methods in Computer Science
Add To MetaCart

Abstract:

The guarded fragment and its extensions and subfragments are often considered as a framework for investigating the properties of description logics. There are also other, some less well-known, decidable fragments of first-order logic which all have in common that they generalise the standard translation of to first-order logic. We provide a short survey of some of these fragments and motivate why they are interesting with respect to description logics, mentioning also connections to other non-classical logics.

Citations

641 Dynamic Logic – Harel - 1984
567 A Framework for Representing Knowledge – Minsky - 1975
212 A correspondence theory for terminological logics – Schild - 1991
183 On the calculus of relations – TARSKI - 1941
167 Concept logics – Baader, Burckert, et al. - 1990
166 Modal languages and bounded fragments of predicate logic – Andréka, Benthem, et al. - 1998
164 Semantical considerations on Floyd-Hoare logic – Pratt - 1976
120 A structure-preserving clause form translation – Plaisted, Greenbaum - 1986
105 Attributive concept descriptions with complements – Schmidt-Schauß, Smolka - 1991
93 Reducing SHIQ- Description Logic to Disjunctive Datalog Programs. FZI-Report 1-8-11/03, Forschungszentrum Informatik (FZI – Hustadt, Motik, et al. - 2003
84 On the restraining power of guards – Grädel - 1999
63 Basic paramodulation – Bachmair, Ganzinger, et al. - 1995
62 Reasoning in expressive description logics – Calvanese, Giacomo, et al.
61 Word concepts: A theory of simulation of some basic semantic capabilities – Quillian - 1967
50 Nivelle. A superposition decision procedure for the guarded fragment with equality – Ganzinger, De - 1999
49 Two-variable logic with counting is decidable – Gradel, Otto, et al. - 1997
46 Temporalizing description logic – Wolter, Zakharyaschev - 1999
37 On the decision problem for twovariable first-order logic – Grädel, Kolaitis, et al. - 1997
36 Issues of decidability for description logics in the framework of resolution – Hustadt, Schmidt - 2000
35 R.: Resolution-Based Methods for Modal Logics – Hustadt, Nivelle, et al.
34 Resolution decision procedures – Fermüller, Leitsch, et al. - 2001
33 A note on Boolean modal logic – Gargov, Passy - 1990
31 The two-variable Guarded Fragment with transitive relations – Ganzinger, Meyer, et al. - 1999
29 Products of modal logics – Gabbay, Shehtman - 1998
28 Variables explained away – Quine - 1960
27 The complexity of reasoning with Boolean modal logic – Lutz, Sattler - 2000
26 Dynamic bits and pieces – Benthem - 1997
22 On languages with two variables – Mortimer - 1975
21 Peirce algebras – Brink, Britz, et al. - 1994
21 Decidable, Logic-Based Knowledge Representation – Patel-Schneider - 1987
21 A decision method for validity of sentences in two variables – Scott - 1962
20 Encoding two-valued nonclassical logics in classical logic – Ohlbach, Nonnengart, et al. - 2001
20 Functional translation and second-order frame properties of modal logics – Ohlbach, Schmidt - 1995
19 An empirical analysis of modal theorem provers – Hustadt, Schmidt - 1999
18 Tolerance logic – Marx
18 Subsumption in KL-ONE is undecidable – Schmidt-Schauß - 1989
16 A deduction method complete for refutation and finite satisfiability – Bry, Torge - 1998
14 Hyperresolution for guarded formulae – Georgieva, Hustadt, et al. - 2000
14 Maslov's class K revisited – Hustadt, Schmidt - 1999
14 The inverse method of establishing deducibility of logical calculi – Maslov
11 A resolution decision procedure for fluted logic – Schmidt, Hustadt - 2000
10 Subsumption computed algebraically – Brink, Schmidt - 1992
10 Guarded fragments of first-order logic: A perspective for new description logics – Grädel - 1998
9 Nivelle and M. de Rijke. Deciding the guarded fragments by resolution – de
9 A suggestion of an n-ary description logic – Lutz, Sattler, et al. - 1999
9 Undecidability of subsumption in U – Schild - 1988
9 Optimised Modal Translation and Resolution – Schmidt - 1997
8 A tableau decision algorithm for modalized ALC with constant domains – Lutz, Sturm, et al. - 2002
8 Algebraic logic and predicate functors – Quine - 1971
8 Uberprufung der Erfullbarkeit im Endlichen: Ein Verfahren und seine Anwendung – Torge - 1998
View or Download | Add to My Collection | Correct Errors