Results 11  20
of
2,581,596
A Fixed Point Semantics for Logic Programs Extended with Cuts
"... In this paper, we develop a bottomup xed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLDresolution and their multiplicity. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper, we develop a bottomup xed point semantics for pure Prolog programs extended with !/0 that allows to reconstruct the operational semantics of a particular goal. Our semantics captures both the order in which solutions are computed by SLDresolution and their multiplicity.
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 1821 (62 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.
J. LOGIC PROGRAMMING 19X8:5:131 1 CLAUSAL INTUITIONISTIC LOGIC I. FIXEDPOINT SEMANTICS
"... D Since the advent of Hornclause logic programming in the mid 1970’s, there have been numerous attempts to extend the expressive power of Hornclause logic while preserving some of its attractive computational properties. This article, the first of a pair, presents a clausal language that extends H ..."
Abstract
 Add to MetaCart
Hornclause logic by adding negations and embedded implications to the righthand side of a rule, and interpreting these new rules intuitionistically, in a set of partial models. The resulting system is shown to have a fixedpoint semantics that generalizes the van EmdenKowalski semantics for Horn
AttributionNoncommercialNo Derivative Works License. Characteristic Formulae for FixedPoint Semantics: A General Framework∗
"... The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proo ..."
Abstract
 Add to MetaCart
The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions
Author manuscript, published in "PPDP 2008, Valencia: Spain (2008)" Fixed Point Semantics and Partial Recursion in Coq ∗
"... To use this theorem, one should be able to express that the domain of interest has the required completeness property and that the function being considered is continuous. If the goal is to define a partial recursive function then this requires using axioms of classical logic, and for this reason th ..."
Abstract
 Add to MetaCart
To use this theorem, one should be able to express that the domain of interest has the required completeness property and that the function being considered is continuous. If the goal is to define a partial recursive function then this requires using axioms of classical logic, and for this reason the step is seldom made in the user community of typetheory based theorem proving. However, adding classical logic axioms to the constructive logic of type theory can often be done safely to retain the consistency of the whole system. In this paper, we work in classical logic to reason about potentially nonterminating recursive functions. No inconsistency is introduced in the process, because potentially nonterminating functions of type A → B are actually modelled as functions of type A → B⊥: the fact that a function may not terminate is recorded in its type, nonterminating computations are given the value ⊥
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 440 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
Fast and robust fixedpoint algorithms for independent component analysis
 IEEE TRANS. NEURAL NETW
, 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract

Cited by 860 (33 self)
 Add to MetaCart
variance. Finally, we introduce simple fixedpoint algorithms for practical optimization of the contrast functions. These algorithms optimize the contrast functions very fast and reliably.
This work is licensed under the Creative Commons AttributionNoncommercialNo Derivative Works License. Characteristic Formulae for FixedPoint Semantics: A General Framework∗
"... The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions and their proo ..."
Abstract
 Add to MetaCart
The literature on concurrency theory offers a wealth of examples of characteristicformula constructions for various behavioural relations over finite labelled transition systems and Kripke structures that are defined in terms of fixed points of suitable functions. Such constructions
Detection and Tracking of Point Features
 International Journal of Computer Vision
, 1991
"... The factorization method described in this series of reports requires an algorithm to track the motion of features in an image stream. Given the small interframe displacement made possible by the factorization approach, the best tracking method turns out to be the one proposed by Lucas and Kanade i ..."
Abstract

Cited by 623 (2 self)
 Add to MetaCart
in 1981. The method defines the measure of match between fixedsize feature windows in the past and current frame as the sum of squared intensity differences over the windows. The displacement is then defined as the one that minimizes this sum. For small motions, a linearization of the image intensities
Results 11  20
of
2,581,596