1058 search results - page 2 / 212 » It's Doomed; We Can Prove It |
AI
2010
Springer
13 years 5 months ago
2010
Springer
The past decade has seen clause learning as the most successful algorithm for SAT instances arising from real-world applications. This practical success is accompanied by theoreti...
DAM
2007
13 years 5 months ago
2007
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...
EPIA
1999
Springer
13 years 9 months ago
1999
Springer
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of 5 , uses a two layered architectur...
ENTCS
2007
13 years 5 months ago
2007
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...