Results 1  10
of
22,937
The Limits of Horn Logic Programs 1
, 2002
"... Abstract: Given a sequence {Πn} of Horn logic programs, the limit Π of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. The limit program Π is still Horn but may be infinite. In this paper, we consider i ..."
Abstract
 Add to MetaCart
Abstract: Given a sequence {Πn} of Horn logic programs, the limit Π of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. The limit program Π is still Horn but may be infinite. In this paper, we consider
The Limits of Horn Logic Programs 1
, 2001
"... Abstract: Given a sequence {Πn} of logic programs, the limit of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. We shall consider the relation between the least Herbrand model of the limit of a given Ho ..."
Abstract
 Add to MetaCart
Horn logic program sequence and the limit of the least Herbrand models of the logic programs. In the case that the base (language) contains finitely many constant, function and predicate symbols, to make the relation hold we should either constrain the clauses in the logic programs or redefine
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
Description Logic Programs: Combining Logic Programs with Description Logic
, 2002
"... We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a new intermediate knowledge representation (KR) ..."
Abstract

Cited by 529 (46 self)
 Add to MetaCart
) contained within this intersection: Description Logic Programs (DLP), and the closely related Description Horn Logic (DHL) which is an expressive fragment of firstorder logic (FOL). DLP provides a significant degree of expressiveness, substantially greater than the RDFSchema fragment of Description Logic.
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 624 (77 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
Learning Stochastic Logic Programs
, 2000
"... Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a firstorder r ..."
Abstract

Cited by 1194 (81 self)
 Add to MetaCart
Stochastic Logic Programs (SLPs) have been shown to be a generalisation of Hidden Markov Models (HMMs), stochastic contextfree grammars, and directed Bayes' nets. A stochastic logic program consists of a set of labelled clauses p:C where p is in the interval [0,1] and C is a first
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 and complete proofs for the main lemmas. Importantly, we clarify which theorems depend on conditions such as solution compactness, satisfaction completeness and independence of constraints. Second, we generalize the original results to allow for incompleteness of the constraint solver. This is important since almost all CLP systems use an incomplete solver. Third, we give conditions on the (possibly incomplete) solver which ensure that the operational semantics is confluent, that is, has independence of literal scheduling.
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract

Cited by 1847 (63 self)
 Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 869 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Results 1  10
of
22,937