Optimal Multi-Valued LTL Planning for Systems with Access Right Levels Mohammad Hekmatnejad, and Georgios Fainekos Abstract— We propose a method for optimal Linear Temporal Logic (LTL) planning under incomplete or unce

First Page		Document Content
Date: 2018-02-27 19:23:46 Temporal logic Algebraic structures Mathematics Mathematical logic Theoretical computer science Linear temporal logic Logic in computer science Computation tree logic MVS Boolean domain Boolean algebra Finite-state machine		Optimal Multi-Valued LTL Planning for Systems with Access Right Levels Mohammad Hekmatnejad, and Georgios Fainekos Abstract— We propose a method for optimal Linear Temporal Logic (LTL) planning under incomplete or unce Add to Reading List Source URL: www.public.asu.edu Download Document from Source Website File Size: 392,54 KB Share Document on Facebook

	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract DocID: 1qYdf - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1qzAi - View Document
	Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc DocID: 1axwC - View Document
	Relational Dynamic Influence Diagram Language (RDDL): Language Description Scott Sanner () NICTA and the Australian National University Abstract The Relational Dynamic Influence Diagram Language (RDDL) i DocID: 15s11 - View Document
	Processes and Continuous Change in a SAT-based Planner 1 Ji-Ae Shin Courant Institute, New York University, New York, NY 10012, USA DocID: 15lA2 - View Document