Results 1  10
of
30,521
Reasoning with finite set constraints
 In Proc. Int. Conference on Information Processing and Management of Uncertainty in KnowledgeBased Systems
, 1998
"... The language of propositional logic is sometimes not appropriate to model realworld problems. Therefore, finite set constraints are introduced. A variable of a finite set constraint takes exactly one value out of a given set of values whereas a propositional variable is either true or false. Althou ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
The language of propositional logic is sometimes not appropriate to model realworld problems. Therefore, finite set constraints are introduced. A variable of a finite set constraint takes exactly one value out of a given set of values whereas a propositional variable is either true or false
Finite set constraints in Oz
 TECHNISCHE UNIVERSITÄT MÜNCHEN
, 1997
"... We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profit ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension
Finite Sets and Counting
, 809
"... These notes present an approach to obtaining the basic properties of the natural numbers in terms of the properties of finite sets (which are introduced independently of the natural numbers). The role played by the usual recursion theorem is taken over by a construction which ..."
Abstract
 Add to MetaCart
These notes present an approach to obtaining the basic properties of the natural numbers in terms of the properties of finite sets (which are introduced independently of the natural numbers). The role played by the usual recursion theorem is taken over by a construction which
Divisibility of Dedekind Finite Sets
, 2002
"... A Dedekindfinite set is said to be divisible by a natural number n if it can be partitioned into pieces of size n. We study several aspects of this notion, as well as the stronger notion of being partitionable ..."
Abstract
 Add to MetaCart
A Dedekindfinite set is said to be divisible by a natural number n if it can be partitioned into pieces of size n. We study several aspects of this notion, as well as the stronger notion of being partitionable
FiniteSet Statistics and SLAM
"... Abstract—This tutorial paper describes the elements of a new, practical, Bayesoptimal, and theoretically unified foundation for multisensormultitarget problems. This foundation, called FiniteSet Statistics (FISST), is the basis for a fundamentally new, Bayesoptimal, and theoretically unified app ..."
Abstract
 Add to MetaCart
Abstract—This tutorial paper describes the elements of a new, practical, Bayesoptimal, and theoretically unified foundation for multisensormultitarget problems. This foundation, called FiniteSet Statistics (FISST), is the basis for a fundamentally new, Bayesoptimal, and theoretically unified
FréchetUrysohn for finite sets
"... E. Reznichenko and O. Sipacheva called a space X “FréchetUrysohn for finite sets” if the following holds for each point x ∈ X: whenever P is a collection of finite subsets of X such that every neighborhood of x contains a member of P, then P contains a subfamily that converges to x. We continue ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
E. Reznichenko and O. Sipacheva called a space X “FréchetUrysohn for finite sets” if the following holds for each point x ∈ X: whenever P is a collection of finite subsets of X such that every neighborhood of x contains a member of P, then P contains a subfamily that converges to x. We continue
Infinite games on finite sets
, 2005
"... We study a family of infinite games with imperfect information introduced by B. Model for two players that alternately remove and add points to a finite set. We investigate the existence of imperfect information strategies for the remover for different ambient cardinalities. We also study a variant ..."
Abstract
 Add to MetaCart
We study a family of infinite games with imperfect information introduced by B. Model for two players that alternately remove and add points to a finite set. We investigate the existence of imperfect information strategies for the remover for different ambient cardinalities. We also study a variant
Results 1  10
of
30,521