activity
20142026
most citedExpressive Completeness of Existential Rule Languages for Ontology-based Query Answering

5 citations · 11 across the 9 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2024

A Theory of Formalisms for Representing Knowledge

Heng Zhang, Guifei Jiang, Donghui Quan

There has been a longstanding dispute over which formalism is the best for representing knowledge in AI. The well-known "declarative vs. procedural controversy" is concerned with t…

cs.AI2020★ 2 cited

Model-theoretic Characterizations of Existential Rule Languages

Heng Zhang, Yan Zhang, Guifei Jiang

Existential rules, a.k.a. dependencies in databases, and Datalog+/- in knowledge representation and reasoning recently, are a family of important logical languages widely used in c…

cs.AI2019★ 1 cited

Towards Universal Languages for Tractable Ontology Mediated Query Answering

Heng Zhang, Yan Zhang, Jia-Huai You +2

An ontology language for ontology mediated query answering (OMQA-language) is universal for a family of OMQA-languages if it is the most expressive one among this family. In this p…

cs.AI2016★ 5 cited

Expressive Completeness of Existential Rule Languages for Ontology-based Query Answering

Heng Zhang, Yan Zhang, Jia-Huai You

Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering. In this pape…

cs.AI2014

Existential Rule Languages with Finite Chase: Complexity and Expressiveness

Heng Zhang, Yan Zhang, Jia-Huai You

Finite chase, or alternatively chase termination, is an important condition to ensure the decidability of existential rule languages. In the past few years, a number of rule langua…