Sciweavers

4099 search results - page 123 / 820
» A Framework for Interactive Proof
Sort
View
COCO
1991
Springer
173views Algorithms» more  COCO 1991»
15 years 1 months ago
On the Random-Self-Reducibility of Complete Sets
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Joan Feigenbaum, Lance Fortnow
SIAMCOMP
2008
109views more  SIAMCOMP 2008»
14 years 8 months ago
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
We investigate structural properties of interactive perfect zero-knowledge (PZK) proofs. Specifically, we look into the closure properties of PZK languages under monotone boolean ...
Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe...
PLDI
2010
ACM
15 years 2 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
IUI
2010
ACM
15 years 4 months ago
Intelligent understanding of handwritten geometry theorem proving
Computer-based geometry systems have been widely used for teaching and learning, but largely based on mouse-andkeyboard interaction, these systems usually require users to draw fi...
Yingying Jiang, Feng Tian, Hongan Wang, Xiaolong Z...
RR
2009
Springer
15 years 2 months ago
Integrating Logic Programming and Production Systems in Abductive Logic Programming Agents
In this paper we argue the case for integrating the distinctive functionalities of logic programs and production systems within an abductive logic programming agent framework. In t...
Robert A. Kowalski, Fariba Sadri