194 search results - page 7 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
AAAI
2007
14 years 12 months ago
2007
Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
97
Voted
FOIKS
2008
Springer
14 years 11 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
CP
2007
Springer
15 years 3 months ago
2007
Springer
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploit...
100
click to vote
AMAI
2008
Springer
14 years 9 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...