47 search results - page 3 / 10 » Preorder Relations |
KR
2004
Springer
15 years 3 months ago
2004
Springer
Several logical languages have been considered in AI for encoding compactly preference relations over a set of alternatives. In this paper, we analyze both the expressiveness and ...
102
click to vote
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We investigate the complexity of preorder checking when the specification is a flat finite-state system whereas the implementation is either a non-flat finite-state system or a st...
XSYM
2005
Springer
15 years 3 months ago
2005
Springer
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using se...
EPEW
2007
Springer
15 years 1 months ago
2007
Springer
A parallel composition is defined for Markov reward chains with fast transitions and for discontinuous Markov reward chains. In this setting, compositionality with respect to the r...
IJFCS
2006
14 years 10 months ago
2006
This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the con...