no code implementations • 21 Jul 2023 • Spencer Killen, Jia-Huai You
A wide variety of nonmonotonic semantics can be expressed as approximators defined under AFT (Approximation Fixpoint Theory).
no code implementations • 5 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.
no code implementations • 24 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.
no code implementations • 26 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.
no code implementations • 18 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.
1 code implementation • 31 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.
no code implementations • 25 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.
no code implementations • 6 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.
no code implementations • 18 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).
no code implementations • 19 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.