2022 search results - page 141 / 405 » Complexity of Non-Monotonic Logics |
168
click to vote
DATESO
2008
15 years 8 months ago
2008
Presently, there is no specialized language for complex integrity constraints description in XML documents. In this paper we present a language that combines first-order logic toge...
140
click to vote
TWEB
2008
15 years 6 months ago
2008
tions at runtime. We introduce the abstract service and adapter components which allow us to separate the compensation logic from the coordination logic. In this way, we can easily...
160
Voted
IANDC
1998
15 years 6 months ago
1998
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
214
click to vote
DLOG
2009
15 years 4 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
156
click to vote
IJCAI
2007
15 years 8 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...