The following pages link to Automated Deduction – CADE-24 (Q4928424):
Displayed 33 items.
- One Logic to Use Them All (Q4928425) (← links)
- The Tree Width of Separation Logic with Recursive Definitions (Q4928426) (← links)
- Hierarchic Superposition with Weak Abstraction (Q4928427) (← links)
- Completeness and Decidability Results for First-Order Clauses with Indices (Q4928428) (← links)
- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (Q4928429) (← links)
- Tractable Inference Systems: An Extension with a Deducibility Predicate (Q4928430) (← links)
- Computing Tiny Clause Normal Forms (Q4928432) (← links)
- System Description: E-KRHyper 1.4 (Q4928433) (← links)
- Analysing Vote Counting Algorithms via Logic (Q4928434) (← links)
- Automated Reasoning, Fast and Slow (Q4928435) (← links)
- Foundational Proof Certificates in First-Order Logic (Q4928436) (← links)
- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals (Q4928437) (← links)
- A Symbiosis of Interval Constraint Propagation and Cylindrical Algebraic Decomposition (Q4928438) (← links)
- dReal: An SMT Solver for Nonlinear Theories over the Reals (Q4928439) (← links)
- Solving Difference Constraints over Modular Arithmetic (Q4928440) (← links)
- Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis (Q4928441) (← links)
- Hierarchical Combination (Q4928442) (← links)
- PRocH: Proof Reconstruction for HOL Light (Q4928443) (← links)
- An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description (Q4928444) (← links)
- Towards Modularly Comparing Programs Using Automated Theorem Provers (Q4928447) (← links)
- Reuse in Software Verification by Abstract Method Calls (Q4928448) (← links)
- Dynamic Logic with Trace Semantics (Q4928449) (← links)
- Temporalizing Ontology-Based Data Access (Q4928450) (← links)
- Verifying Refutations with Extended Resolution (Q4928451) (← links)
- Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems (Q4928452) (← links)
- Quantifier Instantiation Techniques for Finite Model Finding in SMT (Q4928453) (← links)
- Automating Inductive Proofs Using Theory Exploration (Q4928454) (← links)
- E-MaLeS 1.1 (Q4928455) (← links)
- TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism (Q4928456) (← links)
- Propositional Temporal Proving with Reductions to a SAT Problem (Q4928457) (← links)
- InKreSAT: Modal Reasoning via Incremental Reduction to SAT (Q4928458) (← links)
- bv2epr: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into EPR (Q4928459) (← links)
- The 481 Ways to Split a Clause and Deal with Propositional Variables (Q4928460) (← links)