1 citations · 3 across the 7 of their papers we have counts for
8 papers
Challenging Benchmarks for Diagrammatic Equivalence of Circuits in TPTP and SMT-LIB
Julie Cailler, Noé Delorme, Sophie Tourret
We introduce a new family of benchmarks for the problem of diagrammatic equivalence between circuits. Three variants of this problem are considered, ranging from basic to challengi…
Proceedings of the 21st Workshop on Logical Frameworks and Meta Languages: Theory and Practice
Sophie Tourret, Olivier Hermant
This volume of the Electronic Proceedings in Theoretical Computer Science (EPTCS) includes the contributed papers presented at the 21st International Workshop on Logical Frameworks…
Towards Term-based Verification of Diagrammatic Equivalence
Julie Cailler, Noé Delorme, Simon Perdrix +1
A string diagram is a two-dimensional graphical representation that can be described as a one-dimensional term generated from a set of primitives using sequential and parallel comp…
Connection-minimal Abduction in EL via Translation to FOL -- Technical Report
Fajar Haifani, Patrick Koopmann, Sophie Tourret +1
Abduction in description logics finds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to re…
Superposition with Lambdas
Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret +2
We designed a superposition calculus for a clausal fragment of extensional polymorphic higher-order logic that includes anonymous functions but excludes Booleans. The inference rul…
Signature-Based Abduction for Expressive Description Logics -- Technical Report
Patrick Koopmann, Warren Del-Pinto, Sophie Tourret +1
Signature-based abduction aims at building hypotheses over a specified set of names, the signature, that explain an observation relative to some background knowledge. This type of…
Logical reduction of metarules
Andrew Cropper, Sophie Tourret
Many forms of inductive logic programming (ILP) use \emph{metarules}, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Decidi…
SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --
Sophie Tourret, Andrew Cropper
We present the derivation reduction problem for SLD-resolution, the undecidable problem of finding a finite subset of a set of clauses from which the whole set can be derived using…