(Enter summary)
Abstract: The problem of abduction can be characterized as finding the best explanation of
a set of data. In this paper we focus on one type of abduction in which the best
explanation is the most plausible combination of hypotheses that explains all the
data. We then present several computational complexity results demonstrating
that this type of abduction is intractable (NP-hard) in general. In particular,
choosing between incompatible hypotheses, reasoning about cancellation effects
among hypotheses,... (Update)
Cited by: More
Abductive Theorem Proving for Analyzing Student.. - Makatchev, Jordan.. (2004)
(Correct)
An Overview of Abduction as a General Framework for.. - Menzies (1995)
(Correct)
Model-Based Reasoning About Learner Behaviour - de Koning, Bredeweg, Breuker, .. (2000)
(Correct)
Active bibliography (related documents): More All
0.7: Peirce-IGTT: A Domain-Independent Problem Solver for.. - Fox, Josephson (1992)
(Correct)
0.7: A Knowledge-Based Selection Mechanism for Control with.. - III, Goel, Brown
(Correct)
0.5: A Neural Architecture for a Class of Abduction Problems - Ashok Goel (1996)
(Correct)
Similar documents based on text: More All
0.8: Peirce-Igtt: A Domain-Independent Problem Solver For.. - Fox, Josephson (1992)
(Correct)
0.3: Automated Theory Decision Making: A Case Of Evolution Vs.. - Fox, Trusko, Josephson (1992)
(Correct)
0.1: Diagrammatic Reasoning in Support of Situation.. - Chandrasekaran.. (2002)
(Correct)
Related documents from co-citation: More All
26: A theory of diagnosis from first principles (context) - Reiter - 1987
25: Abductive and Default Reasoning: A Computational Core (context) - Selman - 1990
23: Abductive Inference Models for Diagnostic Problem Solving (context) - Peng, Reggia - 1990
BibTeX entry: (Update)
Bylander, T., D. Allemang, M. C. Tanner and J. R. Josephson (1991): The computational complexity of abduction. In Artificial Intelligence 49 (1991). http://citeseer.ist.psu.edu/bylander91computational.html More
@article{ bylander91computational,
author = "Tom Bylander and Dean Allemang and Michael C. Tanner and John R. Josephson",
title = "The Computational Complexity of Abduction",
journal = "Artificial Intelligence",
volume = "49",
number = "1-3",
pages = "25-60",
year = "1991",
url = "citeseer.ist.psu.edu/bylander91computational.html" }
Citations (may not include all citations):
572
Computers and Intractability (context) - Garey, Johnson - 1979
458
A theory of diagnosis from first principles (context) - Reiter - 1987
286
Interpretation as abduction
- Hobbs, Stickel et al. - 1988
163
The complexity of enumeration and reliability problems (context) - Valiant - 1979
154
Introduction to Artificial Intelligence (context) - Charniak, McDermott - 1985
107
Diagnosing multiple faults (context) - de Kleer, Williams - 1987
90
Explanation and prediction: An architecture for default and ..
- Poole - 1989
67
and structuring in belief networks (context) - Pearl, propagation - 1986
66
A knowledge-level account of abduction (context) - Levesque - 1989
63
Diagnostic expert systems based on a set covering model (context) - Reggia, Nau et al. - 1983
62
the mechanization of abductive logic (context) - Pople - 1973
61
Model-based reasoning: Troubleshooting (context) - Davis, Hamscher - 1988
52
Model-based monitoring of dynamic systems
- Dvorak, Kuipers - 1989
41
An experimental computerbased diagnostic consultant for gene.. (context) - Miller, Pople et al. - 1982
39
Diagnosis with behavioral modes (context) - de Kleer, Williams - 1989
32
A probabilistic causal model for diagnostic problem solving (context) - Peng, Reggia - 1987
27
Computational Philosophy of Science (context) - Thagard - 1988
24
MOLE: A knowledge-acquisition tool for cover-and-differentia.. (context) - Eshelman - 1988
24
A mechanism for forming composite explanatory hypotheses (context) - Josephson, Chandrasekaran et al. - 1987
23
Distributed revision of composite beliefs (context) - Pearl - 1987
22
Abduction and induction (context) - Peirce - 1955
19
the computational complexity of hypothesis assembly (context) - Allemang, Tanner et al. - 1987
19
Physical negation (context) - Struss, Dressler - 1989
16
Some results concerning the computational complexity of abdu.. (context) - Bylander, Allemang et al. - 1989
12
Modeling knowledge of the patient in acid-base and electroly.. (context) - Patil, Szolovits et al. - 1982
11
The formation of composite hypotheses in diagnostic problem .. (context) - Pople - 1977
5
RED: A red-cell antibody identification expert module (context) - Smith, Svirbely et al. - 1985
3
Concurrent synthesis of composite explanatory hypotheses (context) - Goel, Sadayappan et al. - 1988
2
Problem solving in red cell antibody identification: RED's p.. (context) - Smith, Josephson et al. - 1986
2
The computational complexity of probablistic inference using.. (context) - Cooper - 1990
2
Distributed abduction (context) - Sticklen - 1989
1
Ohio State Univ (context) - Josephson, Goel et al. - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://ringer.cs.utsa.edu/research/AI/bylander/pubs/pubs.html): More
Learning Noisy Linear Threshold Functions - Bylander (1998)
(Correct)
Worst-Case Absolute Loss Bounds for Linear Learning Algorithms - Tom Bylander (1997)
(Correct)
A Probabilistic Analysis of Propositional STRIPS Planning - Bylander (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC