![Finite automata / Temporal logic / Automated planning and scheduling / Linear temporal logic / Theoretical computer science / Neuropsychology / Computational complexity theory / Model checking / Deterministic finite automaton / Finite-state machine / Nondeterministic finite automaton / Algorithm Finite automata / Temporal logic / Automated planning and scheduling / Linear temporal logic / Theoretical computer science / Neuropsychology / Computational complexity theory / Model checking / Deterministic finite automaton / Finite-state machine / Nondeterministic finite automaton / Algorithm](https://www.pdfsearch.io/img/b32f597f0b4f45200eff39e9e0457899.jpg) Date: 2016-06-16 07:11:20Finite automata Temporal logic Automated planning and scheduling Linear temporal logic Theoretical computer science Neuropsychology Computational complexity theory Model checking Deterministic finite automaton Finite-state machine Nondeterministic finite automaton Algorithm | | Planning Under Uncertainty with Temporally Extended Goals Alberto Camacho ∗ Department of Computer Science University of Toronto. Canada. Add to Reading ListSource URL: icaps16.icaps-conference.orgDownload Document from Source Website File Size: 138,84 KBShare Document on Facebook
|