-
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...
-
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
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
We study logic programs with arbitrary abstract constraint atoms, called c-atoms. As a theoretical means to analyze program properties, we investigate the possibility of unfolding these programs to logic programs...
-
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
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, ...
-
Article
SLT-Resolution for the Well-Founded Semantics
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 linear for query evaluation ...
-
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
Linear Tabulated Resolution for the Well-Founded Semantics
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 linear but suffers from infi...
-
Chapter and Conference Paper
Disjunctive logic programming and autoepistemic logic
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different types of negative introspection i...
-
Chapter and Conference Paper
Disjunctive logic programming and possible model semantics
We use Kripke structures of autoepistemic logic to classify various semantics for disjunctive logic programs with default negation. We have observed that nonmonotonic reasoning can be characterized by Kripke s...
-
Chapter and Conference Paper
On confluence property of active databases with meta-rules
An active database consists of a collection of event-conditionaction rules (or ECA-rules), some meta rules that specify the desired interactions and constraints for the execution of finable rules, and a tradit...
-
Chapter and Conference Paper
An abductive semantics for disjunctive logic programs and its proof procedure
While it is well-known how normal logic programs may be viewed as a form of abduction and argumentation, the problem of how disjunctive programs may be used for abductive reasoning is rarely discussed. In this...
-
Chapter and Conference Paper
Nonmonotonic reasoning by monotonic inferences with priority constraints
The purpose of this paper is to argue that nonmonotonic reasoning in general can be viewed as monotonic inferences constrained by a simple notion of priority constraint. More important, these type of constrain...
-
Chapter and Conference Paper
Logic programming with assumption denial
We present a framework of logic programming using an explicit representation of defeats of assumptions, called assumption denials. We study semantics for extended, disjunctive, and extended disjunctive programs, ...
-
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...
-
Article
Autoepistemic logic of first order and its expressive power
We study the expressive power of first-order autoepistemic logic. We argue that full introspection of rational agents should be carried out by minimizing positive introspection and maximizing negative introspe...
-
Article
Autoepistemic circumscription and logic programming
We propose a framework of autoepistemic reasoning in which the underlying semantics is determined by the choice of a nonmonotonic inference mechanism and by specifying abelief constraint. While the latter makes t...
-
Chapter and Conference Paper
Knowledge base revision using circumscription
In this paper we present a framework of retrospective reasoning to deal with the belief revision problem in knowledge systems. First, a first-order knowledge base is represented by a set of formulas in a first or...
-
Chapter and Conference Paper
A proof-theoretic framework for nonmonotonic reasoning and logic programming
This paper proposes a general proof-theoretic framework, where negative literals in a query are proved by a new mechanism of negation-as-failure. This new mechanism handles nonground negative literals and thus...
-
Chapter and Conference Paper
On semantics, syntactics and fixpoints of general programs
In this paper, we extend the unified view of logic programs, characterized by van Emden and Kowalski, in terms of semantics, syntactics, and fixpoints into the context of general programs. We first propose a g...
