2084 search results - page 182 / 417 » Set Constraints in Logic Programming |
LOPSTR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Recently, there has been a lot of interest in the integration of Description Logics and rules on the Semantic Web. We define guarded hybrid knowledge bases (or g-hybrid knowledge...
LICS
2002
IEEE
14 years 1 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
ICCAD
2002
IEEE
14 years 5 months ago
2002
IEEE
Application-specific instructions can significantly improve the performance, energy, and code size of configurable processors. A common approach used in the design of such instruc...
MP
2010
13 years 6 months ago
2010
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...