Sciweavers

3793 search results - page 216 / 759
» Expressive Description Logics
Sort
View
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
15 years 7 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
TOCL
2002
96views more  TOCL 2002»
15 years 6 months ago
On first-order topological queries
One important class of spatial database queries is the class of topological queries, that is, queries invariant under homeomorphisms. Westudy topological queries expressible in th...
Martin Grohe, Luc Segoufin
MLQ
2010
65views more  MLQ 2010»
15 years 5 months ago
Tautologies over implication with negative literals
We consider logical expressions built on the single binary connector of implication and a finite number of literals (boolean variables and their negations). We prove that asympto...
Hervé Fournier, Danièle Gardy, Antoi...
LICS
2005
IEEE
16 years 5 days ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
EKAW
2004
Springer
15 years 12 months ago
Extending Semantic-Based Matchmaking via Concept Abduction and Contraction
Motivated by the need to extend features of semantic matchmaking between request and offer descriptions, a model is presented that exploits recently proposed non-standard inference...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....