Electronic Notes in Theoretical Computer Science, Volume 278
Volume 278, November 2011
- Guillaume Aucher, Bastien Maubert, François Schwarzentruber: Tableau Method and NEXPTIME-Completeness of DEL-Sequents. 17-30
- Philippe Balbiani, Valentin Goranko, Guido Sciavicco: Two-sorted Point-Interval Temporal Logics. 31-45
- Enrico Franconi, Yazmin Angélica Ibáñez-García, Inanç Seylan: Query Answering with DBoxes is Hard. 71-84
- Kohei Kishida: Neighborhood-Sheaf Semantics for First-Order Modal Logic. 129-143
- John Christopher McCabe-Dansted: A Rooted Tableau for BCTL*. 145-158
- Umberto Rivieccio: Paraconsistent Modal Logics. 173-186
- François Schwarzentruber: LotrecScheme. 187-199
- A. V. Sreejith: Expressive Completeness for LTL With Modulo Counting and Group Quantifiers. 201-214
- Dario Della Monica, Margherita Napoli, Mimmo Parente: On a Logic for Coalitional Games with Priced-Resource Agents. 215-228
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team