Sciweavers

754 search results - page 15 / 151
» An Ordered Logic Program Solver
Sort
View
CP
2007
Springer
15 years 11 months ago
Propagation = Lazy Clause Generation
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...
Olga Ohrimenko, Peter J. Stuckey, Michael Codish
AAAI
2008
15 years 7 months ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
CPAIOR
2006
Springer
15 years 9 months ago
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs
Abstract. In this paper we introduce a complex allocation and scheduling problem for variable voltage Multi-Processor System-on-Chip (MPSoC) platforms. We propose a methodology to ...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
FUIN
2006
145views more  FUIN 2006»
15 years 5 months ago
Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
Linh Anh Nguyen
CORR
2002
Springer
131views Education» more  CORR 2002»
15 years 5 months ago
Logic Programming with Ordered Disjunction
Abstract. Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunct...
Gerhard Brewka