Sciweavers

3775 search results - page 237 / 755
» The Expression Problem Revisited
Sort
View
AIPS
2011
14 years 8 months ago
Directed Search for Generalized Plans Using Classical Planners
We consider the problem of finding generalized plans for situations where the number of objects may be unknown and unbounded during planning. The input is a domain specification...
Siddharth Srivastava, Neil Immerman, Shlomo Zilber...
155
Voted
JAIR
2010
130views more  JAIR 2010»
15 years 3 months ago
A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning (DR) is pervasive in human problem solving as a powerful adjunct to symbolic reasoning based on language-like representations. The research reported in this...
Bonny Banerjee, B. Chandrasekaran
ICDE
2007
IEEE
97views Database» more  ICDE 2007»
15 years 11 months ago
Service Description and Analysis From a Type Theoretic Approach
In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances a...
Ken Q. Pu
CPAIOR
2007
Springer
15 years 11 months ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant
142
Voted
SSS
2005
Springer
15 years 10 months ago
On the Possibility and the Impossibility of Message-Driven Self-stabilizing Failure Detection
Abstract. This paper considers message-driven self-stabilizing implementations of unreliable failure detectors. We show that it is impossible to give a deterministic implementation...
Martin Hutle, Josef Widder