Pages that link to "Item:Q4561495"
From MaRDI portal
The following pages link to Discrete Temporal Constraint Satisfaction Problems (Q4561495):
Displaying 17 items.
- Computational complexity of linear constraints over the integers (Q360099) (← links)
- Solving non-linear constraint satisfaction problems involving time-dependent functions (Q475451) (← links)
- STCSP -- structured temporal constraint satisfaction problems (Q1306754) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Translation-based approaches for solving disjunctive temporal problems with preferences (Q2331097) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- The complexity of temporal constraint satisfaction problems (Q3578192) (← links)
- Efficient Temporal Satisfiability (Q4013255) (← links)
- (Q5005133) (← links)
- (Q5089260) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- An interdisciplinary experimental evaluation on the disjunctive temporal problem (Q6080502) (← links)
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)
- Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)