scholarly journals Dually Structured Concepts in the Semantic Web: Answer Set Programming Approach

2005 ◽  
pp. 377-391
Author(s):  
Patryk Burek ◽  
Rafał Graboś
Keyword(s):  
Semantic Web ◽  
Answer Set Programming ◽  
Programming Approach ◽  
Web Answer ◽  
Answer Set

scholarly journals An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework

2020 ◽  
Author(s):  
Tuomo Lehtonen ◽  
Johannes P. Wallner ◽  
Matti Järvisalo
Keyword(s):  
Answer Set Programming ◽  
Research Direction ◽  
Programming Approach ◽  
Computational Techniques ◽  
Major Research ◽  
Structured Argumentation ◽  
Algorithmic Techniques ◽  
Argumentative Reasoning ◽  
Significant Size ◽  
Answer Set

A major research direction in AI argumentation is the study and development of practical computational techniques for reasoning in different argumentation formalisms. Compared to abstract argumentation, developing algorithmic techniques for different structured argumentation formalisms, such as assumption-based argumentation and the general ASPIC+ framework, is more challenging. At present, there is a lack of efficient approaches to reasoning in ASPIC+. We develop a direct declarative approach based on answer set programming (ASP) to reasoning in an instantiation of the ASPIC+ framework. We establish formal foundations for direct declarative encodings for reasoning in ASPIC+ without preferences for several central argumentation semantics, and detail ASP encodings of semantics for which reasoning about acceptance is NP-hard in ASPIC+. Empirically, the ASP approach scales up to frameworks of significant size, thereby answering the current lack of practical computational approaches to reasoning in ASPIC+ and providing a promising base for capturing further generalizations within ASPIC+.

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 Semantic-based construction of arguments: An answer set programming approach

2015 ◽  
Vol 64 ◽  
pp. 54-74 ◽  
Author(s):  
Esteban Guerrero ◽  
Juan Carlos Nieves ◽  
Helena Lindgren
Keyword(s):  
Answer Set Programming ◽  
Programming Approach ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document