91 search results - page 6 / 19 » The Complexity of Reasoning for Fragments of Default Logic |
DLOG
2003
14 years 11 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...
AGP
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from othe...
118
click to vote
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
AAAI
2012
12 years 12 months ago
2012
Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for first-order probabilistic languages. Howev...