Sciweavers

1236 search results - page 139 / 248
» Programming by Demonstration for Information Agents
Sort
View
AAAI
2007
15 years 1 months ago
Counting CSP Solutions Using Generalized XOR Constraints
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
Carla P. Gomes, Willem Jan van Hoeve, Ashish Sabha...
AAAI
2006
15 years 19 days ago
Efficient Haplotype Inference with Boolean Satisfiability
One of the main topics of research in genomics is determining the relevance of mutations, described in haplotype data, as causes of some genetic diseases. However, due to technolo...
Inês Lynce, João Marques-Silva
AAAI
2006
15 years 19 days ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
AAAI
1993
15 years 17 days ago
Numerical Behavior Envelopes for Qualitative Models
Semiquantitative models combine both qualitative and quantitative knowledge within a single semiquantitative qualitative differential equation (SQDE) representation. With current ...
Herbert Kay, Benjamin Kuipers
ATAL
2010
Springer
15 years 10 days ago
Distributed BDD-based BMC for the verification of multi-agent systems
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
Andrew V. Jones, Alessio Lomuscio