Extracting proofs from tabled proof search
From MaRDI portal
Recommendations
Cites work
- Checking NFA equivalence with bisimulations up to congruence
- Coinductive Logic Programming
- Completeness of Kozen's axiomatisation of the propositional \(\mu\)-calculus.
- Cut elimination for a logic with induction and co-induction
- Encoding transition systems in sequent calculus
- Enhancements of the bisimulation proof method
- Extracting proofs from tabled proof search
- Incorporating Tables into Proofs
- On global induction mechanisms in aμ-calculus with explicit approximations
- On the bisimulation proof method
- Programming with higher-order logic.
- Proof search specifications of bisimulation and modal logics for the \({\pi}\)-calculus
- Sequent calculi for induction and infinite descent
Cited in
(3)
This page was built for publication: Extracting proofs from tabled proof search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938048)