You have Guest access.
Log In
Frank Pfenning
Front matter
1-2
Games, Automata and Matching
3-18
Formalization of Continuous Probability Distributions
19-34
Compilation as Rewriting in Higher Order Logic
35-50
Barendregt’s Variable Convention in Rule Inductions
51-66
Automating Elementary Number-Theoretic Proofs Using Gröbner Bases
67-83
Optimized Reasoning in Description Logics Using Hypertableaux
84-99
Conservative Extensions in the Lightweight Description Logic EL\mathcal{EL}
100-115
An Incremental Technique for Automata-Based Decision Procedures
116-131
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
132-146
A Labelled System for IPL with Variable Splitting
147-166
Logical Interpretation: Static Program Analysis Using Theorem Proving
167-182
Solving Quantified Verification Conditions Using Satisfiability Modulo Theories
183-198
Efficient E-Matching for SMT Solvers
199-214
T{\mathcal{T}}-Decision by Decomposition
215-230
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
231-246
Improvements in Formula Generalization
247-262
On the Normalization and Unique Normalization Properties of Term Rewrite Systems
263-278
Handling Polymorphism in Automated Deduction
279-294
Automated Reasoning in Kleene Algebra
295-310
SRASS - A Semantic Relevance Axiom Selection System
311-327
Labelled Clauses
328-344
Automatic Decidability and Combinability Revisited
345
Designing Verification Conditions for Software
346-361
Encodings of Bounded LTL Model Checking in Effectively Propositional Logic
362-378
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
379-384
The KeY system 1.0 (Deduction Component)
385-390
KeY-C: A Tool for Verification of C Programs
391-397
The Bedwyr System for Model Checking over Syntactic Expressions
398-403
System for Automated Deduction (SAD): A Tool for Proof Verification
404-409
Logical Engineering with Instance-Based Methods
410-425
Predictive Labeling with Dependency Pairs Using SAT
426-442
Dependency Pairs for Rewriting with Non-free Constructors
443-459
Proving Termination by Bounded Increase
460-475
Certified Size-Change Termination
476-491
Encoding First Order Proofs in SAT
492-507
Hyper Tableaux with Equality
508-513
System Description: E- KRHyper
514-520
System Description: Spass Version 3.0
Back matter
This page requires script.
Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us
© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info