Sciweavers

884 search results - page 49 / 177
» A Proof Theory for DL-Lite
Sort
View
FOCS
2008
IEEE
15 years 6 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow
JAR
2007
104views more  JAR 2007»
14 years 11 months ago
Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book
The Intelligent Book project aims to improve online education by designing materials that can model the subject matter they teach, in the manner of a Reactive Learning Environment...
William Billingsley, Peter Robinson
SEMWEB
2009
Springer
15 years 6 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
AC
2000
Springer
14 years 11 months ago
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Abstract. In the late 80's Blum, Luby, Rubinfeld, Kannan et al. pioneered the theory of self
Marcos A. Kiwi, Frédéric Magniez, Mi...
CORR
2010
Springer
58views Education» more  CORR 2010»
14 years 9 months ago
Towards Theory of Massive-Parallel Proofs. Cellular Automata Approach
In the paper I sketch a theory of massively parallel proofs using cellular automata presentation of deduction. In this presentation inference rules play the role of cellular-autom...
Andrew Schumann