scholarly journals Well-founded semantics for description logic programs in the semantic web

2011 ◽  
Vol 12 (2) ◽  
pp. 1-41 ◽  
Author(s):  
Thomas Eiter ◽  
Giovambattista Ianni ◽  
Thomas Lukasiewicz ◽  
Roman Schindlauer
Keyword(s):  
Semantic Web ◽  
Description Logic ◽  
Logic Programs

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 Loop formulas for description logic programs

2010 ◽  
Vol 10 (4-6) ◽  
pp. 531-545 ◽  
Author(s):  
YISONG WANG ◽  
JIA-HUAI YOU ◽  
LI YAN YUAN ◽  
YI-DONG SHEN
Keyword(s):  
Semantic Web ◽  
Description Logic ◽  
Description Logics ◽  
Answer Set Programming ◽  
Desirable Property ◽  
Logic Programs ◽  
Alternative Semantics ◽  
Answer Set Semantics ◽  
Answer Sets ◽  
Answer Set

AbstractDescription Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logics, for the Semantic Web. In this paper, we generalize the notions of completion and loop formulas of logic programs to description logic programs and show that the answer sets of a dl-program can be precisely captured by the models of its completion and loop formulas. Furthermore, we propose a new, alternative semantics for dl-programs, called the canonical answer set semantics, which is defined by the models of completion that satisfy what are called canonical loop formulas. A desirable property of canonical answer sets is that they are free of circular justifications. Some properties of canonical answer sets are also explored.

Sign in / Sign up

Export Citation Format

Share Document