4117 search results - page 95 / 824 » On the Satisfiability of Complex Constraints |
171
click to vote
DATE
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper presents a new approach on combined highlevel synthesis and partitioning for FPGA-based multi-chip emulation systems. The goal is to synthesize a prototype with maximal...
157
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, whil...
180
click to vote
AIPS
2006
15 years 7 months ago
2006
Recent research in AI Planning is focused on improving the quality of the generated plans. PDDL3 incorporates hard and soft constraints on goals and the plan trajectory. Plan traj...
138
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
159
click to vote
DCC
2006
IEEE
16 years 13 days ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...