↓ Skip to main content

Automated Reasoning

Overview of attention for book
Automated Reasoning
Springer International Publishing

Table of Contents

  1. Book Overview
  2. Chapter 1 A Logical Framework for Developing and Mechanizing Set Theories
  3. Chapter 2 Programming by Examples: Applications, Algorithms, and Ambiguity Resolution
  4. Chapter 3 Logic & Proofs for Cyber-Physical Systems
  5. Chapter 4 A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality
  6. Chapter 5 Super-Blocked Clauses
  7. Chapter 6 Counting Constraints in Flat Array Fragments
  8. Chapter 7 A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT
  9. Chapter 8 Congruence Closure in Intensional Type Theory
  10. Chapter 9 Fast Cube Tests for LIA Constraint Solving
  11. Chapter 10 Model Finding for Recursive Functions in SMT
  12. Chapter 11 Colors Make Theories Hard
  13. Chapter 12 Nominal Confluence Tool
  14. Chapter 13 Built-in Variant Generation and Unification, and Their Applications in Maude 2.7
  15. Chapter 14 Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF
  16. Chapter 15 Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems
  17. Chapter 16 raSAT: An SMT Solver for Polynomial Constraints
  18. Chapter 17 Schematic Cut Elimination and the Ordered Pigeonhole Principle
  19. Chapter 18 Subsumption Algorithms for Three-Valued Geometric Resolution
  20. Chapter 19 On Interpolation and Symbol Elimination in Theory Extensions
  21. Chapter 20 System Description: GAPT 2.0
  22. Chapter 21 nanoCoP: A Non-clausal Connection Prover
  23. Chapter 22 Selecting the Selection
  24. Chapter 23 Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving
  25. Chapter 24 Internal Guidance for Satallax
  26. Chapter 25 Effective Normalization Techniques for HOL
  27. Chapter 26 Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition
  28. Chapter 27 Interval Temporal Logic Model Checking: The Border Between Good and Bad HS Fragments
  29. Chapter 28 : A Resolution-Based Prover for Multimodal K
  30. Chapter 29 Inducing Syntactic Cut-Elimination for Indexed Nested Sequents
  31. Chapter 30 A Tableau System for Quasi-Hybrid Logic
  32. Chapter 31 Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi
  33. Chapter 32 Intuitionistic Layered Graph Logic
  34. Chapter 33 Gen2sat: An Automated Tool for Deciding Derivability in Analytic Pure Sequent Calculi
  35. Chapter 34 Model Checking Parameterised Multi-token Systems via the Composition Method
  36. Chapter 35 Unbounded-Thread Program Verification using Thread-State Equations
  37. Chapter 36 A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints
  38. Chapter 37 Lower Runtime Bounds for Integer Programs
  39. Chapter 38 Translating Scala Programs to Isabelle/HOL
Attention for Chapter 7: A New Decision Procedure for Finite Sets and Cardinality Constraints in SMT

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (62nd percentile)

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
8 Mendeley