Logic programming semantics using a compact data structure

1986 ◽  
Author(s):  
M Fitting
Keyword(s):  
Data Structure ◽  
Logic Programming ◽  
Programming Semantics

scholarly journals Productive corecursion in logic programming

2017 ◽  
Vol 17 (5-6) ◽  
pp. 906-923 ◽  
Author(s):  
EKATERINA KOMENDANTSKAYA ◽  
YUE LI
Keyword(s):  
Data Structure ◽  
Logic Programming ◽  
State Of The Art ◽  
Logic Program ◽  
Stream Processing ◽  
The Internet ◽  
Logic Programs ◽  
Algorithmic Solution ◽  
Undecidable Property ◽  
Turing Complete

AbstractLogic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but equally fundamental and important undecidable property is productivity. If a derivation is infinite and coinductively sound, we may ask whether the computed answer it determines actually computes an infinite formula. If it does, the infinite computation is productive. This intuition was first expressed under the name of computations at infinity in the 80s. In modern days of the Internet and stream processing, its importance lies in connection to infinite data structure processing. Recently, an algorithm was presented that semi-decides a weaker property – of productivity of logic programs. A logic program is productive if it can give rise to productive derivations. In this paper, we strengthen these recent results. We propose a method that semi-decides productivity of individual derivations for regular formulae. Thus, we at last give an algorithmic counterpart to the notion of productivity of derivations in logic programming. This is the first algorithmic solution to the problem since it was raised more than 30 years ago. We also present an implementation of this algorithm.

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