A linear constraint satisfaction approach to cost-based abduction

Artificial Intelligence 65 (1):1-27 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,497

External links

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

Through your library

Similar books and articles

Polynomial solvability of cost-based abduction.Eugene Santos & Eugene S. Santos - 1996 - Artificial Intelligence 86 (1):157-170.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.
The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Variable-Centered Consistency in Model RB.Liang Li, Tian Liu & Ke Xu - 2013 - Minds and Machines 23 (1):95-103.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.

Analytics

Added to PP
2020-12-22

Downloads
2 (#1,809,554)

6 months
1 (#1,478,830)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?