Rens, GMeyer, TLakemeyer, G2014-07-302014-07-302014-06Rens, G, Meyer, T and Lakemeyer, G. 2014. SLAP: Specification logic of actions with probability. Journal of Applied Logic, vol. 12(2), pp 128-1501570-8683http://ac.els-cdn.com/S157086831300075X/1-s2.0-S157086831300075X-main.pdf?_tid=3800bd5c-16f7-11e4-8b08-00000aacb360&acdnat=1406621358_f5694fdca2f3df0b9a073369473e20f0http://hdl.handle.net/10204/7542Copyright: 2014 Elsevier. This is the pre/post print version. The definitive version is published in Journal of Applied Logic, vol. 12(2), pp 128-150A logic for specifying probabilistic transition systems is presented. Our perspective is that of agents performing actions. A procedure for deciding whether sentences in this logic are valid is provided. One of the main contributions of the paper is the formulation of the decision procedure: a tableau system which appeals to solving systems of linear equations. The tableau rules eliminate propositional connectives, then, for all open branches of the tableau tree, systems of linear equations are generated and checked for feasibility. Proofs of soundness, completeness and termination of the decision procedure are provided.enLinear equation systemsSpecification logic of actions with probabilitySLAPProbabilistic transition systemsArticleRens, G., Meyer, T., & Lakemeyer, G. (2014). SLAP: Specification logic of actions with probability. http://hdl.handle.net/10204/7542Rens, G, T Meyer, and G Lakemeyer "SLAP: Specification logic of actions with probability." (2014) http://hdl.handle.net/10204/7542Rens G, Meyer T, Lakemeyer G. SLAP: Specification logic of actions with probability. 2014; http://hdl.handle.net/10204/7542.TY - Article AU - Rens, G AU - Meyer, T AU - Lakemeyer, G AB - A logic for specifying probabilistic transition systems is presented. Our perspective is that of agents performing actions. A procedure for deciding whether sentences in this logic are valid is provided. One of the main contributions of the paper is the formulation of the decision procedure: a tableau system which appeals to solving systems of linear equations. The tableau rules eliminate propositional connectives, then, for all open branches of the tableau tree, systems of linear equations are generated and checked for feasibility. Proofs of soundness, completeness and termination of the decision procedure are provided. DA - 2014-06 DB - ResearchSpace DP - CSIR KW - Linear equation systems KW - Specification logic of actions with probability KW - SLAP KW - Probabilistic transition systems LK - https://researchspace.csir.co.za PY - 2014 SM - 1570-8683 T1 - SLAP: Specification logic of actions with probability TI - SLAP: Specification logic of actions with probability UR - http://hdl.handle.net/10204/7542 ER -