7868 search results - page 12 / 1574 » Learning by Answer Sets |
98
Voted
LPNMR
2005
Springer
15 years 7 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
127
click to vote
LPNMR
2009
Springer
15 years 6 months ago
2009
Springer
This note summarizes the use of Answer Set Programming to solve various computational problems to infer phylogenetic trees and phylogenetic networks, and discusses its applicabilit...
133
click to vote
AAAI
2006
15 years 3 months ago
2006
Recent research shows that SAT (propositional satisfiability) techniques can be employed to build efficient systems to compute answer sets for logic programs. ASSAT and CMODELS ar...
220
Voted
ICLP
2009
Springer
16 years 2 months ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
135
Voted
CADE
2001
Springer
16 years 2 months ago
2001
Springer