7868 search results - page 1 / 1574 » Learning by Answer Sets |
ASP
2001
Springer
13 years 8 months ago
2001
Springer
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
ICLP
2010
Springer
13 years 8 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...
LPNMR
2004
Springer
13 years 10 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...
LPNMR
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...
ICTAI
2007
IEEE
13 years 10 months ago
2007
IEEE
Lookahead is a well-known constraint propagation technique for DPLL-based SAT and answer set solvers. Despite its space pruning power, it can also slow down the search, due to its...