291 search results - page 52 / 59 » On the Complexity of Fragments of Modal Logics |
AAAI
2008
13 years 10 months ago
2008
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
JLP
2007
13 years 7 months ago
2007
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
DLOG
2008
13 years 10 months ago
2008
We identify the complexity of (finite model) reasoning in the DL SROIQ to be N2ExpTime-complete. We also prove that (finite model) reasoning in the DL SR--a fragment of SROIQ witho...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...