Sciweavers

1285 search results - page 109 / 257
» Description Logic Reasoner: System Description
Sort
View
DLOG
2003
15 years 7 months ago
Complexity of Reasoning
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
Francesco M. Donini
ADC
2004
Springer
90views Database» more  ADC 2004»
15 years 11 months ago
Representing and Reasoning on XForms Document
Forms are the most common way to interface users and Web-based applications. Traditional forms cannot provide the functionality needed to fulfil the requirements of complex appli...
Peng Yew Cheow, Guido Governatori
FOIS
2006
15 years 7 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
CAI
2006
Springer
15 years 6 months ago
Symbolic Explanation of Similarities in Case-based Reasoning
CBR systems solve problems by assessing their similarity with already solved problems (cases). Explanation of a CBR system prediction usually consists of showing the user the set o...
Eva Armengol, Enric Plaza
CADE
2006
Springer
15 years 10 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez