default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th M4M 2007: Cachan, France
- Carlos Areces, Stéphane Demri:
Proceedings of the 5th Workshop on Methods for Modalities, M4M 2007, Cachan, France, November 29-30, 2007. Electronic Notes in Theoretical Computer Science 231, Elsevier 2009 - Carlos Areces
, Stéphane Demri:
Preface. 1-2 - Guillaume Hoffmann, Carlos Areces:
HTab: a Terminating Tableaux System for Hybrid Logic. 3-19 - Thomas Bolander, Patrick Blackburn:
Terminating Tableau Calculi for Hybrid Logics Extending K. 21-39 - Georgel Calin, Robert S. R. Myers, Dirk Pattinson, Lutz Schröder:
CoLoSS: The Coalgebraic Logic Satisfiability Solver. 41-54 - Pietro Abate, Rajeev Goré:
The Tableau Workbench. 55-67 - Philippe Balbiani, Jan M. Broersen, Julien Brunel:
Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations. 69-89 - Jason Reed, Frank Pfenning:
Intuitionistic Letcc via Labelled Deduction. 91-111 - Inanç Seylan, Riza Cenk Erdur:
A Tableau Decision Procedure for ALC With Monotonic Modal Operators and Constant Domains. 113-130 - Davide Bresolin, Valentin Goranko, Angelo Montanari, Pietro Sala:
Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings. 131-151 - Tero Tulenheimo, Manuel Rebuschi:
Equivalence Criteria for Compositional IF Modal Logics. 153-173 - Willem Conradie:
Completeness and Correspondence in Hybrid Logic via an Extension of SQEMA. 175-190 - Pietro Abate, Rajeev Goré, Florian Widmann:
An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability. 191-209 - Simon Richards, Mehrnoosh Sadrzadeh:
Aximo: Automated Axiomatic Reasoning for Information Update. 211-225 - Kai Brünnler, Thomas Studer:
Syntactic Cut-elimination for Common Knowledge. 227-240 - Mark Kaminski, Gert Smolka:
Hybrid Tableaux for the Difference Modality. 241-257 - Thomas Ågotnes, Wiebe van der Hoek, Michael J. Wooldridge:
Completeness and Complexity of Multi-modal CTL. 259-275 - Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, Heribert Vollmer:
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments. 277-292 - Guillaume Aucher, Philippe Balbiani, Luis Fariñas del Cerro, Andreas Herzig:
Global and Local Graph Modifiers. 293-307 - Dmitry Sustretov, Guillaume Hoffmann, Carlos Areces, Patrick Blackburn:
Experiments in Theorem Proving for Topological Hybrid Logic. 309-321 - Patricia Bouyer:
Model-checking Timed Temporal Logics. 323-341 - Laura Bozzelli:
CaRet With Forgettable Past. 343-361
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-02 22:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
