Sciweavers

89 search results - page 6 / 18
» Abduction and the Dualization Problem
Sort
View
IJCAI
1993
15 years 29 days ago
A Tractable Class of Abduction Problems
literal: Let p be a proposition. Then p and -p are literals. clause: A clause is a disjunction of literals. Horn Clause: A Horn Clause is a clause in which there is at most one po...
Kave Eshghi
AAAI
2008
15 years 2 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 2 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
ARTMED
1999
75views more  ARTMED 1999»
14 years 11 months ago
An intelligent system for pacemaker reprogramming
The process of reprogramming a cardiac pacemaker can be described in terms similar to those used for describing diagnostic problem solving. In this paper, the process of reprogram...
Peter J. F. Lucas, Astrid Tholen, Geeske van Oort
AAAI
1990
15 years 24 days ago
Probabilistic Semantics for Cost Based Abduction
Cost-based abduction attempts to find the best explanation for a set of facts by finding a minimal cost proof for the facts. The costs are computed by summing the costs of the ass...
Eugene Charniak, Solomon Eyal Shimony