Characterizing Compatible View Updates in Syntactic Bidirectionalization

Author(s):  
Naoki Nishida ◽  
Germán Vidal
Keyword(s):  
2009 ◽  
pp. 2639-2642
Author(s):  
Yannis Velegrakis
Keyword(s):  

2012 ◽  
Vol 20 (1) ◽  
pp. 69-80 ◽  
Author(s):  
Sang B Yoo ◽  
Ki C Kim ◽  
Hyeong S Yoo

Author(s):  
Yannis Velegrakis
Keyword(s):  

2018 ◽  
pp. 3487-3491
Author(s):  
Yannis Velegrakis
Keyword(s):  

2003 ◽  
Vol 3 (6) ◽  
pp. 671-715 ◽  
Author(s):  
CHIAKI SAKAMA ◽  
KATSUMI INOUE

This paper introduces an abductive framework for updating knowledge bases represented by extended disjunctive programs. We first provide a simple transformation from abductive programs to update programs which are logic programs specifying changes on abductive hypotheses. Then, extended abduction, which was introduced by the same authors as a generalization of traditional abduction, is computed by the answer sets of update programs. Next, different types of updates, view updates and theory updates are characterized by abductive programs and computed by update programs. The task of consistency restoration is also realized as special cases of these updates. Each update problem is comparatively assessed from the computational complexity viewpoint. The result of this paper provides a uniform framework for different types of knowledge base updates, and each update is computed using existing procedures of logic programming.


Computer ◽  
1986 ◽  
Vol 19 (1) ◽  
pp. 63-73 ◽  
Author(s):  
Keller
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document