46 search results - page 1 / 10 » The Concurrency Complexity for the Horn Fragment of Linear L... |
LFCS
1997
Springer
13 years 9 months ago
1997
Springer
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
AIML
2004
13 years 6 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
KR
2010
Springer
13 years 9 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
KR
2010
Springer
13 years 9 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...
ECAI
2010
Springer
13 years 2 months ago
2010
Springer
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...