Sciweavers

630 search results - page 39 / 126
» Combining Two Formalism for Reasoning about Concepts
Sort
View
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
Combining generic judgments with recursive definitions
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
Andrew Gacek, Dale Miller, Gopalan Nadathur
SDM
2010
SIAM
158views Data Mining» more  SDM 2010»
13 years 9 months ago
On the Use of Combining Rules in Relational Probability Trees
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Daan Fierens
SUM
2007
Springer
14 years 1 months ago
Combining Uncertain Outputs from Multiple Ontology Matchers
Abstract. An ontology matching method (or a matcher) aims at matching every entity (or concept) in one ontology to the most suitable entity (or entities) in another ontology. Usual...
Ying Wang, Weiru Liu, David A. Bell
ICCS
2007
Springer
14 years 1 months ago
Supporting Lexical Ontology Learning by Relational Exploration
Designing and refining ontologies becomes a tedious task, once the boundary to real-world-size knowledge bases has been crossed. Hence semi-automatic methods supporting those task...
Sebastian Rudolph, Johanna Völker, Pascal Hit...
ER
2007
Springer
146views Database» more  ER 2007»
13 years 11 months ago
Achieving, Satisficing, and Excelling
Abstract. Definitions of the concepts derived from the goal concept (including functional and nonfunctional goal, hardgoal, and softgoal) used in requirements engineering are discu...
Ivan Jureta, Stéphane Faulkner, Pierre-Yves...