7167 search results - page 597 / 1434 » Answer Set Programming |
132
click to vote
JAR
1998
15 years 5 months ago
1998
It is shown how self-resolving clauses like symmetry or transitivity, or even clauses like condensed detachment, can faithfully be deleted from the clause set thus eliminating or ...
158
click to vote
APPML
2011
15 years 1 months ago
2011
The k-domination number of a graph is the cardinality of a smallest set of vertices such that every vertex not in the set is adjacent to at least k vertices of the set. We prove t...
160
click to vote
CINQ
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
182
click to vote
ENTCS
2008
15 years 6 months ago
2008
We present Oracle-Based Partial Evaluation (OBPE), a novel approach to on-line Partial Evaluation (PE) which decides the control strategy to use for each call pattern by using an ...
162
click to vote
ADC
1999
Springer
15 years 10 months ago
1999
Springer
We introduce pseudo-naive evaluation, a method for execution of mixed top-down/bottom-up logic programs and deductive databases. The method is intermediate in power between naive ...