33 search results - page 6 / 7 » Anytime Approximations of Classical Logic from Above |
KR
2000
Springer
13 years 9 months ago
2000
Springer
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
GECCO
1999
Springer
13 years 9 months ago
1999
Springer
Genetic programming makes it possible to automatically search the space of possible programs. First we evolved a behavior-based control architecture using computer simulations. Th...
EUSFLAT
2009
13 years 3 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
PLDI
2012
ACM
11 years 7 months ago
2012
ACM
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
PODS
2011
ACM
12 years 8 months ago
2011
ACM
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...