21 Result(s)
-
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
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
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
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...
-
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...
-
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...
-
Chapter and Conference Paper
Application of Smodels in Quartet Based Phylogeny Construction
Evolution is an important sub-area of study in biological science, where given a set of taxa, the goal is to reconstruct their evolutionary history, or phylogeny. One very recent approach is to predict a local...
-
Chapter and Conference Paper
Lookahead in Smodels Compared to Local Consistencies in CSP
In answer set programming systems like Smodels and some SAT solvers, constraint propagation is carried out by a mechanism called lookahead. The question arises as what is the pruning power of lookahead, and ho...
-
Chapter and Conference Paper
Arc-Consistency + Unit Propagation = Lookahead
Arc-consistency has been one of the most popular consistency techniques for space pruning in solving constraint satisfaction problems (CSPs), while lookahead appears to be its counterp...
-
Chapter and Conference Paper
Adding Domain Dependent Knowledge into Answer Set Programs for Planning
We investigate the methodology of utilizing domain dependent knowledge in solving the planning problem in answer set programming. We provide a classification of domain dependent knowledge, and for each class, ...
-
Chapter and Conference Paper
Implementation of a Linear Tabling Mechanism
Delaying-based tabling mechanisms, such as the one adopted in XSB, are non-linear in the sense that the computation state of delayed calls has to be preserved. In this paper, we present the implementation of a...
-
Chapter and Conference Paper
On the extension of logic programming with negation through uniform proofs
In the past, logic program semantics have been studied often separately from the underlying proof system, and this, consequently, leads to a somewhat confusing status of semantics. In this paper we show that e...
-
Chapter and Conference Paper
Discriminant circumscription
We present a new circumscription method, called discriminant circumscription, for first order theories described by clauses whose orientations are of primary importance in their applications. These applications h...
-
Chapter and Conference Paper
Solving equations in an equational language
The problem of solving equations is a key and challenging problem in many formalisms of integrating logic and functional programming, while narrowing is now a widely used mechanism for generating solutions. In th...
