A Tableau Algorithm for the Clique Guarded Fragment

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

A Tableau Algorithm for the Clique Guarded Fragment

C. HirschC. Hirsch,  Stephan TobiesStephan Tobies
C. Hirsch, Stephan Tobies
A Tableau Algorithm for the Clique Guarded Fragment
In F. Wolter and H. Wansing and M. de Rijke and M. Zakharyaschev, eds., Advances in Modal Logics Volume 3, 2001. CSLI Publications
  • KurzfassungAbstract
    We describe a "modal style" tableau algorithm that decides satisfiability for the clique guarded fragment. As a corollary of constructions used to prove the correctness of the algorithm, we obtain a new proof for the generalised tree model property of the clique guarded fragment.
  • Forschungsgruppe:Research Group: Automatentheorie
@inproceedings{ HirschTobies-AiML-2001,
  address = {Stanford},
  author = {C. {Hirsch} and S. {Tobies}},
  booktitle = {Advances in Modal Logics Volume 3},
  editor = {F. {Wolter} and H. {Wansing} and M. {de~Rijke} and M. {Zakharyaschev}},
  publisher = {CSLI Publications},
  title = {A Tableau Algorithm for the Clique Guarded Fragment},
  year = {2001},
}