The following pages link to Waldmeister (Q31394):
Displayed 47 items.
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- Rewrite rules for \(\mathrm{CTL}^\ast\) (Q518745) (← links)
- Algebraic separation logic (Q549676) (← links)
- Internal axioms for domain semirings (Q627202) (← links)
- Fast and slow enigmas and parental guidance (Q831937) (← links)
- Knuth-Bendix completion of theories of commuting group endomorphisms (Q844197) (← links)
- Things to know when implementing KBO (Q861708) (← links)
- \textit{Theorema}: Towards computer-aided mathematical theory exploration (Q865646) (← links)
- Computer supported mathematics with \(\Omega\)MEGA (Q865650) (← links)
- FTP'2003: 4th international workshop on first-order theorem proving. Proceedings of the workshop (in connection with RDP'03, federated conference on rewriting, deduction and programming), Valencia, Spain, June 12--14, 2003 (Q877561) (← links)
- Axiomatizing the skew Boolean propositional calculus (Q877820) (← links)
- Complete axiomatizations for XPath fragments (Q975868) (← links)
- Limited resource strategy in resolution theorem proving (Q1404979) (← links)
- On using ground joinable equations in equational theorem proving (Q1404987) (← links)
- Automated deduction - CADE-18. 18th international conference, Copenhagen, Denmark, July 27--30, 2002. Proceedings (Q1613678) (← links)
- Efficient encodings of first-order Horn formulas in equational logic (Q1799100) (← links)
- Knowledge-based proof planning (Q1978469) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Ground joinability and connectedness in the superposition calculus (Q2104507) (← links)
- Guiding an automated theorem prover with neural rewriting (Q2104548) (← links)
- AC simplifications and closure redundancies in the superposition calculus (Q2142076) (← links)
- Varieties of regular semigroups with uniquely defined inversion (Q2178386) (← links)
- Extended feature algebra (Q2374310) (← links)
- Proof planning with multiple strategies (Q2389631) (← links)
- Efficient instance retrieval with standard and relational path indexing (Q2486586) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933) (← links)
- Detection of First Order Axiomatic Theories (Q2849492) (← links)
- Computer Runtimes and the Length of Proofs (Q2891314) (← links)
- Dependently Typed Programming Based on Automated Theorem Proving (Q2908568) (← links)
- Unifying Theories of Programming in Isabelle (Q2948230) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- (Q4447245) (← links)
- Simple and Efficient Clause Subsumption with Feature Vector Indexing (Q4913860) (← links)
- Computer-assisted human-oriented inductive theorem proving by descente infinie--a manifesto (Q4913999) (← links)
- The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- Proof simplification and automated theorem proving (Q5204800) (← links)
- (Q5389156) (← links)
- KI 2004: Advances in Artificial Intelligence (Q5450782) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479279) (← links)
- Mechanizing Mathematical Reasoning (Q5717445) (← links)
- Relational Lattices via Duality (Q5739457) (← links)
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (Q5747777) (← links)
- A comprehensive framework for saturation theorem proving (Q5918558) (← links)
- A comprehensive framework for saturation theorem proving (Q5970776) (← links)