194 search results - page 5 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
81
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
173
click to vote
CSCLP
2008
Springer
15 years 4 months ago
2008
Springer
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
112
click to vote
CP
2008
Springer
15 years 4 months ago
2008
Springer
The Constraint Satisfaction Problem (CSP) framework allows users to define problems in a declarative way, quite independently from the solving process. However, when the problem i...
133
click to vote
ICTAI
2002
IEEE
15 years 7 months ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C. Nov. 2002, p...
108
click to vote
AAAI
2010
15 years 2 months ago
2010
An answer set program with variables is first-order definable on finite structures if the set of its finite answer sets can be captured by a first-order sentence, otherwise this p...