David M. Cerna

Andrew Cropper

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Equational Anti-Unification over Absorption Theories.

[BibT_eX]

[DOI]

Mauricio Ayala-Rincón

Andres Felipe Gonzalez Barragan

CoRR, 2023

Recursive First-order Syntactic Unification Modulo Variable Classes.

[BibT_eX]

[DOI]

CoRR, 2023

Anti-unification and Generalization: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Differentiable Inductive Logic Programming in High-Dimensional Space.

[BibT_eX]

[DOI]

Stanislaw J. Purgal

Cezary Kaliszyk

CoRR, 2022

One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus.

[BibT_eX]

[DOI]

Michal Buran

CoRR, 2022

Learning Higher-Order Logic Programs From Failures.

[BibT_eX]

[DOI]

Stanislaw J. Purgal

Cezary Kaliszyk

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021

Schematic Refutations of Formula Schemata.

[BibT_eX]

[DOI]

Anela Lolic

J. Autom. Reason., 2021

Learning Higher-Order Programs without Meta-Interpretive Learning.

[BibT_eX]

[DOI]

Stanislaw J. Purgal

Cezary Kaliszyk

CoRR, 2021

A Special Case of Schematic Syntactic Unification.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021

2020

Idempotent Anti-unification.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Anti-unification and the theory of semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Higher-order pattern generalization modulo equational theories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2020

On the Unification of Term Schemata.

[BibT_eX]

[DOI]

Anela Lolic

Proceedings of the 34th International Workshop on Unification, 2020

Aiding an Introduction to Formal Reasoning Within a First-Year Logic Course for CS Majors Using a Mobile Self-Study App.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

Unital Anti-Unification: Type and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

Computational Logic in the First Semester of Computer Science: An Experience Report.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Computer Supported Education, 2020

Covered Clauses Are Not Propagation Redundant.

[BibT_eX]

[DOI]

Lee A. Barnett

Armin Biere

Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019

A Mobile Application for Self-Guided Study of Formal Reasoning.

[BibT_eX]

[DOI]

Rafael P. D. Kiesel

Alexandra Dzhiganskaya

Proceedings of the Proceedings 8th International Workshop on Theorem Proving Components for Educational Software, 2019

A Generic Framework for Higher-Order Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2018

Higher-Order Equational Pattern Anti-Unification [Preprint].

[BibT_eX]

[DOI]

CoRR, 2018

Higher-Order Equational Pattern Anti-Unification.

[BibT_eX]

[DOI]

Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017

Clausal Analysis of First-order Proof Schemata.

[BibT_eX]

[DOI]

Michael Peter Lettmann

CoRR, 2017

Ceres in intuitionistic logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2017

Integrating a Global Induction Mechanism into a Sequent Calculus.

[BibT_eX]

[DOI]

Michael Peter Lettmann

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2017

Towards a Clausal Analysis of Proof Schemata.

[BibT_eX]

[DOI]

Michael Peter Lettmann

Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

Measuring the Gap: Algorithmic Approximation Bounds for the Space Complexity of Stream Specifications.

[BibT_eX]

[DOI]

Wolfgang Schreiner

Proceedings of the SCSS 2017, 2017

2016

Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version].

[BibT_eX]

[DOI]

CoRR, 2016

A Generalized Resolution Proof Schema and the Pigeonhole Principle.

[BibT_eX]

[DOI]

CoRR, 2016

Space Analysis of a Predicate Logic Fragment for the Specification of Stream Monitors.

[BibT_eX]

[DOI]

Wolfgang Schreiner

Proceedings of the 7th International Symposium on Symbolic Computation in Software Science, 2016

Predicting Space Requirements for a Stream Monitor Specification Language.

[BibT_eX]

[DOI]

Wolfgang Schreiner

Proceedings of the Runtime Verification - 16th International Conference, 2016

Schematic Cut Elimination and the Ordered Pigeonhole Principle.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 8th International Joint Conference, 2016

2015

Analysis of Clause set Schema Aided by Automated Theorem Proving: A Case Study [Extended Paper].

[BibT_eX]

[DOI]

CoRR, 2015

2014

A Tableaux-Based Decision Procedure for Multi-parameter Propositional Schemata.

[BibT_eX]

[DOI]