1940 search results - page 164 / 388 » Graph Transformation with Variables |
151
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
One of the major advances in classical planning has been the development of Graphplan. Graphplan builds a layered structure called the planning graph, and then searches this struc...
128
Voted
ICTAI
2009
IEEE
15 years 10 months ago
2009
IEEE
In this paper a learning based local search approach for propositional satisfiability is presented. It is based on an original adaptation of the conflict driven clause learning ...
106
Voted
CPAIOR
2004
Springer
15 years 9 months ago
2004
Springer
This paper shows that existing definitions of costs associated with soft global constraints are not sufficient to deal with all the usual global constraints. We propose more expre...
116
click to vote
UAI
2008
15 years 5 months ago
2008
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specif...
123
Voted
AAAI
1997
15 years 5 months ago
1997
Constraint satisfaction research has focussed on consistency checking using k-consistency and its variations such as arc-consistency, and path-consistency. We define a new form of...