Pages that link to "Item:Q1329742"
From MaRDI portal
The following pages link to The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742):
Displaying 17 items.
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow (Q1356203) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- Computing with cylindric modal logics and arrow logics, lower bounds (Q1863830) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- Comparative Approach to the Multi-Valued Logic Construction for Preferences (Q2814147) (← links)
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
- Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
- The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic (Q3677734) (← links)
- (Q4364506) (← links)
- (Q4580320) (← links)
- On the complexity of elementary modal logics (Q4910732) (← links)
- (Q5015271) (← links)
- Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic (Q5427258) (← links)
- Improved decision procedures for the modal logics K, T and S4 (Q6560176) (← links)
