2035 search results - page 136 / 407 » On the complexity of stratified logics |
139
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...
155
click to vote
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 ...
155
click to vote
IJCAI
2007
15 years 7 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...
188
click to vote
KRDB
2003
15 years 7 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
250
click to vote
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...