scholarly journals A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web

2010 ◽  
Vol 22 (11) ◽  
pp. 1577-1592 ◽  
Author(s):  
Thomas Lukasiewicz
Keyword(s):  
Semantic Web ◽  
Description Logics ◽  
Answer Set Programming ◽  
Answer Set

scholarly journals Combining answer set programming with description logics for the Semantic Web

2008 ◽  
Vol 172 (12-13) ◽  
pp. 1495-1539 ◽  
Author(s):  
Thomas Eiter ◽  
Giovambattista Ianni ◽  
Thomas Lukasiewicz ◽  
Roman Schindlauer ◽  
Hans Tompits
Keyword(s):  
Semantic Web ◽  
Description Logics ◽  
Answer Set Programming ◽  
Answer Set

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.

scholarly journals An ASP approach for reasoning in a concept-aware multipreferential lightweight DL

2020 ◽  
Vol 20 (5) ◽  
pp. 751-766 ◽  
Author(s):  
Laura Giordano ◽  
Daniele Theseider Dupré
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Answer Set Programming ◽  
Defeasible Reasoning ◽  
Preferential Semantics ◽  
Answer Set ◽  
Qualitative Preferences

AbstractIn this paper we develop a concept aware multi-preferential semantics for dealing with typicality in description logics, where preferences are associated with concepts, starting from a collection of ranked TBoxes containing defeasible concept inclusions. Preferences are combined to define a preferential interpretation in which defeasible inclusions can be evaluated. The construction of the concept-aware multipreference semantics is related to Brewka’s framework for qualitative preferences. We exploit Answer Set Programming (in particular, asprin) to achieve defeasible reasoning under the multipreference approach for the lightweight description logic ξ$\mathcal L_ \bot ^ + $.

scholarly journals Open answer set programming for the semantic web

2007 ◽  
Vol 5 (1) ◽  
pp. 144-169 ◽  
Author(s):  
Stijn Heymans ◽  
Davy Van Nieuwenborgh ◽  
Dirk Vermeir
Keyword(s):  
Semantic Web ◽  
Answer Set Programming ◽  
Answer Set
Sign in / Sign up

Export Citation Format

Share Document