@inbook {17793,
	title = {Probabilistic Ontologies and Relational Databases},
	booktitle = {On the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASEOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE},
	series = {Lecture Notes in Computer Science},
	volume = {3760},
	year = {2005},
	month = {2005///},
	pages = {1 - 17},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The relational algebra and calculus do not take the semantics of terms into account when answering queries. As a consequence, not all tuples that should be returned in response to a query are always returned, leading to low recall. In this paper, we propose the novel notion of a constrained probabilistic ontology (CPO). We developed the concept of a CPO-enhanced relation in which each attribute of a relation has an associated CPO. These CPOs describe relationships between terms occurring in the domain of that attribute. We show that the relational algebra can be extended to handle CPO-enhanced relations. This allows queries to yield sets of tuples, each of which has a probability of being correct.},
	keywords = {Computer, Science},
	isbn = {978-3-540-29736-9},
	url = {http://dx.doi.org/10.1007/11575771_1},
	author = {Udrea,Octavian and Yu,Deng and Hung,Edward and Subrahmanian,V.},
	editor = {Meersman,Robert and Tari,Zahir}
}
