Quantified Positive Temporal Constraints

DOI10.1007/978-3-540-87531-4_9zbMATH Open1156.68398OpenAlexW1525928433MaRDI QIDQ3540173FDOQ3540173

Authors: Witold Charatonik, Michał Wrona 

Publication date: 20 November 2008

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_9

Recommendations

• Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
• Tractability of quantified temporal constraints to the max
• The complexity of temporal constraint satisfaction problems
• Discrete temporal constraint satisfaction problems
• Temporal constraint satisfaction problems in fixed-point logic

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (8)

• Tractability frontier for dually-closed Ord-Horn quantified constraint satisfaction problems
• Tractability of quantified temporal constraints to the max
• Quantified Constraints in Twenty Seventeen
• Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
• Temporal constraint satisfaction problems in fixed-point logic
• On the feasibility of checking temporal integrity constraints
• The complexity of temporal constraint satisfaction problems
• Discrete temporal constraint satisfaction problems

This page was built for publication: Quantified Positive Temporal Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540173)