Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs

2005 ◽  
pp. 78-95 ◽  
Author(s):  
M. Homola
Keyword(s):  
Logic Programming ◽  
Dynamic Logic

scholarly journals Default Negation as Explicit Negation plus Update

2021 ◽  
Vol 27 (1) ◽  
pp. 64-81
Author(s):  
Reinhard Kahle
Keyword(s):  
Logic Programming ◽  
Dynamic Logic ◽  
Stable Model ◽  
Normal Logic ◽  
Explicit Negation

 We argue that under the stable model semantics default negation can be read as explicit negation with update. We show that dynamic logic programming which is based on default negation, even in the heads, can be interpreted in a variant of updates with explicit negation only. As corollaries, we get an easy description of default negation in generalized and normal logic programming where initially negated literals are updated. These results are discussed with respect to the understanding of negation in logic.

scholarly journals The Refined Extension Principle for Semantics of Dynamic Logic Programming

Studia Logica ◽  
2005 ◽  
Vol 79 (1) ◽  
pp. 7-32 ◽  
Author(s):  
José Júlio Alferes ◽  
Federico Banti ◽  
Antonio Brogi ◽  
João Alexandre Leite
Keyword(s):  
Logic Programming ◽  
Dynamic Logic ◽  
Extension Principle

scholarly journals On properties of update sequences based on causal rejection

2002 ◽  
Vol 2 (6) ◽  
pp. 711-767 ◽  
Author(s):  
THOMAS EITER ◽  
MICHAEL FINK ◽  
GIULIANA SABBATINI ◽  
HANS TOMPITS
Keyword(s):  
Logic Programming ◽  
Current Knowledge ◽  
Dynamic Logic ◽  
Theory Change ◽  
Nonmonotonic Reasoning ◽  
Knowledge Bases ◽  
Current Approach ◽  
Programming System ◽  
Logic Programs ◽  
Answer Set Semantics

In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new information is incorporated into the current knowledge base subject to a causal rejection principle, which enforces that, in case of conflicts between rules, more recent rules are preferred and older rules are overridden. Such a rejection principle is also exploited in other approaches to update logic programs, notably in the method of dynamic logic programming, due to Alferes et al.One of the central issues of this paper is a thorough analysis of various properties of the current approach, in order to get a better understanding of the inherent causal rejection principle. For this purpose, we review postulates and principles for update and revision operators which have been proposed in the area of theory change and nonmonotonic reasoning. Moreover, some new properties for approaches to updating logic programs are considered as well. Like related update approaches, the current semantics does not incorporate a notion of minimality of change, so we consider refinements of the semantics in this direction. We also investigate the relationship of our approach to others in more detail. In particular, we show that the current approach is semantically equivalent to inheritance programs, which have been independently defined by Buccafurri et al., and that it coincides with certain classes of dynamic logic programs. In view of this analysis, most of our results about properties of the causal rejection principle apply to each of these approaches as well. Finally, we also deal with computational issues. Besides a discussion on the computational complexity of our approach, we outline how the update semantics and its refinements can be directly implemented on top of existing logic programming systems. In the present case, we implemented the update approach using the logic programming system DLV.

Sign in / Sign up

Export Citation Format

Share Document