Results 1  10
of
103,453
Set Unification
, 2001
"... The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas  e.g., deductive databases, theorem ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
The goal of this paper is to provide a uniform overview of the unification problem in algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and it can find important applications in various research areas  e.g., deductive databases, theorem
From Set Unification to Set Constraints
 IL MILIONE: A JOURNEY IN THE COMPUTATIONAL LOGIC IN ITALY
"... In this paper, we briefly summarize some of the most challenging issues that arise when allowing sets to be dealt with as firstclass objects in a logic language, ranging from set unification of wellfounded and nonwellfounded sets to set constraint solving. ..."
Abstract
 Add to MetaCart
In this paper, we briefly summarize some of the most challenging issues that arise when allowing sets to be dealt with as firstclass objects in a logic language, ranging from set unification of wellfounded and nonwellfounded sets to set constraint solving.
A Minimality Study for Set Unification
, 1997
"... A unification algorithm is said to be minimal for a unification problem if it generates exactly a (minimal) complete set of mostgeneral unifiers, without instances, and without repetitions. The aim of this paper is to present a combinatorial minimality study for a significant collection of sample p ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
A unification algorithm is said to be minimal for a unification problem if it generates exactly a (minimal) complete set of mostgeneral unifiers, without instances, and without repetitions. The aim of this paper is to present a combinatorial minimality study for a significant collection of sample
Bag and Set Unification
, 1997
"... Unification in logic programming deals with treelike data represented by terms. We extend this unification to terms that represent finite sets and bags (finite multisets). An extended unification algorithm is presented as an algorithm solving equality constraints. This algorithm runs in nondetermin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Unification in logic programming deals with treelike data represented by terms. We extend this unification to terms that represent finite sets and bags (finite multisets). An extended unification algorithm is presented as an algorithm solving equality constraints. This algorithm runs
Set Unification Revisited
, 2001
"... The goal of this paper is to provide a uniform overview of the unification problem in the algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and finds important applications in various research areas  e.g., deductive databases, theorem p ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
The goal of this paper is to provide a uniform overview of the unification problem in the algebras capable of describing sets. The problem has been tackled, directly and indirectly, by many researchers and finds important applications in various research areas  e.g., deductive databases, theorem
Infinite Set Unification with Application to Categorial Grammar
, 1997
"... In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.
An Efficient Unification Algorithm
 TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS (TOPLAS)
, 1982
"... The unification problem in firstorder predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given. A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nond ..."
Abstract

Cited by 369 (1 self)
 Add to MetaCart
The unification problem in firstorder predicate calculus is described in general terms as the solution of a system of equations, and a nondeterministic algorithm is given. A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from
The EntityRelationship Model: Toward a Unified View of Data
 ACM Transactions on Database Systems
, 1976
"... A data model, called the entityrelationship model, is proposed. This model incorporates some of the important semantic information about the real world. A special diagrammatic technique is introduced as a tool for database design. An example of database design and description using the model and th ..."
Abstract

Cited by 1787 (6 self)
 Add to MetaCart
and the diagrammatic technique is given. Some implications for data integrity, information retrieval, and data manipulation are discussed. The entityrelationship model can be used as a basis for unification of different views of data: t,he network model, the relational model, and the entity set model. Semantic
Markov Random Field Models in Computer Vision
, 1994
"... . A variety of computer vision problems can be optimally posed as Bayesian labeling in which the solution of a problem is defined as the maximum a posteriori (MAP) probability estimate of the true labeling. The posterior probability is usually derived from a prior model and a likelihood model. The l ..."
Abstract

Cited by 515 (18 self)
 Add to MetaCart
in low and high level computer vision. The unification is made possible due to a recent advance in MRF modeling for high level object recognition. Such unification provides a systematic approach for vision modeling based on sound mathematical principles. 1 Introduction Since its beginning in early 1960
Results 1  10
of
103,453