Sciweavers

236 search results - page 34 / 48
» Reasoning with Prioritized Defaults
Sort
View
BMCBI
2010
97views more  BMCBI 2010»
13 years 5 months ago
Preprocessing of gene expression data by optimally robust estimators
Background: The preprocessing of gene expression data obtained from several platforms routinely includes the aggregation of multiple raw signal intensities to one expression value...
Matthias Kohl, Hans-Peter Deigner
RR
2010
Springer
13 years 5 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 8 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge
KR
2004
Springer
14 years 26 days ago
Reaching Agreement Through Argumentation: A Possibilistic Approach
Negotiation plays a key role as a means for sharing information and resources with the aim of looking for a common agreement. This paper proposes a new approach based on possibili...
Leila Amgoud, Henri Prade
AAAI
2000
13 years 8 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto