245 search results - page 17 / 49 » Efficient Solving of Time-dependent Answer Set Programs |
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Concepts in Answer Set Programming (ASP) are normally defined in terms of atoms. We show that the treatment of atoms and bodies (of rules) as equitable computational obje...
203
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
CGO
2003
IEEE
15 years 5 months ago
2003
IEEE
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
JUCS
2007
14 years 11 months ago
2007
: Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a u...
128
Voted
CASES
2008
ACM
15 years 1 months ago
2008
ACM
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...