4117 search results - page 270 / 824 » On the Satisfiability of Complex Constraints |
190
click to vote
CSCLP
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
136
click to vote
AISC
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
166
click to vote
ESOA
2006
15 years 10 months ago
2006
Holonic Multi-Agent Systems (HMAS) are a convenient way to engineer complex and open systems. In such systems, agents have to be able to self-organize to satisfy their goals. Our w...
156
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
201
click to vote
ESSLLI
2009
Springer
15 years 4 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...