Sciweavers

426 search results - page 36 / 86
» Combining Answer Sets of Nonmonotonic Logic Programs
Sort
View
ICLP
1994
Springer
13 years 11 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner
AMAI
2006
Springer
13 years 7 months ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
LPNMR
2007
Springer
14 years 1 months ago
A Preference-Based Framework for Updating Logic Programs
Abstract. We present a framework for updating logic programs under the answer-set semantics that builds on existing work on preferences in logic programming. The approach is simple...
James P. Delgrande, Torsten Schaub, Hans Tompits
LPNMR
2005
Springer
14 years 1 months ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
AAAI
2010
13 years 9 months ago
Ordered Completion for First-Order Logic Programs on Finite Structures
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou