The following pages link to Automated Deduction – CADE-21 (Q3608758):
Displaying 32 items.
- Formalization of Continuous Probability Distributions (Q3608759) (← links)
- Compilation as Rewriting in Higher Order Logic (Q3608760) (← links)
- Barendregt’s Variable Convention in Rule Inductions (Q3608761) (← links)
- Automating Elementary Number-Theoretic Proofs Using Gröbner Bases (Q3608762) (← links)
- Optimized Reasoning in Description Logics Using Hypertableaux (Q3608764) (← links)
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$ (Q3608766) (← links)
- An Incremental Technique for Automata-Based Decision Procedures (Q3608767) (← links)
- Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4 (Q3608769) (← links)
- A Labelled System for IPL with Variable Splitting (Q3608770) (← links)
- Logical Interpretation: Static Program Analysis Using Theorem Proving (Q3608771) (← links)
- Solving Quantified Verification Conditions Using Satisfiability Modulo Theories (Q3608772) (← links)
- Efficient E-Matching for SMT Solvers (Q3608773) (← links)
- ${\mathcal{T}}$ -Decision by Decomposition (Q3608774) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- Improvements in Formula Generalization (Q3608776) (← links)
- On the Normalization and Unique Normalization Properties of Term Rewrite Systems (Q3608777) (← links)
- Handling Polymorphism in Automated Deduction (Q3608778) (← links)
- Automated Reasoning in Kleene Algebra (Q3608779) (← links)
- SRASS - A Semantic Relevance Axiom Selection System (Q3608780) (← links)
- Labelled Clauses (Q3608781) (← links)
- Automatic Decidability and Combinability Revisited (Q3608782) (← links)
- Encodings of Bounded LTL Model Checking in Effectively Propositional Logic (Q3608783) (← links)
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (Q3608784) (← links)
- System for Automated Deduction (SAD): A Tool for Proof Verification (Q3608785) (← links)
- Predictive Labeling with Dependency Pairs Using SAT (Q3608786) (← links)
- Dependency Pairs for Rewriting with Non-free Constructors (Q3608787) (← links)
- Proving Termination by Bounded Increase (Q3608788) (← links)
- Certified Size-Change Termination (Q3608789) (← links)
- Encoding First Order Proofs in SAT (Q3608794) (← links)
- Hyper Tableaux with Equality (Q3608795) (← links)
- System Description: E- KRHyper (Q3608796) (← links)
- System Description: Spass Version 3.0 (Q3608799) (← links)