The Satisfiability Problem for Probabilistic CTL Tom´asˇ Br´azdil Vojtˇech Forejt Jan Kˇret´ınsk´y

First Page		Document Content
Date: 2013-12-01 09:35:38 Theoretical computer science Mathematics Logic in computer science Mathematical analysis Temporal logic Generalizations of the derivative Computation tree logic Boolean satisfiability problem Symbol Model theory 120-cell Distribution		The Satisfiability Problem for Probabilistic CTL Tom´asˇ Br´azdil Vojtˇech Forejt Jan Kˇret´ınsk´y Add to Reading List Source URL: qav.comlab.ox.ac.uk Download Document from Source Website File Size: 191,20 KB Share Document on Facebook

	A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking Julien Brunel Damien Doligez DocID: 1qbbf - View Document
	Structured Parameter Estimation for LFG-DOP using Backoff Mary Hearne? and Khalil Sima’an† ? School of Computing, Dublin City University, Glasnevin, Dublin 9, Ireland † Institute for Logic, Language and Computation DocID: 1oCxi - View Document
	Extended Computation Tree Logic Roland Axelsson1 , Matthew Hague2 , Stephan Kreutzer2 , Martin Lange3 , and Markus Latte1 1 Department of Computer Science, Ludwig-Maximilians-Universit¨ DocID: 1mycE - View Document
	Extended Computation Tree Logic Roland Axelsson1 , Matthew Hague2 , Stephan Kreutzer2 , Martin Lange3 , and Markus Latte1 1 3 DocID: 1mpiw - View Document
	Extended Computation Tree Logic Roland Axelsson1 , Matthew Hague2 , Stephan Kreutzer2 , Martin Lange3 , and Markus Latte1 1 3 DocID: 1mbxQ - View Document