194 search results - page 23 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
125
click to vote
PODS
1997
ACM
15 years 6 months ago
1997
ACM
We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Prev...
107
click to vote
AMOST
2005
ACM
15 years 8 months ago
2005
ACM
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
167
Voted
CPAIOR
2011
Springer
14 years 6 months ago
2011
Springer
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in indu...
114
Voted
ICLP
2004
Springer
15 years 7 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
117
click to vote
CPAIOR
2009
Springer
15 years 9 months ago
2009
Springer
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...