138 search results - page 2 / 28 » Domain Transmutation in Constraint Satisfaction Problems |
IJCAI
1989
13 years 6 months ago
1989
We describe a general technique for expressing domain knowledge in constraint satisfaction problems, and using it to develop optimized parallel arc consistency algorithms for the ...
KBSE
1997
IEEE
13 years 8 months ago
1997
IEEE
This paper discusses our approach to the problem of refining high-level simulation specifications. Our domain is simulated combat training for tank platoon members. Our input is a...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mecha...
CSL
2006
Springer
13 years 8 months ago
2006
Springer
In this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong c...
APIN
2006
13 years 4 months ago
2006
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing ...