Sciweavers

91 search results - page 8 / 19
» The Complexity of Reasoning for Fragments of Default Logic
Sort
View
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 9 months ago
The complexity of reasoning about pattern-based XML schemas
In a recent paper, Martens et al. introduced a specification mechanism for XML tree languages, based on rules of the form r s, where r, s are regular expressions. Sets of such ru...
Gjergji Kasneci, Thomas Schwentick
SEBD
2001
145views Database» more  SEBD 2001»
14 years 11 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
IJCAI
2007
14 years 11 months ago
A Faithful Integration of Description Logics with Logic Programming
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...
Boris Motik, Riccardo Rosati
CONCUR
2007
Springer
15 years 3 months ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
IANDC
2007
111views more  IANDC 2007»
14 years 9 months ago
Expressiveness and complexity of graph logic
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
Anuj Dawar, Philippa Gardner, Giorgio Ghelli