CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
Complexity of timeline-based planning
Nicola Gigante
,
Angelo Montanari
,
Marta Cialdea Mayer
,
Andrea Orlandini
2017-01-01
Cite
Type
Conference paper
Publication
Proceedings International Conference on Automated Planning and Scheduling, ICAPS
Artificial Intelligence; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and Management
Related
A game-theoretic approach to timeline-based planning with uncertainty
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning
Decidability and complexity of action-based temporal planning over dense time
Expressiveness of Extended Bounded Response LTL
Decidability and Complexity of Action-Based Temporal Planning over Dense Time
Cite
×