4117 search results - page 236 / 824 » On the Satisfiability of Complex Constraints |
239
click to vote
ASE
1998
15 years 6 months ago
1998
The process of understanding a source code in a high-level programming language involves complex computation. Given a piece of legacy code and a library of program plan templates, ...
160
click to vote
SIGGRAPH
2010
ACM
15 years 10 months ago
2010
ACM
We introduce a new method for simulating frictional contact between volumetric objects using interpenetration volume constraints. When applied to complex geometries, our formulati...
236
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
163
click to vote
AAAI
1990
15 years 7 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
175
click to vote
AIPS
2009
15 years 7 months ago
2009
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...