Sciweavers

496 search results - page 36 / 100
» Practical Reasoning for Very Expressive Description Logics
Sort
View
LPNMR
2001
Springer
15 years 2 months 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
ECAI
1998
Springer
15 years 1 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
15 years 1 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»
14 years 8 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
ESWS
2007
Springer
15 years 3 months ago
Algorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuraci...
Yue Ma, Pascal Hitzler, Zuoquan Lin