47 citations · 63 across the 21 of their papers we have counts for
18 papers · 1 filter
Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems
Spencer Killen, Jia-Huai You
A wide variety of nonmonotonic semantics can be expressed as approximators defined under AFT (Approximation Fixpoint Theory). Using traditional AFT theory, it is not possible to de…
A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
Spencer Killen, Jia-Huai You
The logic of hybrid MKNF (minimal knowledge and negation as failure) is a powerful knowledge representation language that elegantly pairs ASP (answer set programming) with ontologi…
A Deep Dive into Conflict Generating Decisions
Md Solimul Chowdhury, Martin Müller, Jia You
Boolean Satisfiability (SAT) is a well-known NP-complete problem. Despite this theoretical hardness, SAT solvers based on Conflict Driven Clause Learning (CDCL) can solve large SAT…
Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
Fangfang Liu, Jia-huai You
Approximation fixpoint theory (AFT) provides an algebraic framework for the study of fixpoints of operators on bilattices and has found its applications in characterizing semantics…
Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases
Spencer Killen, Jia-Huai You
Combining the closed-world reasoning of answer set programming (ASP) with the open-world reasoning of ontologies broadens the space of applications of reasoners. Disjunctive hybrid…
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…
Mutex Graphs and Multicliques: Reducing Grounding Size for Planning
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. These are the types of constraints that specify the exclusion of…
Domain-Independent Cost-Optimal Planning in ASP
David Spies, Jia-Huai You, Ryan Hayward
We investigate the problem of cost-optimal planning in ASP. Current ASP planners can be trivially extended to a cost-optimal one by adding weak constraints, but only for a given ma…
Characterization of Glue Variables in CDCL SAT Solving
Md Solimul Chowdhury, Martin Müller, Jia-Huai You
A state-of-the-art criterion to evaluate the importance of a given learned clause is called Literal Block Distance (LBD) score. It measures the number of distinct decision levels i…
Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases
Jianmin Ji, Fangfang Liu, Jia-Huai You
Hybrid MKNF knowledge bases have been considered one of the dominant approaches to combining open world ontology languages with closed world rule-based languages. Currently, the on…
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…
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…
Embedding Description Logic Programs into Default Logic
Yisong Wang, Jia-Huai You, Li Yan Yuan +2
Description logic programs (dl-programs) under the answer set semantics formulated by Eiter {\em et al.} have been considered as a prominent formalism for integrating rules and ont…
Recycling Computed Answers in Rewrite Systems for Abduction
Fangzhen Lin, Jia-Huai You
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanati…
Unfolding Partiality and Disjunctions in Stable Model Semantics
T. Janhunen, I. Niemela, D. Seipel +2
The paper studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementat…
Verifying Termination of General Logic Programs with Concrete Queries
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
We introduce a method of verifying termination of logic programs with respect to concrete queries (instead of abstract query patterns). A necessary and sufficient condition is esta…
Linear Tabulated Resolution Based on Prolog Control Strategy
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You +1
Infinite loops and redundant computations are long recognized open problems in Prolog. Two ways have been explored to resolve these problems: loop checking and tabling. Loop checki…
SLT-Resolution for the Well-Founded Semantics
Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You
Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics of general logic programs. Global SLS-resolution is…