2084 search results - page 336 / 417 » Set Constraints in Logic Programming |
CP
2007
Springer
14 years 2 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
ACSD
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
FOIKS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
CATA
2003
13 years 9 months ago
2003
Many current general purpose processors use extensions to the instruction set architecture to enhance the performance of digital image processing and multimedia applications. In t...
ICML
2009
IEEE
14 years 9 months ago
2009
IEEE
We describe an algorithm for constructing a set of acyclic conjunctive relational features by combining smaller conjunctive blocks. Unlike traditional level-wise approaches which ...