A posthumous contribution by Larry Wos: excerpts from an unpublished column
From MaRDI portal
Publication:2102925
Recommendations
Cites work
- scientific article; zbMATH DE number 1809861 (Why is no real title available?)
- scientific article; zbMATH DE number 7350767 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 3219316 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Proof Method for Quantification Theory: Its Justification and Realization
- A survey of satisfiability modulo theory
- Automated deduction -- CADE 27. 27th international conference on automated deduction, Natal, Brazil, August 27--30, 2019. Proceedings
- Automated deduction -- CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2--7, 2009. Proceedings
- Combining superposition, sorts and splitting
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
- Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
- Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Description logic, theory combination, and all that. Essays dedicated to Franz Baader on the occasion of his 60th birthday
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- Efficient E-Matching for SMT Solvers
- Fast Decision Procedures Based on Congruence Closure
- Faster, higher, stronger: E 2.3
- Generalized completeness for SOS resolution and its application to a new notion of relevance
- Handbook of automated reasoning. In 2 vols
- Implementing Superposition in iProver (System Description)
- Model-based theory combination
- On First-Order Model-Based Reasoning
- Otter 2.0
- Politeness and combination methods for theories with bridging functions
- Proof Systems for Effectively Propositional Logic
- Refutational theorem proving for hierarchic first-order theories
- Revisiting enumerative instantiation
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Rewriting
- SCL clause learning from simple models
- Schubert's steamroller problem: Formulations and solutions
- Simplification by Cooperating Decision Procedures
- Simplify: a theorem prover for program checking
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving open questions and other challenge problems using proof sketches
- The TPTP problem library and associated infrastructure. From CNF to TH0, TPTP v6.4.0
- Theory and Applications of Satisfiability Testing
- Tools and algorithms for the construction and analysis of systems. 14th international conference, TACAS 2008, held as part of the joint European conferences on theory and practice of software, ETAPS 2008, Budapest, Hungary, March 29--April 6, 2008. Proceedings
- Using hints to increase the effectiveness of an automated reasoning program: Case studies
Cited in
(3)
This page was built for publication: A posthumous contribution by Larry Wos: excerpts from an unpublished column
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102925)
