2490 search results - page 244 / 498 » Complexity of Contextual Reasoning |
163
click to vote
ICLP
2001
Springer
15 years 10 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
180
click to vote
LPAR
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...
151
click to vote
CSL
2000
Springer
15 years 10 months ago
2000
Springer
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
189
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
145
click to vote
GIS
1999
ACM
15 years 10 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...