Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

2009 ◽  
pp. 95-130 ◽  
Author(s):  
Andrea Calì ◽  
Thomas Lukasiewicz ◽  
Livia Predoiu ◽  
Heiner Stuckenschmidt
Keyword(s):  
Semantic Web ◽  
Description Logic ◽  
Logic Programs ◽  
Probabilistic Description ◽  
Tightly Coupled

scholarly journals Translating OWL and semantic web rules into prolog: Moving toward description logic programs

2008 ◽  
Vol 8 (3) ◽  
pp. 301-322 ◽  
Author(s):  
KEN SAMUEL ◽  
LEO OBRST ◽  
SUZETTE STOUTENBERG ◽  
KAREN FOX ◽  
PAUL FRANKLIN ◽  
...  
Keyword(s):  
Semantic Web ◽  
Knowledge Base ◽  
Automated Reasoning ◽  
Description Logic ◽  
Logic Programs ◽  
Dynamic Changes ◽  
General Rules ◽  
Alternative Approaches ◽  
Run Time

AbstractWe are researching the interaction between the rule and the ontology layers of the Semantic Web, by comparing two options: 1) using OWL and its rule extension SWRL to develop an integrated ontology/rule language, and 2) layering rules on top of an ontology with RuleML and OWL. Toward this end, we are developing the SWORIER system, which enables efficient automated reasoning on ontologies and rules, by translating all of them into Prolog and adding a set of general rules that properly capture the semantics of OWL. We have also enabled the user to make dynamic changes on the fly, at run time. This work addresses several of the concerns expressed in previous work, such as negation, complementary classes, disjunctive heads, and cardinality, and it discusses alternative approaches for dealing with inconsistencies in the knowledge base. In addition, for efficiency, we implemented techniques called extensionalization, avoiding reanalysis, and code minimization.

scholarly journals Tightly Coupled Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web

2010 ◽  
pp. 237-256 ◽  
Author(s):  
Thomas Lukasiewicz ◽  
Umberto Straccia
Keyword(s):  
Query Processing ◽  
Description Logic ◽  
Description Logics ◽  
Logic Programs ◽  
New Formalism ◽  
Disjunctive Logic Programs ◽  
Tightly Coupled ◽  
Answer Set Semantics ◽  
Fuzzy Description ◽  
Answer Set

This chapter presents a novel approach to fuzzy description logic programs (or simply fuzzy dl-programs) under the answer set semantics, which is a tight integration of fuzzy disjunctive logic programs under the answer set semantics with fuzzy description logics. From a different perspective, it is a generalization of tightly coupled disjunctive dl-programs by fuzzy vagueness in both the description logic and the logic program component. The authors show that the new formalism faithfully extends both fuzzy disjunctive logic programs and fuzzy description logics, and that under suitable assumptions, reasoning in the new formalism is decidable. The authors present a polynomial reduction of certain fuzzy dl-programs to tightly coupled disjunctive dl-programs, and we analyze the complexity of consistency checking and query processing for certain fuzzy dl-programs. Furthermore, the authors provide a special case of fuzzy dl-programs for which deciding consistency and query processing can both be done in polynomial time in the data complexity.

Sign in / Sign up

Export Citation Format

Share Document