Pages that link to "Item:Q2724150"

The following pages link to Handbook of automated reasoning. In 2 vols (Q2724150):

Displaying 36 items.

• Reliability of mathematical inference (Q2695405) (← links)
• Reasoning on Schemas of Formulas: An Automata-Based Approach (Q2799178) (← links)
• Imperative LF meta-programming (Q2871844) (← links)
• On First-Order Model-Based Reasoning (Q2945706) (← links)
• Conjunctive Abstract Interpretation Using Paramodulation (Q2961582) (← links)
• NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
• Counterexample-Guided Model Synthesis (Q3303898) (← links)
• Martin Davis’s Bibliography 1950–2015 (Q3305330) (← links)
• History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
• (Q3618853) (← links)
• The Blossom of Finite Semantic Trees (Q4916075) (← links)
• From Schütte’s Formal Systems to Modern Automated Deduction (Q5013905) (← links)
• (Q5020994) (← links)
• Implementing Superposition in iProver (System Description) (Q5049017) (← links)
• In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming (Q5108530) (← links)
• How to Produce Information About a Given Entity Using Automated Deduction Methods (Q5170287) (← links)
• Loop invariants (Q5176169) (← links)
• Formal Verification of Graph Grammars using Mathematical Induction (Q5179351) (← links)
• MODULARITY IN MATHEMATICS (Q5221289) (← links)
• Higher-order semantics and extensionality (Q5311767) (← links)
• Rewriting Interpolants (Q5415616) (← links)
• Analogy in Automated Deduction: A Survey (Q5739522) (← links)
• A Decidable Class of Nested Iterated Schemata (Q5747768) (← links)
• An Impossible Asylum (Q6042557) (← links)
• A multi-clause dynamic deduction algorithm based on standard contradiction separation rule (Q6086313) (← links)
• The 11th IJCAR automated theorem proving system competition – CASC-J11 (Q6095787) (← links)
• On structures of regular standard contradictions in propositional logic (Q6154459) (← links)
• Symbolic computation in automated program reasoning (Q6174522) (← links)
• Neural logic rule layers (Q6199740) (← links)
• Proving the infeasibility of Horn formulas through read-once resolution (Q6558679) (← links)
• Automated deduction (Q6602250) (← links)
• Algorithms for solving linear constraints over the ring of integers (Q6638456) (← links)
• Solving hard Mizar problems with instantiation and strategy invention (Q6648179) (← links)
• Deciding hyperproperties combined with functional specifications (Q6649493) (← links)
• Investigations into proof structures (Q6653096) (← links)
• IASCAR: incremental answer set counting by anytime refinement (Q6656460) (← links)