Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete.
Daniel GrierPublished in: ICALP (1) (2013)
Keyphrases
- pspace complete
- np complete
- model checking
- decision problems
- satisfiability problem
- strips planning
- game theory
- partial order
- game playing
- totally ordered
- partially ordered
- np hard
- constraint satisfaction problems
- dynamic programming
- knowledge base
- temporal logic
- tree automata
- computational complexity
- search algorithm