Jia-Huai You

Orcid: 0000-0001-9372-4371

Affiliations:
  • University of Alberta, Edmonton, Canada


According to our database1, Jia-Huai You authored at least 149 papers between 1984 and 2024.

Collaborative distances:

Timeline

1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
1
1
1
1
3
2
2
1
1
3
1
4
2
2
1
2
2
1
2
1
2
4
2
1
1
1
1
1
2
1
2
1
1
1
2
1
1
2
3
2
3
1
2
3
4
2
4
3
1
3
3
4
5
2
1
1
1
2
1
6
3
3
3
2
3
3
4
3
3
2
2

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Foundations of Conflict-Driven Solving for Hybrid MKNF Knowledge Bases.
CoRR, 2024

Exploring Conflict Generating Decisions: Initial Results (Extended Abstract).
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Adapting Approximation Fixpoint Theory to Nondeterministic Hybrid Reasoning.
Proceedings of the Workshop Proceedings of the 40th International Conference on Logic Programming (ICLP-WS 2024) co-located with the 40th International Conference on Logic Programming (ICLP 2024), 2024

2023
Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems.
CoRR, 2023

Expanding the Class of Polynomial Time Computable Well-Founded Semantics for Hybrid MKNF.
Proceedings of the International Conference on Logic Programming 2023 Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023), 2023

2022
Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT.
Theory Pract. Log. Program., 2022

A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases.
Proceedings of the Proceedings 38th International Conference on Logic Programming, 2022

2021
Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation.
Theory Pract. Log. Program., 2021

Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions.
New Gener. Comput., 2021

A Deep Dive into Conflict Generating Decisions.
CoRR, 2021

Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Fixpoint Characterizations of Disjunctive Hybrid MKNF Knowledge Bases.
Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021), 2021

2020
Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies.
Proceedings of the Rules and Reasoning - 4th International Joint Conference, 2020

Guiding CDCL SAT Search via Random Exploration amid Conflict Depression.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Towards Universal Languages for Tractable Ontology Mediated Query Answering.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Domain-Independent Cost-Optimal Planning in ASP.
Theory Pract. Log. Program., 2019

Mutex Graphs and Multicliques: Reducing Grounding Size for Planning.
Proceedings of the Proceedings 35th International Conference on Logic Programming (Technical Communications), 2019

Characterization of Glue Variables in CDCL SAT Solving.
CoRR, 2019

Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics.
Proceedings of the Principles and Practice of Constraint Programming, 2019

2018
Restricted Chase Termination: A Hierarchical Approach and Experimentation.
Proceedings of the Rules and Reasoning - Second International Joint Conference, 2018

Three-Valued Semantics for Hybrid MKNF Knowledge Bases Revisited (Extended Abstract).
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Preliminary Results on Exploration-Driven Satisfiability Solving.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Well-founded operators for normal hybrid MKNF knowledge bases.
Theory Pract. Log. Program., 2017

Three-valued semantics for hybrid MKNF knowledge bases revisited.
Artif. Intell., 2017

Beyond Skolem Chase: A Study of Finite Chase under Standard Chase Variant.
Proceedings of the 30th International Workshop on Description Logics, 2017

2016
Expressive Completeness of Existential Rule Languages for Ontology-Based Query Answering.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Flexible Approximators for Approximating Fixpoint Theory.
Proceedings of the Advances in Artificial Intelligence, 2016

2015
Survey of Large-Scale Data Management Systems for Big Data Applications.
J. Comput. Sci. Technol., 2015

A Demonstration of Rubato DB: A Highly Scalable NewSQL Database System for OLTP and Big Data Applications.
Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31, 2015

On Forgetting Postulates in Answer Set Programming.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Existential Rule Languages with Finite Chase: Complexity and Expressiveness.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
A Well-Founded Semantics for FOL-Programs.
CoRR, 2014

A Generalization of Approximation Fixpoint Theory and Application.
Proceedings of the Web Reasoning and Rule Systems - 8th International Conference, 2014

Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

Rubato DB: A Highly Scalable Staged Grid Database System for OLTP and Big Data Applications.
Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, 2014

BASIC: An alternative to BASE for large-scale data management system.
Proceedings of the 2014 IEEE International Conference on Big Data (IEEE BigData 2014), 2014

2013
Disjunctive logic programs with existential quantification in rule heads.
Theory Pract. Log. Program., 2013

Relating weight constraint and aggregate programs: Semantics and representation.
Theory Pract. Log. Program., 2013

Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms.
Theory Pract. Log. Program., 2013

Eliminating Nonmonotonic DL-Atoms in Description Logic Programs.
Proceedings of the Web Reasoning and Rule Systems - 7th International Conference, 2013

Embedding Functions into Disjunctive Logic Programs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

2012
The loop formula based semantics of description logic programs.
Theor. Comput. Sci., 2012

SAT with Global Constraints.
Proceedings of the IEEE 24th International Conference on Tools with Artificial Intelligence, 2012

Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Well-Supported Semantics for Logic Programs with Generalized Rules.
Proceedings of the Correct Reasoning, 2012

A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
On Pruning for Top-K Ranking in Uncertain Databases.
Proc. VLDB Endow., 2011

Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs.
Fundam. Informaticae, 2011

Embedding Description Logic Programs into Default Logic
CoRR, 2011

On the semantics of top-<i>k</i> ranking for objects with uncertain data.
Comput. Math. Appl., 2011

Compiling Answer Set Programs into Event-Driven Action Rules.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Strong Equivalence of Logic Programs with Abstract Constraint Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2011

Integrating Rules and Description Logics by Circumscription.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Loop formulas for description logic programs.
Theory Pract. Log. Program., 2010

Weight constraint programs with evaluable functions.
Ann. Math. Artif. Intell., 2010

Top-k ranking for uncertain data.
Proceedings of the Seventh International Conference on Fuzzy Systems and Knowledge Discovery, 2010

2009
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms.
Theory Pract. Log. Program., 2009

Logic Programs, Compatibility and Forward Chaining Construction.
J. Comput. Sci. Technol., 2009

Towards an Embedded Approach to Declarative Problem Solving in ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Weight Constraint Programs with Functions.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

A Default Approach to Semantics of Logic Programs with Constraint Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008
Reconstructing phylogenies from noisy quartets in polynomial time with a high success probability.
Algorithms Mol. Biol., 2008

Lparse Programs Revisited: Semantics and Representation of Aggregates.
Proceedings of the Logic Programming, 24th International Conference, 2008

Loop Formulas for Logic Programs with Arbitrary Constraint Atoms.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Abductive Logic Programming by Nonground Rewrite Systems.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Recycling computed answers in rewrite systems for abduction.
ACM Trans. Comput. Log., 2007

Quartet-Based Phylogeny Reconstruction with Answer Set Programming.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

On the Effectiveness of Looking Ahead in Search for Answer Sets.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Adaptive Lookahead for Answer Set Computation.
Proceedings of the 19th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2007), 2007

A Generalized Gelfond-Lifschitz Transformation for Logic Programs with Abstract Constraints.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Unfolding partiality and disjunctions in stable model semantics.
ACM Trans. Comput. Log., 2006

A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors.
Inf. Process. Lett., 2006

2005
Deriving a Stationary Dynamic Bayesian Network from a Logic Program with Recursive Loops
CoRR, 2005

A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005

Lookahead in Smodels Compared to Local Consistencies in CSP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

Application of Smodels in Quartet Based Phylogeny Construction.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

A Polynomial Algorithm for the Minimum Quartet Inconsistency Problem with O(n) Quartet Errors.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

Faster solution to the maximum quartet consistency problem with constraint programming.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

2004
Enhancing global SLS-resolution with loop cutting and tabling mechanisms.
Theor. Comput. Sci., 2004

Iterated Belief Change.
Comput. Intell., 2004

Arc-Consistency + Unit Propagation = Lookahead.
Proceedings of the Logic Programming, 20th International Conference, 2004

Adding Domain Dependent Knowledge into Answer Set Programs for Planning.
Proceedings of the Logic Programming, 20th International Conference, 2004

2003
A dynamic approach to characterizing termination of general logic programs.
ACM Trans. Comput. Log., 2003

On the Equivalence between Answer Sets and Models of Completion for Nested Logic Programs.
Proceedings of the IJCAI-03, 2003

2002
SLT-Resolution for the Well-Founded Semantics.
J. Autom. Reason., 2002

Abduction in logic programming: A new definition and an abductive procedure based on rewriting.
Artif. Intell., 2002

Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison.
Proceedings of the Advances in Artificial Intelligence, 2002

2001
Linear tabulated resolution based on Prolog control strategy.
Theory Pract. Log. Program., 2001

Nonmonotonic Reasoning as Prioritized Argumentation.
IEEE Trans. Knowl. Data Eng., 2001

Loop checks for logic programs with functions.
Theor. Comput. Sci., 2001

Implementation of a Linear Tabling Mechanism.
J. Funct. Log. Program., 2001

2000
An abductive approach to disjunctive logic programming.
J. Log. Program., 2000

Verifying Termination of General Logic Programs with Concrete Queries
CoRR, 2000

Unfolding Partiality and Disjunctions in Stable Model Semantics.
Proceedings of the KR 2000, 2000

1999
Compiling Defeasible Inheritance Networks to General Logic Programs.
Artif. Intell., 1999

Linear Tabulated Resolutions for the Well-Founded Semantics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

A Linear Tabling Mechanism.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

1998
Coherence Approach to Logic Program Revision.
IEEE Trans. Knowl. Data Eng., 1998

Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure.
Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997
On Confluence Property of Active Databases with Meta-Rules.
Proceedings of the Rules in Database Systems, Third International Workshop, 1997

Disjunctive Logic Programming and Autoepistemic Logic.
Proceedings of the Logic Programming and Knowledge Representation, 1997

A Default Interpretation of Defeasible Network.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Disjunctive Logic Programming as Constrained Inferences.
Proceedings of the Logic Programming, 1997

An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

Disjunctive Logic Programming and Possible Model Semantics (Invited Paper).
Proceedings of the Agents and Multi-Agent Systems Formalisms, 1997

1996
Iterative Belief Revision in Extended Logic Programming.
Theor. Comput. Sci., 1996

A framework for learning constraints: Preliminary report.
Proceedings of the Learning and Reasoning with Complex Representations, 1996

Nonmonotonic Reasoning by Monotonic Inference with Priority Constraints.
Proceedings of the Non-Monotonic Extensions of Logic Programming, 1996

Circumscription by Inference Rules with Priority.
Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995
On the Equivalence of Semantics for Normal Logic Programs.
J. Log. Program., 1995

An Introspective Framework for Paraconsistent Logic Programs.
Proceedings of the Logic Programming, 1995

On the Extension of Logic Programming with Negation through Uniform Proofs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

An Introspective Framework for Paraconsistent Logic Programs and Disjunctive Databases.
Proceedings of the Deductive Databases and Logic Programming, 1995

1994
A Three-Valued Semantics for Deductive Databases and Logic Programs.
J. Comput. Syst. Sci., 1994

A Simple but Effective Program Revision Method.
Proceedings of the Logic Programming, 1994

Tractable Argumentation Semantics via Iterative Belief Revision.
Proceedings of the Logic Programming, 1994

Logic Programming with Assumption Denials.
Proceedings of the Non-Monotonic Extensions of Logic Programming (NMELP'94), 1994

1993
Conflict-Free Routing for BPC-Permutations on Synchronous Hupercubes.
Parallel Comput., 1993

Autoepistemic Circumscription and Logic Programming.
J. Autom. Reason., 1993

Contradiction Resolving for Extended Logic Programs and Default Theories.
Proceedings of the Logic Programming, 1993

Knowledge Base Revision Using Circumscription.
Proceedings of the Deductive and Object-Oriented Databases, Third International Conference, 1993

1992
An Implementation of a Nonlinear Skewing Scheme.
Inf. Process. Lett., 1992

The Odd-Even Expansion Storage Scheme and Its Implementation Issues.
Proceedings of the 6th International Parallel Processing Symposium, 1992

On storage schemes for parallel array access.
Proceedings of the 6th international conference on Supercomputing, 1992

Conflict-Free Routing on Hypercubes.
Proceedings of the Computing and Information, 1992

1991
Unification Modulo an Equality Theory for Equational Logic Programming.
J. Comput. Syst. Sci., 1991

Making default inferences from logic programs.
Comput. Intell., 1991

Realizing Frequently Used Permutations on Syncube.
Proceedings of the International Conference on Parallel Processing, 1991

A Proof-Theoretic Framework for Nonmonotonic Reasoning and Logic Programming.
Proceedings of the Advances in Computing and Information, 1991

Increasing Communication Bandwidth on Hypercube.
Proceedings of the Advances in Computing and Information, 1991

1990
Dynamic load-balancing on a parallel inference system.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Three-Valued Formalization of Logic Programming: Is It Needed?
Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

Finding the Shortest Path in ESMSS Network.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

Discriminant Circumscription.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989
Enumarating Outer Narrowing Derivations for Constructor-Based Term Rewriting Systems.
J. Symb. Comput., 1989

Supported Circumscription and Its Relation to Logic Programming with Negation.
Proceedings of the Logic Programming, 1989

On the Completeness of Narrowing for E-Unification.
Proceedings of the Knowledge Based Computer Systems, 1989

A new intelligent backtracking scheme for Prolog: a summary of results.
Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989

1988
Outer Narrowing for Equational Theories Based on Constructors.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Parallelism in Nonmonotonic Multiple Inheritance Systems.
Proceedings of the AI '88: 2nd Australian Joint Artificial Intelligence Conference, 1988

Solving Equations in an Equational Language.
Proceedings of the Algebraic and Logic Programming, 1988

1986
A Class of Confluent Term Rewriting Systems and Unification.
J. Autom. Reason., 1986

Equational Logic Programming: An Extension to Equational Programming.
Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

E-Unification Algorithms for a Class of Confluent Term Rewriting Systems.
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986

FUNLOG: A Computational Model Integrating Logic Programming and Functional Programming.
Proceedings of the Logic Programming: Functions, Relations, and Equations, 1986

1984
On Embedding Functions in Logic.
Inf. Process. Lett., 1984

Conceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming.
Proceedings of the 1984 International Symposium on Logic Programming, 1984

Pattern Driven Lazy Reduction: A Unifying Evaluation Mechanism for Functional and Logic Programs.
Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984


  Loading...