Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase NExpTime-completeness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
2004 (1) 2009 (1) 2011 (1)
Publication types (Num. hits)
article(1) inproceedings(2)
Venues (Conferences, Journals, ...)
ACM Trans. Comput. Log.(1) M4M/LAMAS(1) TABLEAUX(1)
Authors
Angelo Montanari(1) Bastien Maubert(1) Carsten Lutz(1) Davide Bresolin(1) François Schwarzentruber(1) Guido Sciavicco(1) Guillaume Aucher(1) Pietro Sala(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords
Results
Found 3 publication records. Showing 3 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
44Carsten Lutz NEXP TIME-complete description logics with concrete domains. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF NExpTime-completeness, concrete domains, domino problem, Computational complexity, description logic, post correspondence problem
41Guillaume Aucher, Bastien Maubert, François Schwarzentruber Tableau Method and NEXPTIME-Completeness of DEL-Sequents. Search on Bibsonomy M4M/LAMAS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
22Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco A Tableau-Based System for Spatial Reasoning about Directional Relations. Search on Bibsonomy TABLEAUX The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #3 of 3 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license