Sciweavers

838 search results - page 121 / 168
» From Natural Language to Formal Proof Goal
Sort
View
TOOLS
1999
IEEE
15 years 10 months ago
Class Algebra for Ontology Reasoning
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational dat...
Daniel J. Buehrer, Chee-Hwa Lee
ICALP
2001
Springer
15 years 10 months ago
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
Peter Høyer, Jan Neerbek, Yaoyun Shi
CORR
2010
Springer
180views Education» more  CORR 2010»
15 years 6 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
AGP
2010
IEEE
15 years 4 months ago
Concurrent and Reactive Constraint Programming
The Italian Logic Programming community has given several contributions to the theory of Concurrent Constraint Programming. In particular, in the topics of semantics, verification,...
Maurizio Gabbrielli, Catuscia Palamidessi, Frank D...
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
16 years 6 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...