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):
Displayed 7 items.
- 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← 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)
- (Q4580320) (← links)
- (Q5015271) (← links)