Sciweavers

955 search results - page 48 / 191
» Tractable Temporal Reasoning
Sort
View
KI
2009
Springer
14 years 3 months ago
An Argumentation-Based Approach to Handling Inconsistencies in DL-Lite
As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of ...
Xiaowang Zhang, Zuoquan Lin
LPAR
2007
Springer
14 years 3 months ago
Data Complexity in the EL Family of Description Logics
We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability...
Adila Krisnadhi, Carsten Lutz
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 9 months ago
The Complexity of Satisfiability for Sub-Boolean Fragments of ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
Arne Meier, Thomas Schneider 0002
FMCO
2004
Springer
157views Formal Methods» more  FMCO 2004»
14 years 2 months ago
MoMo: A Modal Logic for Reasoning About Mobility
Abstract. A temporal logic is proposed as a tool for specifying properties of Klaim programs. Klaim is an experimental programming language that supports a programming paradigm whe...
Rocco De Nicola, Michele Loreti
IAT
2008
IEEE
14 years 3 months ago
Acquiring Vague Temporal Information from the Web
Many real–world information needs are naturally formulated as queries with temporal constraints. However, the structured temporal background information needed to support such c...
Steven Schockaert, Martine De Cock, Etienne E. Ker...