4595 search results - page 162 / 919 » Reasoning about Plans |
190
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
170
click to vote
MPC
1998
Springer
15 years 11 months ago
1998
Springer
Timed-trace formalisms have emerged as a powerful method for specifying and reasoning about concurrent real-time systems. We present a simple variant which builds methodically on s...
192
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
We describe the integration of permutation group algorithms with proof planning. We consider eight basic questions arising in computational permutation group theory, for which our ...
151
click to vote
COGSCI
2008
15 years 7 months ago
2008
Historians of science have pointed to essentialist beliefs about species as major impediments to the discovery of natural selection. The present study investigated whether such be...
219
click to vote
KR
2004
Springer
16 years 13 days ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...