Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic
From MaRDI portal
Publication:2119125
DOI10.1007/978-3-030-68446-4_17OpenAlexW3130967043MaRDI QIDQ2119125
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-68446-4_17
propositional intuitionistic logicautomatic synthesis of logic systemsderiving new theorem provers via program synthesisembedding of modal logics into intuitionistic logicepistemic intuitionistic logicprolog-based theorem provers
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Evaluating epistemic negation in answer set programming
- Computations in fragments of intuitionistic propositional logic
- Intuitionistic propositional logic is polynomial-space complete
- On extensions of intermediate logics by strong negation
- New Semantics for Epistemic Specifications
- Contraction-free sequent calculi for intuitionistic logic
- An O(n log n)-Space Decision Procedure for Intuitionistic Propositional Logic
- fCube: An Efficient Prover for Intuitionistic Propositional Logic
- A CORRECT POLYNOMIAL TRANSLATION OF S4 INTO INTUITIONISTIC LOGIC
- INTUITIONISTIC EPISTEMIC LOGIC
- Inductive logic programming
This page was built for publication: Synthesis of modality definitions and a theorem prover for epistemic intuitionistic logic