Results 1  10
of
2,410,128
Analysis of Normal Logic Programs
"... In this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct w ..."
Abstract
 Add to MetaCart
In this paper we present a dataflow analysis method for normal logic programs interpreted with negation as failure or constructive negation. We apply our method to a well known analysis for logic programs: the depth(k) analysis for approximating the set of computed answers. The analysis is correct
Rational Models of Normal Logic Programs
 KI96: Advances in Artificial Intelligence, References 17 volume 1137 of Lecture Notes in Artificial Intelligence
, 1996
"... In general, the application of the meaning function TP to a normal logic program P results in infinite expressions and, hence, is infeasible in practice. On the other hand, the iteration of TP is of interest for several fields in AI. Therefore, we introduce a new representation of interpretations a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In general, the application of the meaning function TP to a normal logic program P results in infinite expressions and, hence, is infeasible in practice. On the other hand, the iteration of TP is of interest for several fields in AI. Therefore, we introduce a new representation of interpretations
Modular Equivalence for Normal Logic Programs ∗
"... A GaifmanShapirostyle architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The resulting m ..."
Abstract
 Add to MetaCart
A GaifmanShapirostyle architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The resulting
Modular Equivalence for Normal Logic Programs
"... Abstract. A GaifmanShapirostyle architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models. The r ..."
Abstract
 Add to MetaCart
Abstract. A GaifmanShapirostyle architecture of program modules is introduced in the case of normal logic programs under stable model semantics. The composition of program modules is suitably limited by module conditions which ensure the compatibility of the module system with stable models
Reduction of Abductive Logic Programs to Normal Logic Programs
 Proc. 12th ICLP
, 1994
"... In this paper we study a form of abductive logic programming which combines default and nondefault abducibles and employs retractibles in integrity constraints. We also present a transformation from abductive to normal logic programs, which is correct and complete with respect to many semantics. Th ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
In this paper we study a form of abductive logic programming which combines default and nondefault abducibles and employs retractibles in integrity constraints. We also present a transformation from abductive to normal logic programs, which is correct and complete with respect to many semantics
On the Equivalence of Semantics for Normal Logic Programs
, 1995
"... this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by Sacc`a and Zaniolo, the preferential semantics by Dung, and a stronger version of the stable class s ..."
Abstract

Cited by 41 (18 self)
 Add to MetaCart
semantics by Baral and Subrahmanian. We show that these equivalent semantics can be characterized simply as selecting a particular kind of stable classes, called normal alternating fixpoints. In addition, we indicate that almost all proposed semantic frameworks coincide with that of normal alternating
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 287 (9 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
On odd and even cycles in normal logic programs
 In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI–2004), AAAI Press, Menlo Park, CA
, 2004
"... An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even number of negative edges. For a normal logic program that has no odd cycles, while it is known that such a program alway ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
An odd cycle of a logic program is a simple cycle that has an odd number of negative edges in the dependency graph of the program. Similarly, an even cycle is one that has an even number of negative edges. For a normal logic program that has no odd cycles, while it is known that such a program
Translation of Aggregate Programs to Normal Logic Programs
 In ASP’03
, 2003
"... We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic progra ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and stratified aggregate programs and show that the translation of such programs are, respectively, definite and stratified logic
Using Abduction for Induction of Normal Logic Programs
"... Abstract. This paper proposes the approach of eXtended Hybrid Abductive Inductive Learning (XHAIL) for generalising positive and negative examples with respect to normal logic programs. A proof procedure is described that uses abduction to realise the abductive, deductive, and inductive phases which ..."
Abstract
 Add to MetaCart
Abstract. This paper proposes the approach of eXtended Hybrid Abductive Inductive Learning (XHAIL) for generalising positive and negative examples with respect to normal logic programs. A proof procedure is described that uses abduction to realise the abductive, deductive, and inductive phases
Results 1  10
of
2,410,128