4218 search results - page 138 / 844 » Complete sets of cooperations |
AAAI
2004
13 years 11 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...
AIPS
2010
13 years 10 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...
CORR
2008
Springer
13 years 10 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...
EUSFLAT
2003
13 years 11 months ago
2003
It seems that a suitably constructed fuzzy sets of natural numbers form the most complete and adequate description of cardinality of finite fuzzy sets.(see [11]) Nevertheless, in...
AI
2004
Springer
13 years 10 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...