Sciweavers

174 search results - page 18 / 35
» Monotonicity in Calculational Proofs
Sort
View
ICALP
2007
Springer
14 years 1 months ago
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Abstract. We provide a new characterization of certain zero-knowledge protocols as non-interactive instance-dependent commitment-schemes (NIC). To obtain this result we consider th...
Bruce M. Kapron, Lior Malka, Srinivasan Venkatesh
KR
2010
Springer
14 years 5 days ago
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Vaishak Belle, Gerhard Lakemeyer
PODC
1990
ACM
13 years 11 months ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger
AMAI
1998
Springer
13 years 7 months ago
Generalization and Specialization Strategies for Learning r.e. Languages
Overgeneralization is a major issue in the identification of grammars for formal languages from positive data. Different formulations of generalization and specialization strate...
Sanjay Jain, Arun Sharma
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef