1664 search results - page 178 / 333 » Towards Partial Reasoning |
122
click to vote
RR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
116
click to vote
AIPS
2007
15 years 7 months ago
2007
Relaxations based on (either complete or partial) ignoring delete effects of the actions provide the basis for some seminal classical planning heuristics. However, the palette of ...
150
click to vote
ENTCS
2007
15 years 4 months ago
2007
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms,...
123
click to vote
ENTCS
2002
15 years 4 months ago
2002
We investigate the reasons for which the existence of certain right adjoints implies the existence of some final coalgebras, and vice-versa. In particular we prove and discuss the...
123
click to vote
BROADNETS
2007
IEEE
15 years 11 months ago
2007
IEEE
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...