Author:
ARECES CARLOS,ORBE EZEQUIEL
Abstract
AbstractIn this paper we develop the theoretical foundations to exploit symmetries in modal logics. We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas using the framework provided by coinductive modal models introduced in [5]. Hence, the results apply to a wide class of modal logics including, for example, hybrid logics. We present two graph constructions that enable the reduction of symmetry detection in modal formulas to the graph automorphism detection problem, and we evaluate the graph constructions on modal benchmarks.
Publisher
Cambridge University Press (CUP)
Reference43 articles.
1. A new general method to generate random modal formulae for testing decision procedures;Patel-Schneider;Journal of Artificial Intelligence Research,,2003
2. Dealing with symmetries in Quantified Boolean Formulas;Audemard;The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004) Online Proceedings (Vancouver, BC, Canada),2004
3. Exploiting orbits in symmetric ILP
4. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs