Sciweavers

2035 search results - page 28 / 407
» On the complexity of stratified logics
Sort
View
88
Voted
EUSFLAT
2003
126views Fuzzy Logic» more  EUSFLAT 2003»
14 years 11 months ago
On the complexity of propositional logics with an involutive negation
Let C be the propositional calculus given by a standard SBL-algebra; C  is obtained from C by adding an involutive negation, with axioms and deduction rules as in [4]. Then C  i...
Zuzana Haniková
CORR
2008
Springer
94views Education» more  CORR 2008»
14 years 10 months ago
Complexity of Hybrid Logics over Transitive Frames
Martin Mundhenk, Thomas Schneider 0002, Thomas Sch...
JAR
2008
77views more  JAR 2008»
14 years 10 months ago
Data Complexity of Query Answering in Expressive Description Logics via Tableaux
Magdalena Ortiz, Diego Calvanese, Thomas Eiter