Sciweavers

3228 search results - page 124 / 646
» Computationally Sound Proofs
Sort
View
RTA
2004
Springer
14 years 3 months ago
Automated Termination Proofs with AProVE
We describe the system AProVE, an automated prover to verify (innermost) termination of term rewrite systems (TRSs). For this system, we have developed and implemented efficient al...
Jürgen Giesl, René Thiemann, Peter Sch...
AGP
2010
IEEE
14 years 3 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
Alberto Momigliano, Mario Ornaghi
ICALP
2010
Springer
14 years 2 months ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva
ARTS
1999
Springer
14 years 2 months ago
Proof Assistance for Real-Time Systems Using an Interactive Theorem Prover
This paper discusses the adaptation of the PVS theorem prover for performing analysis of real-time systems written in the ASTRAL formal specification language. A number of issues w...
Paul Z. Kolano
MFCS
1997
Springer
14 years 2 months ago
Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
Uwe Schöning