3573 search results - page 432 / 715 » Reasoning about Codata |
176
click to vote
CEC
2010
IEEE
15 years 7 months ago
2010
IEEE
In this paper we present a simple and general new No Free Lunch-like result that applies to revisiting algorithms searching arbitrary problem sets. We begin by unifying the assumpt...
229
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
155
click to vote
JUCS
2010
15 years 5 months ago
2010
: In this paper we consider a multiagent system with multiple ontologies. The agents maintain the ontologies individually which leads to frequent changes and possible knowledge inc...
180
click to vote
JUCS
2010
15 years 5 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...
166
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...