Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
391
Towards top-k query answering in description logics: The case of DL-lite
, 2006
"... Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location ” in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top-k an ..."
Abstract
-
Cited by 22 (9 self)
- Add to MetaCart
Abstract. We address the problem of evaluating ranked top-k queries in descrip-tion logics. The problem occurs whenever we allow queries such as “find cheap hotels close to the conference location ” in which fuzzy predicates like cheap and close occur. We show how to efficiently compute the top
Logical Foundations of (e)RDF(S): Complexity and Reasoning?
"... Abstract. An important open question in the semantic Web is the precise rela-tionship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, we establish several novel complexity results. The embed-dings we consider show how techniques from deductive databases and descrip-tion logics can be used for reasoning with RDF(S). Finally, we
Computational ontologies of parthood, componenthood, and containment
- Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence 2005 (IJCAI05
, 2005
"... Parthood, componenthood, and containment rela-tions are commonly assumed in biomedical ontolo-gies and terminology systems, but are not usually clearly distinguished from another. This paper con-tributes towards a unified theory of parthood, com-ponenthood, and containment relations. Our goal in thi ..."
Abstract
-
Cited by 10 (0 self)
- Add to MetaCart
in this is to clarify distinctions between these relations as well as principles governing their interrelations. We first develop a theory of these relations in first order predicate logic and then discuss how descrip-tion logics can be used to capture some important aspects of the first order theory. 1
A theoretical model to handle ontology debugging and change through argumentation
- In Proceedings of the 2nd Workshop on Ontology Dynamics, (IWOD-08) at ISWC 08 Conference
, 2008
"... Abstract. A dynamic argumentation framework based on ALC descrip-tion logics is presented by extending notions from argumentation. Since argumentation frameworks reason over graphs that relate arguments through attack, a methodology is proposed to bridge ontology-specific concepts to argumentation n ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
Abstract. A dynamic argumentation framework based on ALC descrip-tion logics is presented by extending notions from argumentation. Since argumentation frameworks reason over graphs that relate arguments through attack, a methodology is proposed to bridge ontology-specific concepts to argumentation
Descriptive Complexity
, 1999
"... book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would like to understand computa-tion from the point of view of logic. The book is designed for graduate students or advanced undergraduates in computer science or mathematics and is suitable as a textbook o ..."
Abstract
-
Cited by 329 (17 self)
- Add to MetaCart
book is dedicated to Daniel and Ellie. Preface This book should be of interest to anyone who would like to understand computa-tion from the point of view of logic. The book is designed for graduate students or advanced undergraduates in computer science or mathematics and is suitable as a textbook
Description logics with circumscription
- In Proc. of KR
, 2006
"... We show that circumscription can be used to extend descrip-tion logics (DLs) with non-monotonic features in a straight-forward and transparent way. In particular, we consider ex-tensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is de-cidable ..."
Abstract
-
Cited by 37 (3 self)
- Add to MetaCart
We show that circumscription can be used to extend descrip-tion logics (DLs) with non-monotonic features in a straight-forward and transparent way. In particular, we consider ex-tensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is de
Quasi-Classical Description Logic
"... In this paper, we present a paraconsistent description logic based on quasi-classical logic. Compared to the four-valued descrip-tion logic, quasi-classical description logic satisfies all of the three basic inference rules (i.e., modus ponens, modus tollens and disjunctive syllogism) so that the in ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
In this paper, we present a paraconsistent description logic based on quasi-classical logic. Compared to the four-valued descrip-tion logic, quasi-classical description logic satisfies all of the three basic inference rules (i.e., modus ponens, modus tollens and disjunctive syllogism) so
On the Non-Monotonic Description Logic ALC+Tmin
"... In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into descrip-tion logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular, the non-monotonic description logic ALC+Tmin uses a combinat ..."
Abstract
- Add to MetaCart
In the last 20 years many proposals have been made to incorporate non-monotonic reasoning into descrip-tion logics, ranging from approaches based on default logic and circumscription to those based on preferential semantics. In particular, the non-monotonic description logic ALC+Tmin uses a
Adding Threshold Concepts to the Description Logic EL
"... Abstract. We introduce an extension of the lightweight Description Logic EL that allows us to define concepts in an approximate way. For this purpose, we use a graded membership function, which for each in-dividual and concept yields a number in the interval [0, 1] expressing the degree to which the ..."
Abstract
- Add to MetaCart
of reasoning in the Descrip-tion Logic τEL(deg), which extends EL by threshold concepts defined using deg. We also compare the instance problem for threshold concepts of the form C>t in τEL(deg) with the relaxed instance queries of Ecke et al. 1
Reasoning in Expressive Description Logics under Infinitely Valued Gödel Semantics?
"... Abstract. Fuzzy Description Logics (FDLs) combine classical Descrip-tion Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0, 1] have been shown to be undecidable in the presence of a negation constructor ..."
Abstract
- Add to MetaCart
Abstract. Fuzzy Description Logics (FDLs) combine classical Descrip-tion Logics with the semantics of Fuzzy Logics in order to represent and reason with vague knowledge. Most FDLs using truth values from the interval [0, 1] have been shown to be undecidable in the presence of a negation constructor
Results 1 - 10
of
391
