Results 1  10
of
488,399
Applying SLDResolution to a Class of NonHorn Logic Programs
 Bulletin of the IGPL
, 1994
"... Methods for dealing with a Horn logic program and one goal are wellknown and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLDresolution. We describe the approach and show its correctness. The result can be a ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Methods for dealing with a Horn logic program and one goal are wellknown and successful. Here we are concerned with treating logic programs enhanced by some negative literals using the same methods, in particular SLDresolution. We describe the approach and show its correctness. The result can
SLDResolution with Reflection
, 1995
"... The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming and constrain ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
The aim of this thesis is to define a procedural and declarative semantics of SLDresolution with reflection, in the general framework defined by Jaffar et al. This scheme is in fact general enough to constitute a ground work suitable for (i) the possible integration of metaprogramming
Sound and complete sldresolution for bilatticebased annotated logic programs
 In Proceedings of the International Conference INFORMATIONMFCSITâ€™06
"... We introduce the class of normal bilatticebased annotated firstorder logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLDresolution for these programs is defined and its soundness and completeness established. ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We introduce the class of normal bilatticebased annotated firstorder logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLDresolution for these programs is defined and its soundness and completeness established.
A Fixpoint Semantics and an SLDResolution Calculus for Modal Logic Programs
, 2001
"... We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLDresolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program P ..."
Abstract

Cited by 15 (13 self)
 Add to MetaCart
We propose a modal logic programming language called MProlog, which is as expressive as the general modal Horn fragment. We give a fixpoint semantics and an SLDresolution calculus for MProlog in all of the basic serial modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. For an MProlog program
Magic Sets vs. SLDResolution
, 1995
"... It is by now folklore that the bottomup evaluation of a program after the "magic set" transformation is "as efficient as" topdown evaluation. There are a number of formalizations of this in the literature. However, the naive formalization is false: As shown by Ross, SLDresolut ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
It is by now folklore that the bottomup evaluation of a program after the "magic set" transformation is "as efficient as" topdown evaluation. There are a number of formalizations of this in the literature. However, the naive formalization is false: As shown by Ross, SLDresolution
Abduction in Logic Programming
"... Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over th ..."
Abstract

Cited by 616 (76 self)
 Add to MetaCart
Abduction in Logic Programming started in the late 80s, early 90s, in an attempt to extend logic programming into a framework suitable for a variety of problems in Artificial Intelligence and other areas of Computer Science. This paper aims to chart out the main developments of the field over
A Fixpoint Semantics and an SLDResolution Calculusfor Modal Logic Programs
"... P and for L being one of the mentioned logics, we define an operator TL,P,which has the least fixpoint IL,P. This fixpoint is a set of formulae, which may contain labeledforms of the modal operator 3, and is called the least Lmodel generator of P. The standard modelof IL,P is shown to be a least L ..."
Abstract
 Add to MetaCart
model of P. The SLDresolution calculus for MProlog is designedwith a similar style as for classical logic programming. It is sound and complete. We also extend the calculus for MProlog in the almost serial modal logics KB, K5, K45, and KB5.
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Results 1  10
of
488,399