Pages that link to "Item:Q1209339"
From MaRDI portal
The following pages link to The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic (Q1209339):
Displaying 7 items.
- Backdoors for linear temporal logic (Q1725638) (← links)
- The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
- Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations (Q2938489) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- (Q4580320) (← links)
- (Q5015271) (← links)
