Sciweavers

194 search results - page 19 / 39
» Tabular Constraint-Satisfaction Problems and Answer Set Prog...
Sort
View
ICLP
2003
Springer
15 years 5 months ago
Computing Minimal Models, Stable Models, and Answer Sets
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
Zbigniew Lonc, Miroslaw Truszczynski
PADL
2004
Springer
15 years 5 months ago
USA-Smart: Improving the Quality of Plans in Answer Set Planning
In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The...
Marcello Balduccini
LPNMR
2005
Springer
15 years 5 months ago
Answer Sets for Propositional Theories
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...
Paolo Ferraris
PPDP
2010
Springer
14 years 10 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...
CP
2009
Springer
16 years 13 days ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný