Results 1  10
of
31,941
Strongly Equivalent Logic Programs
 ACM Transactions on Computational Logic
, 2000
"... A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong equival ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
A logic program 1 is said to be equivalent to a logic program 2 in the sense of the answer set semantics if 1 and 2 have the same answer sets. We are interested in the following stronger condition: for every logic program , 1 [ has the same answer sets as 2 [ . The study of strong
Characterization of Strongly Equivalent Logic Programs in Intermediate Logics
 in Intermediate Logics. Theory and Practice of Logic Programming
, 2001
"... The nonclassical, nonmonotonic inference relation associated with the stable model semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be veri ed in the 3valued Godel logic, G3, the strongest nonclassical intermediate proposition ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
The nonclassical, nonmonotonic inference relation associated with the stable model semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be veri ed in the 3valued Godel logic, G3, the strongest nonclassical intermediate
Discovering Classes of Strongly Equivalent Logic Programs
 Proceedings of the 19th International Joint Conference on Articial Intelligence (IJCAI05
, 2005
"... In this paper we apply computeraided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules that p ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
In this paper we apply computeraided theorem discovery technique to discover theorems about strongly equivalent logic programs under the answer set semantics. Our discovered theorems capture new classes of strongly equivalent logic programs that can lead to new program simplification rules
Discovering Classes of Strongly Equivalent Logic Programs with Negation as Failure in the Head
"... Abstract. In this paper, we apply Fangzhen Lin’s methodology of computer aided theorem discovery to discover classes of strongly equivalent logic programs with negation as failure in the head. Specifically, with the help of computers, we discover exact conditions that capture the strong equivalence ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we apply Fangzhen Lin’s methodology of computer aided theorem discovery to discover classes of strongly equivalent logic programs with negation as failure in the head. Specifically, with the help of computers, we discover exact conditions that capture the strong
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
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
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
31,941