Sciweavers

551 search results - page 48 / 111
» Natural proofs
Sort
View
ENTCS
2006
133views more  ENTCS 2006»
13 years 8 months ago
Linking Semantic Models to Support CSP || B Consistency Checking
Consistency checking in the CSP B approach verifies that an individual controller process, defined using a sequential non-divergent subset of CSP, never calls a B operation outsid...
Neil Evans, Helen Treharne
TCC
2009
Springer
158views Cryptology» more  TCC 2009»
14 years 9 months ago
On the (Im)Possibility of Arthur-Merlin Witness Hiding Protocols
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
Iftach Haitner, Alon Rosen, Ronen Shaltiel
LICS
1991
IEEE
14 years 7 days ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
CSR
2008
Springer
13 years 10 months ago
Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
Eric Allender
COMPGEOM
2003
ACM
14 years 2 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...