We present a sound and complete tableau calculus for a class BReg of extended regular modal logics which contains useful epistemic logics for reasoning about agent beliefs. Our cal...
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
Sanjit A. Seshia, Shuvendu K. Lahiri, Randal E. Br...
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...