Linking focusing and resolution with selection
From MaRDI portal
Recommendations
Cites work
- A logical characterization of forward and backward chaining in the inverse method
- Automated Deduction – CADE-20
- Automatic Theorem Proving With Renamable and Semantic Resolution
- Cut Admissibility by Saturation
- Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
- Experimenting with deduction modulo
- Focused labeled proof systems for modal logic
- Focusing and polarization in linear, intuitionistic, and classical logics
- Foundational proof certificates in first-order logic
- Handbook of proof theory
- scientific article; zbMATH DE number 2086373 (Why is no real title available?)
- scientific article; zbMATH DE number 3254919 (Why is no real title available?)
- Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
- Logic Programming with Focusing Proofs in Linear Logic
- Polarized Resolution Modulo
- Proof normalization modulo
- Regaining cut admissibility in deduction modulo using abstract completion
- Resolution is cut-free
- Resolution theorem proving
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Superdeduction at Work
- Term Rewriting and Applications
- The Proof Certifier Checkers
- Theorem proving modulo
- Truth Values Algebras and Proof Normalization
Cited in
(2)
This page was built for publication: Linking focusing and resolution with selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005105)