194 search results - page 20 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
105
click to vote
ASP
2005
Springer
15 years 5 months ago
2005
Springer
Despite all efforts on intelligent grounding, state-of-the-art answer set solvers still have huge memory requirements, because they compute the ground instantiation of the input pr...
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
The Employee Timetabling Problem (ETP) is a general class of problems widely encountered in service organizations (such as call centers for instance). Given a set of activities, a ...
105
click to vote
LPAR
2004
Springer
15 years 5 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
CSCLP
2007
Springer
15 years 6 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
In spite of the recent improvements in the performance of Answer Set Programming (ASP) solvers, when the search space is sufficiently large, it is still possible for the search al...