Sciweavers

884 search results - page 144 / 177
» A Proof Theory for DL-Lite
Sort
View
ATAL
2006
Springer
15 years 3 months ago
False-name-proof combinatorial auction protocol: Groves Mechanism with SubModular Approximation
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
Makoto Yokoo, Toshihiro Matsutani, Atsushi Iwasaki
COLT
2006
Springer
15 years 3 months ago
DNF Are Teachable in the Average Case
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
Homin K. Lee, Rocco A. Servedio, Andrew Wan
FSE
2006
Springer
116views Cryptology» more  FSE 2006»
15 years 3 months ago
On Feistel Structures Using a Diffusion Switching Mechanism
We study a recently proposed design approach of Feistel structure which employs diffusion matrices in a switching way. At ASIACRYPT 2004, Shirai and Preneel have proved that large ...
Taizo Shirai, Kyoji Shibutani
TPHOL
2000
IEEE
15 years 3 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
DLS
2008
213views Languages» more  DLS 2008»
15 years 1 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy