Extending Maximal Completion (Invited Talk)
From MaRDI portal
Publication:5089002
DOI10.4230/LIPICS.FSCD.2019.3OpenAlexW2955328239MaRDI QIDQ5089002FDOQ5089002
Authors: Sarah Winkler 
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/10510/pdf/LIPIcs-FSCD-2019-3.pdf/
Cites Work
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0
- System description: E 1.8
- Conditional confluence (system description)
- MædMax: a maximal ordered completion tool
- Abstract conflict driven learning
- Term Rewriting and All That
- Title not available (Why is that?)
- Complete Sets of Reductions for Some Equational Theories
- Termination and completion modulo associativity, commutativity and identity
- Normalized rewriting: An alternative to rewriting modulo a set of equations
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Mining propositional simplification proofs for small validating clauses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal completion
- Completion of a Set of Rules Modulo a Set of Equations
- Completion for rewriting modulo a congruence
- Completion for logically constrained rewriting
- A fully syntactic AC-RPO.
- On using ground joinable equations in equational theorem proving
- Encoding dependency pair techniques and control strategies for maximal completion
- Taking satisfiability to the next level with Z3 (abstract)
- Algebraic data integration
- Title not available (Why is that?)
- Normalized completion revisited
- Linear completion
- Automated Reasoning
Cited In (2)
This page was built for publication: Extending Maximal Completion (Invited Talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089002)
