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

Authors:
William Snell;Dirk Pattinson;Florian Widmann
Affiliations:
Dept. of Computing, Imperial College, London, UK;Dept. of Computing, Imperial College, London, UK;Dept. of Computing, Imperial College, London, UK
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 15
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Reasoning about knowledge and probability

Journal of the ACM (JACM)
RACER System Description

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Bisimulation for labelled Markov processes

Information and Computation - Special issue: LICS'97
Basic description logics

The description logic handbook
Pellet: A practical OWL-DL reasoner

Web Semantics: Science, Services and Agents on the World Wide Web
PSPACE bounds for rank-1 modal logics

ACM Transactions on Computational Logic (TOCL)
CoLoSS: The Coalgebraic Logic Satisfiability Solver

Electronic Notes in Theoretical Computer Science (ENTCS)
Hypertableau reasoning for description logics

Journal of Artificial Intelligence Research
Practical reasoning with qualified number restrictions: A hybrid Abox calculus for the description logic 𝒮ℋ𝒬

AI Communications - Practical Aspects of Automated Reasoning
Logical characterizations of bisimulations for discrete probabilistic systems

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Automated reasoning in ALCQ via SMT

CADE'11 Proceedings of the 23rd international conference on Automated deduction
FaCT++ description logic reasoner: system description

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
PRISM: a tool for automatic verification of probabilistic systems

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 performance. Due to lack of other implementations, no comparison is provided for probabilistic modal logic, the main new feature of our implementation.