184 search results - page 6 / 37 » Querying Proofs |
DBPL
1995
Springer
13 years 10 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
POPL
2010
ACM
14 years 4 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
VLDB
2007
ACM
14 years 1 months ago
2007
ACM
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of c...
KBSE
1999
IEEE
13 years 11 months ago
1999
IEEE
Deductive retrieval and deductive synthesis are two conceptually closely related software development methods which apply theorem proving techniques to support the construction of...