Pages that link to "Item:Q5278205"
From MaRDI portal
The following pages link to Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205):
Displaying 3 items.
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339) (← links)
- On the Complexity of Temporal-Logic Path Checking (Q5167829) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)