scholarly journals The Expressive Powers of the Logic Programming Semantics

1995 ◽  
Vol 51 (1) ◽  
pp. 64-86 ◽  
Author(s):  
J.S. Schlipf
Keyword(s):  
Logic Programming ◽  
Programming Semantics

scholarly journals Multi-valued logic programming semantics an algebraic approach

1997 ◽  
Vol 171 (1-2) ◽  
pp. 77-109 ◽  
Author(s):  
Bamshad Mobasher ◽  
Don Pigozzi ◽  
Giora Slutzki
Keyword(s):  
Logic Programming ◽  
Algebraic Approach ◽  
Programming Semantics

A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory

2011 ◽  
Vol 106 (2-4) ◽  
pp. 295-319 ◽  
Author(s):  
Juan Carlos Nieves ◽  
Mauricio Osorio ◽  
Claudia Zepeda
Keyword(s):  
Logic Programming ◽  
Relevant Logic ◽  
Argumentation Theory ◽  
Programming Semantics

scholarly journals Comparing logic programming and formal argumentation; the case of ideal and eager semantics

2021 ◽  
pp. 1-28
Author(s):  
Martin Caminada ◽  
Sri Harikrishnan ◽  
Samy Sá
Keyword(s):  
Logic Programming ◽  
Current Paper ◽  
Current Work ◽  
Logic Programs ◽  
Subsequent Work ◽  
Grounded Semantics ◽  
Programming Semantics

The connection between logic programming and formal argumentation has been studied starting from the landmark 1995 paper of Dung. Subsequent work has identified a standard translation from logic programs to (instantiated) argumentation frameworks, under which pairwise correspondences hold between various logic programming semantics and various formal argumentation semantics. This includes the correspondence between 3-valued stable and complete semantics, between well-founded and grounded semantics and between 2-valued stable (LP) and stable (argumentation) semantics. In the current paper, we show that the existing translation is able to yield the additional correspondence between ideal semantics for logic programming and ideal semantics for formal argumentation. We also show that correspondence does not hold between eager semantics for logic programming and eager semantics for formal argumentation, at least when translating from logic programming to formal argumentation. Overall, the current work should be seen as completing the analysis of correspondences between mainstream admissibility-based argumentation semantics and their logic programming counterparts.

Sign in / Sign up

Export Citation Format

Share Document