3172 search results - page 84 / 635 » On the Random-Self-Reducibility of Complete Sets |
120
Voted
CINQ
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
99
Voted
SLOGICA
2008
15 years 21 days ago
2008
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...
98
Voted
AAAI
2004
15 years 2 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...
115
Voted
AIPS
2010
15 years 1 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
15 years 27 days 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...