scholarly journals Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

2008 ◽  
Vol 55 (3-4) ◽  
pp. 389-417 ◽  
Author(s):  
Yann Loyer ◽  
Umberto Straccia
Keyword(s):  
Query Answering ◽  
Logic Programs ◽  
Normal Logic

scholarly journals Query Answering with Guarded Existential Rules under Stable Model Semantics

2020 ◽  
Vol 34 (03) ◽  
pp. 3017-3024
Author(s):  
Hai Wan ◽  
Guohui Xiao ◽  
Chenglin Wang ◽  
Xianqiao Liu ◽  
Junhong Chen ◽  
...  
Keyword(s):  
Answer Set Programming ◽  
Query Answering ◽  
Prototype System ◽  
Stable Model ◽  
Logic Programs ◽  
Termination Problem ◽  
Answer Set

In this paper, we study the problem of query answering with guarded existential rules (also called GNTGDs) under stable model semantics. Our goal is to use existing answer set programming (ASP) solvers. However, ASP solvers handle only finitely-ground logic programs while the program translated from GNTGDs by Skolemization is not in general. To address this challenge, we introduce two novel notions of (1) guarded instantiation forest to describe the instantiation of GNTGDs and (2) prime block to characterize the repeated infinitely-ground program translated from GNTGDs. Using these notions, we prove that the ground termination problem for GNTGDs is decidable. We also devise an algorithm for query answering with GNTGDs using ASP solvers. We have implemented our approach in a prototype system. The evaluation over a set of benchmarks shows encouraging results.

On a Logical Basis of Normal Logic Programs

1996 ◽  
Vol 28 (3,4) ◽  
pp. 223-245 ◽  
Author(s):  
Alexander Bochman
Keyword(s):  
Logic Programs ◽  
Logical Basis ◽  
Normal Logic
Sign in / Sign up

Export Citation Format

Share Document