1410 search results - page 209 / 282 » Proving theorems by reuse |
132
click to vote
JACM
2010
15 years 12 days ago
2010
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
112
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a very simple and efficient adaptivelysound perfect NIZK argument system for any NP-language. In contrast to recently proposed schemes by Groth, Ostro...
168
click to vote
CAV
1998
Springer
15 years 6 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
133
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...