Results 1  10
of
105
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 312 (5 self)
 Add to MetaCart
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. The computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small subclass of the language called basic constraint rules is devised. An implementation of the language, the smodels system, is developed based on this embedding. It uses a two level architecture consisting of a frontend and a kernel language implementation. The frontend allows restricted use of variables and functions and compiles general weight constraint rules to basic constraint rules. A major part of the work is the development of an ecient search procedure for computing stable models for this kernel language. The procedure is compared with and empirically tested against satis ability checkers and an implementation of the stable model semantics. It offers a competitive implementation of the stable model semantics for normal programs and attractive performance for problems where the new types of rules provide a compact representation.
Smodels  an Implementation of the Stable Model and WellFounded Semantics for Normal Logic Programs
, 1997
"... The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range ..."
Abstract

Cited by 259 (10 self)
 Add to MetaCart
The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a rangerestricted functionfree normal program. The latter module does not produce the whole set of ground instances of the program but a subset that is sufficient in the sense that no stable models are lost. The implementation of the stable model semantics for ground programs is based on bottomup backtracking search where a powerful pruning method is employed. The pruning method exploits an approximation technique for stable models which is closely related to the wellfounded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. This makes it possible to apply the stable model semantics also in areas where resulting programs are highly n...
Stable models and an alternative logic programming paradigm
 In The Logic Programming Paradigm: a 25Year Perspective
, 1999
"... In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting ..."
Abstract

Cited by 250 (18 self)
 Add to MetaCart
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting alternative to more traditional logic programming styles of Horn logic programming, stratified logic programming and logic programming with wellfounded semantics. The proposed approach is based on the interpretation of program clauses as constraints. In this setting programs do not describe a single intended model, but a family of stable models. These stable models encode solutions to the constraint satisfaction problem described by the program. Our approach imposes restrictions on the syntax of logic programs. In particular, function symbols are eliminated from the language. We argue that the resulting logic programming system is wellattuned to problems in the class NP, has a welldefined domain of applications, and an emerging methodology of programming. We point out that what makes the whole approach viable is recent progress in implementations of algorithms to compute stable models of propositional logic programs. 1
Encoding Planning Problems in Nonmonotonic Logic Programs
 In Proceedings of the Fourth European Conference on Planning
, 1997
"... . We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we bring together ideas from logic programming and the planning systems graphplan and satplan. We discuss ..."
Abstract

Cited by 117 (5 self)
 Add to MetaCart
. We present a framework for encoding planning problems in logic programs with negation as failure, having computational efficiency as our major consideration. In order to accomplish our goal, we bring together ideas from logic programming and the planning systems graphplan and satplan. We discuss different representations of planning problems in logic programs, point out issues related to their performance, and show ways to exploit the structure of the domains in these representations. For our experimentation we use an existing implementation of the stable models semantics called smodels. It turns out that for careful and compact encodings, the performance of the method across a number of different domains, is comparable to that of planners like graphplan and satplan. 1 Introduction Nonmonotonic reasoning was originally motivated by the need to capture in a formal logical system aspects of human commonsense reasoning that enable us to withdraw previous conclusions when new informat...
Nested expressions in logic programs
 Annals of Mathematics and Artificial Intelligence
, 1999
"... We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules. These expressions are formed from literals using negation as failure, conjunction (,) and disjunction (;) that can be nested arbitrarily. Conditional expressions are in ..."
Abstract

Cited by 114 (13 self)
 Add to MetaCart
We extend the answer set semantics to a class of logic programs with nested expressions permitted in the bodies and heads of rules. These expressions are formed from literals using negation as failure, conjunction (,) and disjunction (;) that can be nested arbitrarily. Conditional expressions are introduced as abbreviations. The study of equivalent transformations of programs with nested expressions shows that any such program is equivalent to a set of disjunctive rules, possibly with negation as failure in the heads. The generalized answer set semantics is related to the LloydTopor generalization of Clark's completion and to the logic of minimal belief and negation as failure.
A Deductive System for NonMonotonic Reasoning
, 1997
"... Disjunctive Deductive Databases (DDDBs)  functionfree disjunctive logic programs with negation in rule bodies allowed  have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity ..."
Abstract

Cited by 104 (21 self)
 Add to MetaCart
Disjunctive Deductive Databases (DDDBs)  functionfree disjunctive logic programs with negation in rule bodies allowed  have been recently recognized as a powerful tool for knowledge representation and commonsense reasoning. Much research has been spent on issues like semantics and complexity of DDDBs, but the important area of implementing DDDBs has been less addressed so far. However, a thorough investigation thereof is a basic requirement for building systems which render previous foundational work on DDDBs useful for practice. This paper presents the architecture of a DDDB system currently developed at TU Vienna in the FWF project P11580MAT "A Query System for Disjunctive Deductive Databases".
Reasoning Agents In Dynamic Domains
 In Workshop on LogicBased Artificial Intelligence
, 2000
"... The paper discusses an architecture for intelligent agents based on the use of AProlog  a language of logic programs under the answer set semantics. AProlog is used to represent the agent's knowledge about the domain and to formulate the agent's reasoning tasks. We outline how these tasks can be ..."
Abstract

Cited by 80 (27 self)
 Add to MetaCart
The paper discusses an architecture for intelligent agents based on the use of AProlog  a language of logic programs under the answer set semantics. AProlog is used to represent the agent's knowledge about the domain and to formulate the agent's reasoning tasks. We outline how these tasks can be reduced to answering questions about properties of simple logic programs and demonstrate the methodology of constructing these programs. Keywords: Intelligent agents, logic programming and nonmonotonic reasoning. 1 INTRODUCTION This paper is a report on the attempt by the authors to better understand the design of software components of intelligent agents capable of reasoning, planning and acting in a changing environment. The class of such agents includes, but is not limited to, intelligent mobile robots, softbots, immobots, intelligent information systems, expert systems, and decisionmaking systems. The ability to design intelligent agents (IA) is crucial for such diverse tasks as ...
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
 Information and Computation
, 1997
"... Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunct ..."
Abstract

Cited by 75 (17 self)
 Add to MetaCart
Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunctive logic programs, we provide two declarative characterizations of stable models in terms of unfounded sets. One shows that the set of stable models coincides with the family of unfoundedfree models (i.e., a model is stable iff it contains no unfounded atoms). The other proves that stable models can be defined equivalently by a property of their false literals, as a model is stable iff the set of its false literals coincides with its greatest unfounded set. We then generalize the wellfounded WP operator to disjunctive logic programs, give a fixpoint semantics for disjunctive stable models and present an algorithm for computing the stable models of functionfree programs. The algor...
Solving Advanced Reasoning Tasks using Quantified Boolean Formulas
, 2000
"... We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems useful, e.g., for experimental purposes. ..."
Abstract

Cited by 68 (20 self)
 Add to MetaCart
We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems useful, e.g., for experimental purposes.