648 search results - page 23 / 130 » Using Criticalities as a Heuristic for Answer Set Programmin... |
116
click to vote
LPNMR
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
SIGCSE
2009
ACM
16 years 2 months ago
2009
ACM
It is difficult for instructors of CS1 and CS2 courses to get accurate answers to such critical questions as "how long are students spending on programming assignments?"...
119
click to vote
HEURISTICS
2008
15 years 1 days ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
104
click to vote
HPCA
2007
IEEE
16 years 1 months ago
2007
IEEE
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...