Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates

DOI10.1007/978-3-540-89439-1_38zbMATH Open1182.68228OpenAlexW1884553506MaRDI QIDQ5505580FDOQ5505580

Authors: Witold Charatonik, Michał Wrona Edit this on Wikidata

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_38

Recommendations

• Quantified Positive Temporal Constraints
• The complexity of temporal constraint satisfaction problems
• Tractability of quantified temporal constraints to the max
• Temporal constraint satisfaction problems in fixed-point logic
• Tractability frontier for dually-closed Ord-Horn quantified constraint satisfaction problems

Mathematics Subject Classification ID

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

Cited In (8)

• Tractability frontier for dually-closed Ord-Horn quantified constraint satisfaction problems
• Tractability of quantified temporal constraints to the max
• On the descriptive complexity of temporal constraint satisfaction problems
• Quantified Constraints in Twenty Seventeen
• Temporal constraint satisfaction problems in fixed-point logic
• Quantified Positive Temporal Constraints
• The complexity of temporal constraint satisfaction problems
• Discrete temporal constraint satisfaction problems

This page was built for publication: Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates

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