Sciweavers

74 search results - page 6 / 15
» The Complexity of Reasoning for Fragments of Autoepistemic L...
Sort
View
93
Voted
PODS
2007
ACM
171views Database» more  PODS 2007»
15 years 11 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»
15 years 1 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
15 years 1 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
DLOG
2009
14 years 9 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
88
Voted
CONCUR
2007
Springer
15 years 5 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...