120 search results - page 13 / 24 » First Order Logic with Domain Conditions |
AIPS
2006
13 years 10 months ago
2006
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
ITP
2010
14 years 14 days ago
2010
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
IWSSD
2000
IEEE
14 years 29 days ago
2000
IEEE
A good architecture is a necessary condition to guarantee that the expected levels of performance, availability, fault tolerance, and scalability are achieved by the implemented s...
ICDT
2009
ACM
14 years 9 months ago
2009
ACM
Marx and de Rijke have shown that the navigational core of the w3c XML query language XPath is not first-order complete ? that is it cannot express every query definable in firsto...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...