Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.
Laura BozzelliAlberto MolinariAngelo MontanariAdriano PeronGerhard J. WoegingerPublished in: ICTCS (2018)
Keyphrases
- np complete
- blocks world
- randomly generated
- constraint reasoning
- planning systems
- np hard
- temporal information
- temporal constraints
- spatio temporal
- spatial and temporal
- durative actions
- pspace complete
- decision rules
- domain independent planning
- heuristic search
- forward chaining
- satisfiability problem
- temporal reasoning
- causal graph
- ai planning
- areas of artificial intelligence
- temporal data
- complex domains
- constraint satisfaction problems
- association rules
- temporal databases
- production rules
- computational complexity
- temporal patterns
- conjunctive queries
- classification rules
- linear temporal logic
- deterministic domains
- data complexity
- induction algorithms
- temporal aspects
- branch and bound algorithm
- temporal planning
- association rule mining