|Affiliations:||Mathematical Institute of the Serbian Academy of Sciences and Arts||Title:||Decidability of a conditional-probability logic with non-standard valued probabilities||First page:||201||Last page:||207||Conference:||11th Workshop on nonmonotonic reasoning NMR 11, 30 May to 1 June 2006, Lake District area, UK, 201--207, 2006||Editors:||Dix, J.
A probabilistic logic was defined in (Rašković, Ognjanović & Marković 2004; 2004) with probabilistic operators, both conditional and ”absolute”, which are applied to propositional formulas. The range of probabilistic operators is syntactically restricted to a recursive subset of a non standard interval *[0,1] which means that it contains infinitesimals. In this paper we prove the decidability of that logic. This means that the logicmay be a suitable candidate for AI applications such as, e.g. modelling the default reasoning.
|Publisher:||Institut für Informatik, Technische Universität Clausthal|
Show full item record
checked on Feb 3, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.