2035 search results - page 15 / 407 » On the complexity of stratified logics |
106
click to vote
IFIP
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
122
Voted
FUIN
2010
14 years 10 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...
100
click to vote
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Default logic is one of the most widely used formalisms to formalize commonsense reasoning. In this paper we analyze the complexity of deciding whether a propositional in...
103
Voted
LOGCOM
2010
14 years 11 months ago
2010
All promiment examples of first-order predicate fuzzy logics are undecidable. This leads to the problem of the arithmetical complexity of their sets of tautologies and satisfiab...
94
Voted
CSL
1999
Springer
15 years 4 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...