Sciweavers

670 search results - page 21 / 134
» Inclusion-Based Approximate Reasoning
Sort
View
NIPS
2008
13 years 9 months ago
Bayesian Network Score Approximation using a Metagraph Kernel
Many interesting problems, including Bayesian network structure-search, can be cast in terms of finding the optimum value of a function over the space of graphs. However, this fun...
Benjamin Yackley, Eduardo Corona, Terran Lane
CP
2009
Springer
14 years 2 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
ER
2010
Springer
121views Database» more  ER 2010»
13 years 6 months ago
Reasoning with Optional and Preferred Requirements
Abstract. Of particular concern in requirements engineering is the selection of requirements to implement in the next release of a system. To that end, there has been recent work o...
Neil A. Ernst, John Mylopoulos, Alexander Borgida,...
FOIS
2006
13 years 9 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
IJCAI
1997
13 years 9 months ago
Exploiting Domain Knowledge for Approximate Diagnosis
The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate en...
Annette ten Teije, Frank van Harmelen