Sciweavers

134 search results - page 3 / 27
» Computationally Grounded Theories of Agency
Sort
View
JAIR
2010
111views more  JAIR 2010»
13 years 4 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
ATAL
2005
Springer
13 years 11 months ago
A computationally grounded logic of knowledge, belief and certainty
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
Kaile Su, Abdul Sattar, Guido Governatori, Qinglia...
COR
2011
13 years 29 days ago
A Lagrangian heuristic for satellite range scheduling with resource constraints
The task of scheduling communications between satellites and ground control stations is getting more and more critical since an increasing number of satellites must be controlled ...
Fabrizio Marinelli, Salvatore Nocella, Fabrizio Ro...
AAAI
2008
13 years 8 months ago
Grounding with Bounds
Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain...
Johan Wittocx, Maarten Mariën, Marc Denecker
CHI
2008
ACM
14 years 6 months ago
Articulating common ground in cooperative work: content and process
We study the development of common ground in an emergency management planning task. Twelve three-person multi-role teams performed the task with a paper prototype in a controlled ...
Gregorio Convertino, Helena M. Mentis, Mary Beth R...