2649 search results - page 144 / 530 » Temporal Theories of Reasoning |
176
click to vote
RAS
1998
15 years 6 months ago
1998
In this paper a theory of delegation is presented. There are at least three reasons for developing such a theory. First, one of the most relevant notions of "agent" is b...
217
click to vote
LOGCOM
1998
15 years 6 months ago
1998
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
216
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
201
click to vote
ICFP
2005
ACM
16 years 6 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
213
click to vote
PLPV
2009
ACM
16 years 3 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...