Sciweavers

247 search results - page 48 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
ICFP
2007
ACM
15 years 10 months ago
Relating complexity and precision in control flow analysis
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
David Van Horn, Harry G. Mairson
IPMI
2005
Springer
15 years 10 months ago
Extrapolation of Sparse Tensor Fields: Application to the Modeling of Brain Variability
Modeling the variability of brain structures is a fundamental problem in the neurosciences. In this paper, we start from a dataset of precisely delineated anatomical structures in ...
Pierre Fillard, Vincent Arsigny, Xavier Pennec, Pa...
COMPUTER
2007
135views more  COMPUTER 2007»
14 years 10 months ago
A Language for Human Action
and therefore should be implemented outside the sensory-motor system. This way, meaning for a concept amounts to the content of a symbolic expression, a definition of the concept ...
Gutemberg Guerra-Filho, Yiannis Aloimonos
JAIR
2006
90views more  JAIR 2006»
14 years 10 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...
KI
2008
Springer
14 years 10 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson