Skip navigation
Skip navigation

Solving graded/probabilistic modal logic via linear inequalities (system description)

Snell, W.; Pattinson, Dirk; Widmann, Florian


We present the experience gained from implementing a new decision procedure for both graded and probabilistic modal logic. While our approach uses standard tableaux for propositional connectives, modal rules are given by linear constraints on the arguments of operators. The implementation uses binary decision diagrams for propositional connectives and a linear programming library for the modal rules. We compare our implementation, for graded modal logic, with other tools, showing average...[Show more]

CollectionsANU Research Publications
Date published: 2012
Type: Conference paper
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
DOI: 10.1007/978-3-642-28717-6_30


File Description SizeFormat Image
01_Snell_Solving_graded/probabilistic_2012.pdf227.27 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator