9719 search results - page 28 / 1944 » Answer Set Optimization |
LPNMR
2004
Springer
14 years 3 months ago
2004
Springer
A conflict clause represents a backtracking solver’s analysis of why a conflict occurred. This analysis can be used to further prune the search space and to direct the search h...
ASP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. We integrate an expressive class of description logics (DLs) and answer set programming by extending the latter to support inverted predicates and infinite domains, feat...
ASP
2003
Springer
14 years 3 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
ICLP
2010
Springer
14 years 1 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...
AMAI
2008
Springer
13 years 10 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, ...