1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.AI2018
Loop Restricted Existential Rules and First-order Rewritability for Query Answering
Vernon Asuncion, Yan Zhang, Heng Zhang +2
In ontology-based data access (OBDA), the classical database is enhanced with an ontology in the form of logical assertions generating new intensional knowledge. A powerful form of…
cs.AI2016
Query Answering with Inconsistent Existential Rules under Stable Model Semantics
Hai Wan, Heng Zhang, Peng Xiao +2
Traditional inconsistency-tolerent query answering in ontology-based data access relies on selecting maximal components of an ABox/database which are consistent with the ontology.…
cs.AI2013★ 1 cited
Disjunctive Logic Programs versus Normal Logic Programs
Heng Zhang, Yan Zhang
This paper focuses on the expressive power of disjunctive and normal logic programs under the stable model semantics over finite, infinite, or arbitrary structures. A translation f…