Search Results for author: Jia-Huai You

Found 10 papers, 1 papers with code

Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems

no code implementations21 Jul 2023 Spencer Killen, Jia-Huai You

A wide variety of nonmonotonic semantics can be expressed as approximators defined under AFT (Approximation Fixpoint Theory).

Negation

A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases

no code implementations5 Aug 2022 Spencer Killen, Jia-Huai You

The question arises as to whether the semantics of disjunctive hybrid MKNF knowledge bases can be characterized using fixpoint constructions with head-cuts.

Negation

Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT

no code implementations24 May 2021 Fangfang Liu, Jia-Huai You

In this paper, we show one more application of this kind: the alternating fixpoint operator by Knorr et al. for the study of the well-founded semantics for hybrid MKNF knowledge bases is in fact an approximator of AFT in disguise, which, thanks to the power of abstraction of AFT, characterizes not only the well-founded semantics but also two-valued as well as three-valued semantics for hybrid MKNF knowledge bases.

Towards Universal Languages for Tractable Ontology Mediated Query Answering

no code implementations26 Nov 2019 Heng Zhang, Yan Zhang, Jia-Huai You, Zhiyong Feng, Guifei Jiang

On the negative side, we prove that there is, in general, no universal language for each of these families of languages.

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning

no code implementations18 Sep 2019 David Spies, Jia-Huai You, Ryan Hayward

We present an approach to representing large sets of mutual exclusions, also known as mutexes or mutex constraints.

Domain-Independent Cost-Optimal Planning in ASP

1 code implementation31 Jul 2019 David Spies, Jia-Huai You, Ryan Hayward

Experiments to compare the two approaches with the only known cost-optimal planner in SAT reveal good potentials for stepless planning in ASP.

Characterization of Glue Variables in CDCL SAT Solving

no code implementations25 Apr 2019 Md Solimul Chowdhury, Martin Müller, Jia-Huai You

We first show experimentally, by running the state-of-the-art CDCL SAT solver MapleLCMDist on benchmarks from SAT Competition-2017 and 2018, that branching decisions with glue variables are categorically more inference and conflict efficient than nonglue variables.

Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases

no code implementations6 Jul 2017 Jianmin Ji, Fangfang Liu, Jia-Huai You

In this paper, we address this problem by formulating the notion of unfounded sets for nondisjunctive hybrid MKNF knowledge bases, based on which we propose and study two new well-founded operators.

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

no code implementations18 Apr 2016 Heng Zhang, Yan Zhang, Jia-Huai You

In this paper, we prove that disjunctive embedded dependencies exactly capture the class of recursively enumerable ontologies in Ontology-based Conjunctive Query Answering (OCQA).

Existential Rule Languages with Finite Chase: Complexity and Expressiveness

no code implementations19 Nov 2014 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.