-
Article
Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions
Inductive logic programming (ILP) is a framework of learning logic programs from examples and background knowledge. In some real-world applications, we are particularly interested in learning aspects of system...
-
Chapter and Conference Paper
Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating Dependencies
We study the problem of distributed reasoning over connected database components with a class of ontologies based on disjunctive tuple-generating dependencies, called restricted weakly-linear disjunctive tuple...
-
Chapter and Conference Paper
Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
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 for various types of logic p...
-
Chapter and Conference Paper
Exploiting Glue Clauses to Design Effective CDCL Branching Heuristics
In conflict-directed clause learning (CDCL) SAT solving, a state-of-the-art criterion to measure the importance of a learned clause is called literal block distance (LBD), which is the number of distinct decisio...
-
Chapter and Conference Paper
Restricted Chase Termination: A Hierarchical Approach and Experimentation
The chase procedure for existential rules is an indispensable tool for several database applications, where its termination guarantees decidability of these tasks. Most previous studies have focused on the Sko...
-
Chapter and Conference Paper
Flexible Approximators for Approximating Fixpoint Theory
Approximation fixpoint theory (AFT) is an algebraic framework for the study of fixpoints of operators on bilattices, which has been applied to the study of the semantics for a number of nonmonotonic formalisms...
-
Chapter and Conference Paper
Polynomial Approximation to Well-Founded Semantics for Logic Programs with Generalized Atoms: Case Studies
The well-founded semantics of normal logic programs has two main utilities, one being an efficiently computable semantics with a unique intended model, and the other serving as polynomial time constraint propa...
-
Chapter and Conference Paper
A Generalization of Approximation Fixpoint Theory and Application
The approximation fixpoint theory (AFT) provides an algebraic framework for the study of fixpoints of operators on bilattices, and has been useful in dealing with semantics issues for various types of logic pr...
-
Chapter and Conference Paper
Embedding Functions into Disjunctive Logic Programs
We extend the notions of completion and loop formulas of normal logic programs with functions to a class of nested expressions that properly include disjunctive logic programs. We show that answer sets for suc...
-
Chapter and Conference Paper
Eliminating Nonmonotonic DL-Atoms in Description Logic Programs
Nonmonotonic description logic programs (dl-programs) are a well-known formalism for combining rules and ontologies, where rules interact with an underlying ontology via dl-atoms that allow queries to the onto...
-
Chapter
Well-Supported Semantics for Logic Programs with Generalized Rules
Logic programming under the stable model semantics has been extended to arbitrary formulas. A question of interest is how to characterize the property of well-supportedness, in the sense of Fages, which has be...
-
Chapter and Conference Paper
Compiling Answer Set Programs into Event-Driven Action Rules
This paper presents a compilation scheme, called ASP2AR, for translating ASP into event-driven action rules. For an ASP program, the generated program maintains a partial answer set as a pair of sets of tuples...
-
Chapter and Conference Paper
Strong Equivalence of Logic Programs with Abstract Constraint Atoms
Logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key propert...
-
Article
Weight constraint programs with evaluable functions
In the current practice of Answer Set Programming (ASP), evaluable functions are represented as special kinds of relations. This often makes the resulting program unnecessarily large when instantiated over a l...
-
Article
Logic Programs, Compatibility and Forward Chaining Construction
Logic programming under the stable model semantics is proposed as a non-monotonic language for knowledge representation and reasoning in artificial intelligence. In this paper, we explore and extend the notion...
-
Chapter and Conference Paper
Towards an Embedded Approach to Declarative Problem Solving in ASP
The strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches, SAT and Constraint ...
-
Chapter and Conference Paper
A Default Approach to Semantics of Logic Programs with Constraint Atoms
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the classical entailment relation, s...
-
Chapter and Conference Paper
Weight Constraint Programs with Functions
In this paper we consider a new class of logic programs, called weight constraint programs with functions, which are lparse programs incorporating functions over non-Herbrand domains. We define answer sets for...
-
Article
Open AccessReconstructing phylogenies from noisy quartets in polynomial time with a high success probability
In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accuracy of a phylogeny reconstruction method is...
-
Chapter and Conference Paper
Lparse Programs Revisited: Semantics and Representation of Aggregates
Lparse programs are logic programs with weight constraints as implemented in the smodels system, which constitute an important class of logic programs with constraint atoms. To effectively apply lparse programs t...
