↓ Skip to main content

Automated Reasoning

Overview of attention for book
Cover of 'Automated Reasoning'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Program Termination Analysis by Size-Change Graphs (Abstract)
  3. Altmetric Badge
    Chapter 2 SET Cardholder Registration: The Secrecy Proofs
  4. Altmetric Badge
    Chapter 3 Algorithms, Datastructures, and other Issues in Efficient Automated Deduction
  5. Altmetric Badge
    Chapter 4 The Description Logic ALCNH R + Extended with Concrete Domains: A Practically Motivated Approach
  6. Altmetric Badge
    Chapter 5 NExpTime-Complete Description Logics with Concrete Domains
  7. Altmetric Badge
    Chapter 6 Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics
  8. Altmetric Badge
    Chapter 7 The Hybrid μ-Calculus
  9. Altmetric Badge
    Chapter 8 The Inverse Method Implements the Automata Approach for Modal Satisfiability
  10. Altmetric Badge
    Chapter 9 Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL
  11. Altmetric Badge
    Chapter 10 Tableaux for Temporal Description Logic with Constant Domains
  12. Altmetric Badge
    Chapter 11 Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation
  13. Altmetric Badge
    Chapter 12 Instructing Equational Set-Reasoning with Otter
  14. Altmetric Badge
    Chapter 13 NP-Completeness of Refutability by Literal-Once Resolution
  15. Altmetric Badge
    Chapter 14 Ordered Resolution vs. Connection Graph resolution
  16. Altmetric Badge
    Chapter 15 A Model-Based Completeness Proof of Extended Narrowing and Resolution
  17. Altmetric Badge
    Chapter 16 A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality
  18. Altmetric Badge
    Chapter 17 Superposition and Chaining for Totally Ordered Divisible Abelian Groups
  19. Altmetric Badge
    Chapter 18 Context Trees
  20. Altmetric Badge
    Chapter 19 On the Evaluation of Indexing Techniques for Theorem Proving
  21. Altmetric Badge
    Chapter 20 Preferred Extensions of Argumentation Frameworks: Query, Answering, and Computation
  22. Altmetric Badge
    Chapter 21 Bunched Logic Programming
  23. Altmetric Badge
    Chapter 22 A Top-Down Procedure for Disjunctive Well-Founded Semantics
  24. Altmetric Badge
    Chapter 23 A Second-Order Theorem Prover Applied to Circumscription
  25. Altmetric Badge
    Chapter 24 NoMoRe: A System for Non-Monotonic Reasoning with Logic Programs under Answer Set Semantics
  26. Altmetric Badge
    Chapter 25 Conditional Pure Literal Graphs
  27. Altmetric Badge
    Chapter 26 Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
  28. Altmetric Badge
    Chapter 27 QuBE: A System for Deciding Quantified Boolean Formulas Satisfiability
  29. Altmetric Badge
    Chapter 28 System Abstract: E 0.61
  30. Altmetric Badge
    Chapter 29 Vampire 1.1
  31. Altmetric Badge
    Chapter 30 DCTP - A Disconnection Calculus Theorem Prover - System Abstract
  32. Altmetric Badge
    Chapter 31 More On Implicit Syntax
  33. Altmetric Badge
    Chapter 32 Termination and Reduction Checking for Higher-Order Logic Programs
  34. Altmetric Badge
    Chapter 33 P.rex : An Interactive Proof Explainer
  35. Altmetric Badge
    Chapter 34 JProver: Integrating Connection-Based Theorem Proving into Interactive Proof Assistants
  36. Altmetric Badge
    Chapter 35 The eXtended Least Number Heuristic
  37. Altmetric Badge
    Chapter 36 System Description: SCOTT-5
  38. Altmetric Badge
    Chapter 37 Combination of Distributed Search and Multi-Search in Peers-mcd.d
  39. Altmetric Badge
    Chapter 38 Lotrec: The Generic Tableau Prover for Modal and Description Logics
  40. Altmetric Badge
    Chapter 39 The modprof Theorem Prover
  41. Altmetric Badge
    Chapter 40 A New System and Methodology for Generating Random Modal Formulae
  42. Altmetric Badge
    Chapter 41 Decidable Classes of Inductive Theorems
  43. Altmetric Badge
    Chapter 42 Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
  44. Altmetric Badge
    Chapter 43 Decidability and Complexity of Finitely Closable Linear Equational Theories
  45. Altmetric Badge
    Chapter 44 A New Meta-Complexity Theorem for Bottom-Up Logic Programs
  46. Altmetric Badge
    Chapter 45 Canonical Propositional Gentzen-Type Systems
  47. Altmetric Badge
    Chapter 46 Incremental Closure of Free Variable Tableaux
  48. Altmetric Badge
    Chapter 47 Deriving Modular Programs from Short Proofs
  49. Altmetric Badge
    Chapter 48 A General Method for Using Schematizations in Automated Deduction
  50. Altmetric Badge
    Chapter 49 Approximating Dependency Graphs Using Tree Automata Techniques
  51. Altmetric Badge
    Chapter 50 On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables
  52. Altmetric Badge
    Chapter 51 A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
  53. Altmetric Badge
    Chapter 52 Flaw Detection in Formal Specifications
  54. Altmetric Badge
    Chapter 53 CCE: Testing Ground Joinability
  55. Altmetric Badge
    Chapter 54 System Description: RDL Rewrite and Decision Procedure Laboratory
  56. Altmetric Badge
    Chapter 55 lolliCoP — A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic
  57. Altmetric Badge
    Chapter 56 Muscadet 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction
  58. Altmetric Badge
    Chapter 57 Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory
  59. Altmetric Badge
    Chapter 58 STRIP: Structural Sharing for Efficient Proof-Search
  60. Altmetric Badge
    Chapter 59 RACER System Description
Attention for Chapter 23: A Second-Order Theorem Prover Applied to Circumscription
Altmetric Badge

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
A Second-Order Theorem Prover Applied to Circumscription
Chapter number 23
Book title
Automated Reasoning
Published by
Springer, Berlin, Heidelberg, June 2001
DOI 10.1007/3-540-45744-5_23
Book ISBNs
978-3-54-042254-9, 978-3-54-045744-2
Authors

Michael Beeson

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 1 100%
Readers by discipline Count As %
Computer Science 1 100%