The following pages link to Automated Deduction — CADE-12 (Q5210757):
Displayed 50 items.
- The crisis in finite mathematics: Automated reasoning as cause and cure (Q5210758) (← links)
- A divergence critic (Q5210759) (← links)
- Synthesis of induction orderings for existence proofs (Q5210760) (← links)
- Lazy generation of induction hypotheses (Q5210761) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- A method for building models automatically. Experiments with an extension of OTTER (Q5210763) (← links)
- Model elimination without contrapositives (Q5210764) (← links)
- Induction using term orderings (Q5210765) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- On the connection between narrowing and proof by consistency (Q5210767) (← links)
- A fixedpoint approach to implementing (Co)inductive definitions (Q5210768) (← links)
- On notions of inductive validity for first-order equational clauses (Q5210769) (← links)
- A new application for explanation-based generalisation within automated deduction (Q5210770) (← links)
- Semantically guided first-order theorem proving using hyper-linking (Q5210771) (← links)
- The applicability of logic program analysis and transformation to theorem proving (Q5210773) (← links)
- Detecting non-provable goals (Q5210774) (← links)
- A mechanically proof-checked encyclopedia of mathematics: Should we build one? Can we? (Q5210775) (← links)
- The TPTP problem library (Q5210777) (← links)
- Combination techniques for non-disjoint equational theories (Q5210778) (← links)
- Primal grammars and unification modulo a binary clause (Q5210779) (← links)
- Conservative query normalization on parallel circumscription (Q5210781) (← links)
- Bottom-up evaluation of Datalog programs with arithmetic constraints (Q5210782) (← links)
- On intuitionistic query answering in description bases (Q5210783) (← links)
- Proof script pragmatics in IMPS (Q5210784) (← links)
- A mechanization of strong Kleene logic for partial functions (Q5210785) (← links)
- Algebraic factoring and geometry theorem proving (Q5210786) (← links)
- Mechanically proving geometry theorems using a combination of Wu's method and Collins' method (Q5210787) (← links)
- Str∔ve and integers (Q5210788) (← links)
- Ordered chaining for total orderings (Q5210789) (← links)
- Simple termination revisited (Q5210790) (← links)
- Termination orderings for rippling (Q5210791) (← links)
- A novel asynchronous parallelism scheme for first-order logic (Q5210792) (← links)
- Proving with BDDs and control of information (Q5210793) (← links)
- Extended path-indexing (Q5210794) (← links)
- Associative-commutative deduction with constraints (Q5210795) (← links)
- AC-superposition with constraints: No AC-unifiers needed (Q5210796) (← links)
- The complexity of counting problems in equational matching (Q5210797) (← links)
- Representing proof transformations for program optimization (Q5210798) (← links)
- Exploring abstract algebra in constructive type theory (Q5210799) (← links)
- Tactic theorem proving with refinement-tree proofs and metavariables (Q5210800) (← links)
- Unification in an extensional lambda calculus with ordered function sorts and constant overloading (Q5210801) (← links)
- Decidable higher-order unification problems (Q5210802) (← links)
- Theory and practice of minimal modular higher-order E-unification (Q5210803) (← links)
- A refined version of general E-unification (Q5210804) (← links)
- A completion-based method for mixed universal and rigid E-unification (Q5210805) (← links)
- On pot, pans and pudding or how to discover generalised critical Pairs (Q5210806) (← links)
- Semantic tableaux with ordering restrictions (Q5210807) (← links)
- Strongly analytic tableaux for normal modal logics (Q5210808) (← links)
- Reconstructing proofs at the assertion level (Q5210809) (← links)
- Problems on the generation of finite models (Q5210810) (← links)