Sciweavers

186 search results - page 24 / 38
» Decidable Extensions of Church's Problem
Sort
View
CSE
2009
IEEE
14 years 4 months ago
Improving Interobserver Reliability by Artificial Intelligence Techniques in Behavioural Research
Interobserver reliability and reproducibility are well known problems in experimental research within the social and behavioural sciences. We propose the use of formal techniques ...
Arjen van Alphen, Tibor Bosse, Catholijn M. Jonker...
ATAL
2009
Springer
14 years 4 months ago
Learning of coordination: exploiting sparse interactions in multiagent systems
Creating coordinated multiagent policies in environments with uncertainty is a challenging problem, which can be greatly simplified if the coordination needs are known to be limi...
Francisco S. Melo, Manuela M. Veloso
DEXA
2009
Springer
167views Database» more  DEXA 2009»
14 years 4 months ago
Analyses and Validation of Conditional Dependencies with Built-in Predicates
Abstract. This paper proposes a natural extension of conditional functional dependencies (cfds [14]) and conditional inclusion dependencies (cinds [8]), denoted by cfdp s and cindp...
Wenguang Chen, Wenfei Fan, Shuai Ma
CAV
2005
Springer
104views Hardware» more  CAV 2005»
14 years 3 months ago
Expand, Enlarge and Check... Made Efficient
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
Gilles Geeraerts, Jean-François Raskin, Lau...
ICDT
2005
ACM
130views Database» more  ICDT 2005»
14 years 3 months ago
Rewriting Queries Using Views with Access Patterns Under Integrity Constraints
We study the problem of rewriting queries using views in the presence of access patterns, integrity constraints, disjunction, and negation. We provide asymptotically optimal algori...
Alin Deutsch, Bertram Ludäscher, Alan Nash