DMCA
Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames
BibTeX
@MISC{Michaliszyn_finitesatisfiability,
author = {Jakub Michaliszyn and Emanuel Kieroński},
title = {Finite Satisfiability of Modal Logic over Horn Definable Classes of Frames},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Modal logic plays an important role in various areas of computer science, including verification and knowledge representation. In many practical applications it is natural to consider some restrictions of classes of admissible frames. Traditionally classes of frames are defined by modal axioms. However, many important classes of frames, e.g. the class of transitive frames or the class of Euclidean frames, can be defined in a more natural way by first-order formulas. In a recent paper it was proved that the satisfiability problem for modal logic over the class of frames defined by a universally quantified, first-order Horn formula is decidable. In this paper we show that also the finite satisfiability problem for modal logic over such classes is decidable. Keywords: modal logic, decidability, finite satisfiability 1
Keyphrases
modal logic finite satisfiability horn definable class important role first-order formula finite satisfiability problem admissible frame traditionally class various area many important class many practical application first-order horn formula knowledge representation transitive frame satisfiability problem euclidean frame recent paper modal axiom natural way computer science
