446 search results - page 56 / 90 » A Theorem Prover for a Computational Logic |
FMCAD
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
TCS
2010
14 years 8 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
CSL
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
114
click to vote
JAIR
2007
14 years 9 months ago
2007
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...