Proof complexity of modal resolution
From MaRDI portal
Recommendations
- Decidability by resolution for propositional modal logics
- Computer Science Logic
- scientific article; zbMATH DE number 1860672
- The Complexity of Propositional Proofs
- The Complexity of Propositional Proofs
- scientific article; zbMATH DE number 1156870
- Propositional proof complexity
- scientific article; zbMATH DE number 4027426
- scientific article; zbMATH DE number 1670490
- scientific article; zbMATH DE number 2110622
Cites work
- scientific article; zbMATH DE number 7029312 (Why is no real title available?)
- scientific article; zbMATH DE number 1860652 (Why is no real title available?)
- scientific article; zbMATH DE number 1445296 (Why is no real title available?)
- scientific article; zbMATH DE number 7278086 (Why is no real title available?)
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- scientific article; zbMATH DE number 3029852 (Why is no real title available?)
- A Computing Procedure for Quantification Theory
- A Machine-Oriented Logic Based on the Resolution Principle
- A Modal-Layered Resolution Calculus for K
- A benchmark method for the propositional modal logics K, KT, S4
- A characterization of tree-like resolution size
- A game characterisation of tree-like Q-resolution size
- A resolution-based calculus for coalition logic
- A resolution-based calculus for preferential logics
- Are Short Proofs Narrow? QBF Resolution Is Not So Simple
- Clausal resolution for normal modal logics
- Clique is hard on average for regular resolution
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Feasible interpolation for QBF resolution calculi
- Frege systems for quantified Boolean logic
- Handbook of modal logic
- Handbook of satisfiability. In 2 parts
- Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Logical Foundations of Proof Complexity
- Lower bounds for modal logics
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Modal Resolution
- Modal logic
- Modal resolution in clausal form
- New resolution-based QBF calculi and their proof complexity
- On lengths of proofs in non-classical logics
- On the correspondence between arithmetic theories and propositional proof systems – a survey
- On the power of clause-learning SAT solvers as resolution engines
- On the relative complexity of resolution refinements and cutting planes proof systems
- Parameterized Complexity of DPLL Search Procedures
- Parameterized bounded-depth Frege is not optimal
- Polynomial size proofs of the propositional pigeonhole principle
- Proof Complexity
- Proof complexity of non-classical logics
- Proof complexity of propositional default logic
- Proof-complexity results for nonmonotonic reasoning
- Propositional SAT solving
- Resolution in modal, description and hybrid logic
- Resolution with order and selection for hybrid logics
- Sequent Calculi for Normal Modal Propositional Logics
- Short proofs are narrow—resolution made simple
- Solving QBF with counterexample guided refinement
- Substitution Frege and extended Frege proof systems in non-classical logics
- The Complexity of Propositional Proofs
- The complexity of theorem proving in autoepistemic logic
- The complexity of theorem proving in circumscription and minimal entailment
- The intractability of resolution
- The relative efficiency of propositional proof systems
- Towards NP-P via proof complexity and search
Cited in
(2)
This page was built for publication: Proof complexity of modal resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832717)
