Pages that link to "Item:Q2638188"
From MaRDI portal
The following pages link to Complexity of modal logics with Presburger constraints (Q2638188):
Displaying 13 items.
- On regular paths with counting and data tests (Q1744429) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- One-variable logic meets Presburger arithmetic (Q2007734) (← links)
- Mu-calculus satisfiability with arithmetic constraints (Q2226964) (← links)
- On the complexity of graded modal logics with converse (Q2296751) (← links)
- Reasoning with Global Assumptions in Arithmetic Modal Logics (Q2947894) (← links)
- (Q4364506) (← links)
- Modal Logics with Composition on Finite Forests (Q5145629) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)
- How to tell easy from hard: complexities of conjunctive query entailment in extensions of \(\mathcal{ALC}\) (Q6535408) (← links)
- Two variable logic with ultimately periodic counting (Q6573777) (← links)
- On two-variable guarded fragment logic with expressive local Presburger constraints (Q6597967) (← links)
