Sciweavers

291 search results - page 15 / 59
» On the Complexity of Fragments of Modal Logics
Sort
View
ECAI
2010
Springer
13 years 5 months ago
Complexity of Axiom Pinpointing in the DL-Lite Family of Description Logics
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
Rafael Peñaloza, Baris Sertkaya
KRDB
2001
110views Database» more  KRDB 2001»
13 years 9 months ago
Path Constraints from a Modal Logic Point of View
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
Natasha Alechina, Stéphane Demri, Maarten d...
AML
2005
91views more  AML 2005»
13 years 7 months ago
A proof-theoretical investigation of global intuitionistic (fuzzy) logic
We perform a proof-theoretical investigation of two modal predicate logics: global intuitionistic logic GI and global intuitionistic fuzzy logic GIF. These logics were introduced b...
Agata Ciabattoni
KBS
2011
81views more  KBS 2011»
13 years 2 months ago
Existential rigidity and many modalities in order-sorted logic
Order-sorted logic is a useful tool for knowledge representation and reasoning because it enables representation of sorted terms and formulas along with partially ordered sorts (c...
Ken Kaneiwa
TARK
2009
Springer
14 years 2 months ago
Logical omniscience as a computational complexity problem
The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views log...
Sergei N. Artëmov, Roman Kuznets