4066 search results - page 100 / 814 » Almost Complete Sets |
198
click to vote
NMR
2004
Springer
15 years 11 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
160
click to vote
AAAI
2004
15 years 7 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
171
click to vote
AIPS
2010
15 years 6 months ago
2010
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
150
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
209
click to vote
CLIMA
2006
15 years 7 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...