Results 1  10
of
3,198
Well Founded Semantics for Logic Programs with Explicit Negation
 EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1992
"... The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised [11 ..."
Abstract

Cited by 130 (54 self)
 Add to MetaCart
The aim of this paper is to provide a semantics for general logic programs (with negation by default) extended with explicit negation, subsuming well founded semantics [22]. The Well Founded semantics for extended logic programs (WFSX) is expressible by a default theory semantics we have devised
Explicit Negation in Relational Databases
, 1264
"... Negative facts in relational databases have traditionally been inferred using the closed world assumption. There are situations where this is not appropriate. We need to resort to the open world assumption, where the negative facts are sometimes explicitly stated. We present a formalism which is cap ..."
Abstract
 Add to MetaCart
Negative facts in relational databases have traditionally been inferred using the closed world assumption. There are situations where this is not appropriate. We need to resort to the open world assumption, where the negative facts are sometimes explicitly stated. We present a formalism which
Contradiction Removal Semantics with Explicit Negation
 KNOWLEDGE REPRESENTATION AND REASONING UNDER UNCERTAINTY, NUMBER 808 IN LNAI
, 1992
"... Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then ¸a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a bot ..."
Abstract

Cited by 16 (12 self)
 Add to MetaCart
Well Founded Semantics for logic programs extended with eXplicit negation (WFSX) is characterized by that, in any model, whenever :a (the explicit negation of a) holds, then ¸a (the negation by default of a) also holds. When explicit negation is used contradiction may be present (e.g. a and :a
Default theory for Well Founded Semantics with Explicit Negation
"... One aim of this paper is to define a default theory for Well Founded Semantics of logic programs which have been extended with explicit negation, such that the models of a program correspond exactly to the extensions of the default theory corresponding to the program. To do so we must introduce a ne ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
One aim of this paper is to define a default theory for Well Founded Semantics of logic programs which have been extended with explicit negation, such that the models of a program correspond exactly to the extensions of the default theory corresponding to the program. To do so we must introduce a
Inducing logic programs without explicit negative examples
 IN PROCEEDINGS OF THE FIFTH INTERNATIONAL WORKSHOP ON INDUCTIVE LOGIC PROGRAMMING
, 1995
"... This paper presents a method for learning logic programs without explicit negative examples by exploiting an assumption of output completeness. A mode declaration is supplied for the target predicate and each training input is assumed to be accompanied by all of its legal outputs. Any other outputs ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
This paper presents a method for learning logic programs without explicit negative examples by exploiting an assumption of output completeness. A mode declaration is supplied for the target predicate and each training input is assumed to be accompanied by all of its legal outputs. Any other outputs
Language Acquisition in the Absence of Explicit Negative Evidence: How Important is Starting Small?
 COGNITION
, 1999
"... It is commonly assumed that innate linguistic constraints are necessary to learn a natural language, based on the apparent lack of explicit negative evidence provided to children and on Gold's proof that, under assumptions of virtually arbitrary positive presentation, most interesting classe ..."
Abstract

Cited by 95 (6 self)
 Add to MetaCart
It is commonly assumed that innate linguistic constraints are necessary to learn a natural language, based on the apparent lack of explicit negative evidence provided to children and on Gold's proof that, under assumptions of virtually arbitrary positive presentation, most interesting
Proof Nets with Explicit Negation for Multiplicative Linear Logic
, 1998
"... Multiplicative linear logic (MLL) was introduced in [Gi87] as a onesided sequent calculus: linear negation is a notion that is defined, via De Morgan identities. One obtains proof nets for MLL by identifying derivations in the onesided calculus that are equal up to a permutation of inference rules ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Multiplicative linear logic (MLL) was introduced in [Gi87] as a onesided sequent calculus: linear negation is a notion that is defined, via De Morgan identities. One obtains proof nets for MLL by identifying derivations in the onesided calculus that are equal up to a permutation of inference
Nonnegative matrix factorization with sparseness constraints,”
 Journal of Machine Learning Research,
, 2004
"... Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we sho ..."
Abstract

Cited by 498 (0 self)
 Add to MetaCart
Abstract Nonnegative matrix factorization (NMF) is a recently developed technique for finding partsbased, linear representations of nonnegative data. Although it has successfully been applied in several applications, it does not always result in partsbased representations. In this paper, we
A rewriting method for WellFounded Semantics with Explicit Negation
 IN INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING (ICLP’02)
, 2002
"... We present a modification of Brass et al's transformationbased method for the bottomup computation of wellfounded semantics (WFS), in order to cope with explicit negation, in the sense of Alferes and Pereira's WFSX semantics. This variation consists in the simple addition of two int ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We present a modification of Brass et al's transformationbased method for the bottomup computation of wellfounded semantics (WFS), in order to cope with explicit negation, in the sense of Alferes and Pereira's WFSX semantics. This variation consists in the simple addition of two
Results 1  10
of
3,198