| Entailment is Undecidable for Symbolic Heap Separation Logic Formulæ with Non-Established Inductive Rules | 0 | 0.34 | 2022 |
| Decidable Entailments in Separation Logic with Inductive Definitions - Beyond Establishment. | 0 | 0.34 | 2021 |
| Unifying Decidable Entailments In Separation Logic With Inductive Definitions | 0 | 0.34 | 2021 |
| A Superposition-Based Calculus for Diagrammatic Reasoning. | 0 | 0.34 | 2021 |
| Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard | 0 | 0.34 | 2020 |
| The Bernays-Schönfinkel-Ramsey Class of Separation Logic on Arbitrary Domains. | 0 | 0.34 | 2019 |
| On the Expressive Completeness of Bernays-Schönfinkel-Ramsey Separation Logic. | 0 | 0.34 | 2018 |
| The Complexity of Prenex Separation Logic with One Selector. | 0 | 0.34 | 2018 |
| Prime Implicate Generation in Equational Logic (extended abstract). | 0 | 0.34 | 2018 |
| Formalizing the Cox–Ross –Rubinstein Pricing of European Derivatives in Isabelle/HOL | 0 | 0.34 | 2018 |
| CERES for first-order schemata. | 0 | 0.34 | 2017 |
| Quantifier-Free Equational Logic and Prime Implicate Generation | 2 | 0.37 | 2015 |
| A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses. | 0 | 0.34 | 2014 |
| Decidability and undecidability results for propositional schemata | 15 | 0.90 | 2014 |
| A Rewriting Strategy to Generate Prime Implicates in Equational Logic. | 3 | 0.40 | 2014 |
| A Resolution Calculus for First-order Schemata | 7 | 0.56 | 2013 |
| Completeness and decidability results for first-order clauses with indices | 1 | 0.36 | 2013 |
| Combining Superposition and Induction: A Practical Realization. | 2 | 0.38 | 2013 |
| Reasoning on schemata of formulæ | 0 | 0.34 | 2012 |
| A calculus for generating ground explanations | 4 | 0.42 | 2012 |
| A Calculus for Generating Ground Explanations (Technical Report) | 1 | 0.36 | 2012 |
| An Instantiation Scheme for Satisfiability Modulo Theories | 4 | 0.38 | 2012 |
| Instantiation Schemes for Nested Theories | 0 | 0.34 | 2011 |
| Linear Temporal Logic and Propositional Schemata, Back and Forth | 3 | 0.41 | 2011 |
| Linear Temporal Logic and Propositional Schemata, Back and Forth (extended version) | 0 | 0.34 | 2011 |
| Schemata of SMT-problems | 5 | 0.49 | 2011 |
| Modular instantiation schemes | 1 | 0.35 | 2011 |
| Generating Schemata of Resolution Proofs | 0 | 0.34 | 2011 |
| Simplified handling of iterated term schemata | 0 | 0.34 | 2010 |
| Instantiation of SMT problems modulo integers | 2 | 0.36 | 2010 |
| More Flexible Term Schematisations via Extended Primal Grammars. | 0 | 0.34 | 2008 |
