Li-Yan Yuan

Affiliations:
  • University of Alberta, Edmonton, Canada


According to our database1, Li-Yan Yuan authored at least 77 papers between 1985 and 2015.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

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

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

2011
On Pruning for Top-K Ranking in Uncertain Databases.
Proc. VLDB Endow., 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

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

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

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

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

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

2004
Enhancing global SLS-resolution with loop cutting and tabling mechanisms.
Theor. Comput. Sci., 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

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

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
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
First-Order Logic Characterization of Program Properties.
IEEE Trans. Knowl. Data Eng., 1994

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

Autoepistemic Logic of First Order and Its Expressive Power.
J. Autom. Reason., 1994

Logic Program Semantics and Circumscription of Autoepistemic Theories.
Inf. Process. Lett., 1994

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

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

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
Design of Desirable Relational Database Schemes.
J. Comput. Syst. Sci., 1992

Unifying functional and multivalued dependencies for relational database design.
Inf. Sci., 1992

Preservation of Integrity Constraints in Definite DATALOG Programs.
Inf. Process. Lett., 1992

Enforce Constraints in Archival Databases.
Proceedings of the Computing and Information, 1992

1991
Extended Well-Founded Model Semantics for General Logic Programs.
Proceedings of the Logic Programming, 1991

First-Order Logic Reducible Programs.
Proceedings of the Seventh International Conference on Data Engineering, 1991

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

On Semantics, Syntactics and Fixpoints of General Programs.
Proceedings of the Advances in Computing and Information, 1991

Incremental Database Design Revisited.
Proceedings of the Advances in Computing and Information, 1991

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

The Revised Gärdenfors Postulates and Update Semantics.
Proceedings of the ICDT'90, 1990

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

1989
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

1988
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values.
Proceedings of the 1988 ACM SIGMOD International Conference on Management of Data, 1988

On Reducing Parallel Circumscription.
Proceedings of the 7th National Conference on Artificial Intelligence, 1988

1987
Reduced MVDs and Minimal Covers.
ACM Trans. Database Syst., 1987

A New Normal Form for Nested Relations.
ACM Trans. Database Syst., 1987

Logical Design of Relational Database Systems.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

On the Normalization in Nested Relational Databases.
Proceedings of the Nested Relations and Complex Objects, 1987

A Design Method for Nested Relational Databases.
Proceedings of the Third International Conference on Data Engineering, 1987

1986
Notions of Dependency Preservation for Nested Relations.
Proceedings of the XP / 7.52 Workshop on Database Theory, 1986

A design method for nested relations (abstract).
Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

1985
A Normal Form for Nested Relations.
Proceedings of the Fourth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1985


  Loading...