An efficient relational deductive system for propositional non-classical logics
From MaRDI portal
Recommendations
- An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics
- Natural deduction for non-classical logics
- scientific article; zbMATH DE number 1086631
- scientific article; zbMATH DE number 2042611
- Labelled propositional modal logics: theory and practice
Cites work
- scientific article; zbMATH DE number 3903963 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 1765668 (Why is no real title available?)
- scientific article; zbMATH DE number 1765691 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- A proof system for contact relation algebras
- A proof system for the first-order relational calculus
- A rewriting approach to binary decision diagrams
- A sequent calculus for relation algebras
- Accelerating tableaux proofs using compact representations
- Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence
- Automated Deduction with Shannon Graphs
- Automated reasoning with analytic tableaux and related methods. International conference, TABLEAUX 2005, Koblenz, Germany, September 14--17, 2005. Proceedings.
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings
- BDDs -- design, analysis, complexity, and applications.
- Compiling dyadic first-order specifications into map algebra
- Depth-first iterative-deepening: An optimal admissible tree search
- Efficient model generation through compilation.
- First-order tableau methods
- Graph-Based Algorithms for Boolean Function Manipulation
- Implementing semantic tableaux
- Improving the variable ordering of OBDDs is NP-complete
- Inaccessible worlds
- Modal definability in enriched languages
- Proof system for weakest prespecification
- Proofs with graphs
- Relational proof system for relevant logics
- Tableau methods for modal and temporal logics
- The Taming of the Cut. Classical Refutations with Analytic Cut
- The origin of relation algebras in the development and axiomatization of the calculus of relations
- Upper Bounds for Proof‐Search in a Sequent Calculus for Relational Equations
- Zero, successor and equality in BDDs
Cited in
(11)- Dual tableau for monoidal triangular norm logic MTL
- A graphical representation of relational formulae with complementation
- Relational proof system for relevant logics
- Implementing a relational theorem prover for modal logic K
- Dual tableau-based decision procedures for fragments of the logic of binary relations
- Reasoning on relations, modalities, and sets
- Relational dual tableau decision procedures and their applications to modal and intuitionistic logics
- Relational and Kleene-Algebraic Methods in Computer Science
- A Non-probabilistic Relational Model of Probabilistic Kleene Algebras
- An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics
- Order-dual relational semantics for non-distributive propositional logics
This page was built for publication: An efficient relational deductive system for propositional non-classical logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647245)
