184 search results - page 1 / 37 » Querying Proofs |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
MKM
2009
Springer
13 years 9 months ago
2009
Springer
Hilbert’s concept of formal proof is an ideal of rigour for mathematics which has important applications in mathematical logic, but seems irrelevant for the practice of mathemati...
LPAR
2012
Springer
12 years 10 days ago
2012
Springer
We motivate and introduce a query language PrQL designed for inspecting machine representations of proofs. PrQL natively supports hiproofs which express proof structure using hiera...
EXTREME
2004
ACM
13 years 10 months ago
2004
ACM
The World Wide Web Consortium recommends both XSLT and XQuery as query languages for XML documents. XSLT, originally designed to transform XML into XSL-FO, is nowadays a fully gro...
CCS
2009
ACM
14 years 5 months ago
2009
ACM
Distributed proof construction protocols have been shown to be valuable for reasoning about authorization decisions in open distributed environments such as pervasive computing sp...