2981 search results - page 282 / 597 » Answer Set Planning |
118
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
138
click to vote
ICLP
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...
140
click to vote
IPPS
2002
IEEE
15 years 9 months ago
2002
IEEE
Very large scale networks such as the Internet require a new operational model to use resources efficiently and reduce the need for the administration necessary in clientserver n...
133
click to vote
ISW
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. We introduce the notion of persistent authenticated dictionaries, that is, dictionaries where the user can make queries of the type “was element e in set S at time t?...
149
Voted
PRICAI
1998
Springer
15 years 8 months ago
1998
Springer
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...