Sciweavers

408 search results - page 38 / 82
» Reasoning with Very Expressive Fuzzy Description Logics
Sort
View
LPNMR
2001
Springer
14 years 2 days ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
JCP
2008
104views more  JCP 2008»
13 years 7 months ago
Trusted Decision Mechanism Based on Fuzzy Logic for Open Network
Trust mechanism will be an important trend in the field of security for open network. But, as an important factor risk is little considered in trust model. In this paper, Further w...
Lin Zhang, Ruchuan Wang, Haiyan Wang
ECAI
1998
Springer
13 years 11 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
ASWC
2006
Springer
13 years 11 months ago
Modular Ontologies - A Formal Investigation of Semantics and Expressivity
With the growing interest in modular ontology languages to address the need for collaborative development, integration, and use of ontologies on the Web, there is an urgent need fo...
Jie Bao, Doina Caragea, Vasant Honavar
JACM
2010
137views more  JACM 2010»
13 years 6 months ago
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual...
Boris Motik, Riccardo Rosati