Sciweavers

Share
18 search results - page 1 / 4
» Learning Domain-Specific Heuristics for Answer Set Solvers
Sort
View
ICLP
2010
Springer
10 years 8 months ago
Learning Domain-Specific Heuristics for Answer Set Solvers
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...
Marcello Balduccini
LPNMR
2004
Springer
10 years 9 months ago
Answer Set Programming with Clause Learning
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...
Jeffrey Ward, John S. Schlipf
ACL
2010
10 years 2 months ago
Inducing Domain-Specific Semantic Class Taggers from (Almost) Nothing
This research explores the idea of inducing domain-specific semantic class taggers using only a domain-specific text collection and seed words. The learning process begins by indu...
Ruihong Huang, Ellen Riloff
ASP
2005
Springer
10 years 9 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea
CORR
2010
Springer
116views Education» more  CORR 2010»
10 years 4 months ago
Heuristics in Conflict Resolution
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven l...
Christian Drescher, Martin Gebser, Benjamin Kaufma...
books