Polynomial solvability of cost-based abduction

&
Artificial Intelligence 86 (1):157-170 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(96)00016-1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A linear constraint satisfaction approach to cost-based abduction.Eugene Santos - 1994 - Artificial Intelligence 65 (1):1-27.
Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.
Abduction versus conceiving in modal epistemology.Stephen Biggs & Jessica Wilson - 2019 - Synthese 198 (Suppl 8):2045-2076.
Generalized Completeness Theorem and Solvability of Systems of Boolean Polynomial Equations.Alexander Abian - 1970 - Mathematical Logic Quarterly 16 (3):263-264.
Alexander Abian. On the solvability of infinite systems of Boolean polynomial equations. Colloquium mathematicum, vol. 21 , pp. 27–30. - Alexander Abian. Generalized completeness theorem and solvability of systems of Boolean polynomial equations. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 16 , pp. 263–264. - Paul D. Bacsich. Injectivity in model theory. Colloquium mathematicum, vol. 25 , pp. 165–176. - S. Bulman-Fleming. On equationally compact semilattices. Algebra universalis , vol. 2 no. 2 , pp. 146–151. - G. Grätzer and H. Lakser. Equationally compact semilattices. Colloquium mathematicum, vol. 20 , pp. 27–30. - David K. Haley. On compact commutative Noetherian rings. Mathematische Annalen, vol. 189 , pp. 272–274. - Ralph McKenzie. ℵ1-incompactness of Z. Colloquium mathematicum, vol. 23 , pp. 199–202. - Jan Mycielski. Some compactifications of general algebras. Colloquium mathematicum, vol. 13 no. 1 , pp. 1–9. See Errata on page 281 of next paper. - Jan. [REVIEW]Walter Taylor - 1975 - Journal of Symbolic Logic 40 (1):88-92.
Rank logic is dead, long live rank logic!Erich Grädel & Wied Pakusa - 2019 - Journal of Symbolic Logic 84 (1):54-87.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
On the Solvability of Infinite Systems of Boolean Polynomial Equations.Alexander Abian, Paul D. Bacsich, S. Bulman-Fleming & H. Lakser - 1975 - Journal of Symbolic Logic 40 (1):88-92.
The assessment of argumentation based on abduction.Jean H. M. Wagemans - unknown
Abduction, Selection, and Selective Abduction.Gerhard Minnameier - 2006 - In Lorenzo Magnani & Claudia Casadio (eds.), Model Based Reasoning in Science and Technology. Logical, Epistemological, and Cognitive Issues. Springer Verlag.
An algorithm for rinding MAPs for belief networks through cost-based abduction.Ashraf M. Abdelbar - 1998 - Artificial Intelligence 104 (1-2):331-338.
Projectual Abduction.Giovanni Tuzet - 2006 - Logic Journal of the IGPL 14 (2):151-160.
Common Cause Abduction: Its Scope and Limits.Patryk Dziurosz-Serafinowicz - 2012 - Filozofia Nauki 20 (4).
Cut-Based Abduction.Marcello D'agostino, Marcelo Finger & Dov Gabbay - 2008 - Logic Journal of the IGPL 16 (6):537-560.
Hansonian and Harmanian abduction as models of discovery.Sami Paavola - 2006 - International Studies in the Philosophy of Science 20 (1):93 – 108.

Analytics

Added to PP
2020-12-22

Downloads
4 (#1,621,857)

6 months
2 (#1,192,898)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Analysis of notions of diagnosis.Peter J. F. Lucas - 1998 - Artificial Intelligence 105 (1-2):295-343.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.

Add more citations

References found in this work

Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.

Add more references