Sciweavers

146 search results - page 5 / 30
» Fault-Tolerant Distributed Theorem Proving
Sort
View
IJCAI
2003
13 years 8 months ago
Practical Partition-Based Theorem Proving for Large Knowledge Bases
Query answering over commonsense knowledge bases typically employs a first-order logic theorem prover. While first-order inference is intractable in general, provers can often b...
Bill MacCartney, Sheila A. McIlraith, Eyal Amir, T...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 7 months ago
The Impact of Topology on Byzantine Containment in Stabilization
Self-stabilization is an versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of ...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
SPAA
2003
ACM
14 years 18 days ago
Short length menger's theorem and reliable optical routing
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 8 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...
IPPS
1998
IEEE
13 years 11 months ago
Automatically Proving UNITY Safety Properties with Arrays and Quantifiers
Abstract. We address the general problem of automatically proving safety properties of reactive systems within the UNITY model. We take up a relational and set-based approach, and ...
Xavier Thirioux