Sciweavers

211 search results - page 15 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
RML
2002
82views Business» more  RML 2002»
13 years 8 months ago
A Nonmonotonic Rule System using Ontologies
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
Grigoris Antoniou
POPL
2012
ACM
12 years 4 months ago
Static and user-extensible proof checking
Despite recent successes, large-scale proof development within proof assistants remains an arcane art that is extremely timeconsuming. We argue that this can be attributed to two ...
Antonis Stampoulis, Zhong Shao
ITNG
2006
IEEE
14 years 2 months ago
Two-Party Private Vector Dominance: The All-Or-Nothing Deal
Alice holds a secret integer a while Bob holds a secret integer b, they want to decide on the predicate a > b with no information revealed other than the result. This is the we...
Maged Hamada Ibrahim
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
FMCAD
2007
Springer
14 years 2 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic