2214 search results - page 38 / 443 » Complexity of Reasoning |
103
click to vote
AIPS
1994
15 years 1 months ago
1994
We consider the problem of representing plans for mixed-initiative planning, where several participants cooperate to develop plans. We claim that in such an environment, a crucial...
101
click to vote
ICFEM
2010
Springer
14 years 9 months ago
2010
Springer
Designing concurrent or distributed systems with complex architectures while preserving a set of high-level requirements through all design steps is not a trivial task. Building up...
123
click to vote
CONCUR
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formul...
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...