Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions

&
Artificial Intelligence 91 (1):131-154 (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(96)00061-6

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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 near-optimal polynomial time algorithm for learning in certain classes of stochastic games.Ronen I. Brafman & Moshe Tennenholtz - 2000 - Artificial Intelligence 121 (1-2):31-47.
Computing leximin-optimal solutions in constraint networks.Sylvain Bouveret & Michel Lemaître - 2009 - Artificial Intelligence 173 (2):343-364.
Reasoning about action in polynomial time.Thomas Drakengren & Marcus Bjäreland - 1999 - Artificial Intelligence 115 (1):1-24.
Computing optimal hypertree decompositions with SAT.André Schidler & Stefan Szeider - 2023 - Artificial Intelligence 325 (C):104015.
Constraint reasoning based on interval arithmetic: the tolerance propagation approach.Eero Hyvönen - 1992 - Artificial Intelligence 58 (1-3):71-112.
Optimal problem-solving search: All-or-none solutions.Herbert A. Simon & Joseph B. Kadane - 1975 - Artificial Intelligence 6 (3):235-247.
Search rearrangement backtracking and polynomial average time.Paul Walton Purdom - 1983 - Artificial Intelligence 21 (1-2):117-133.
Computing intersections of Horn theories for reasoning with models.Thomas Eiter, Toshihide Ibaraki & Kazuhisa Makino - 1999 - Artificial Intelligence 110 (1):57-101.
Near-optimal continuous patrolling with teams of mobile information gathering agents.R. Stranders, E. Munoz de Cote, A. Rogers & N. R. Jennings - 2013 - Artificial Intelligence 195 (C):63-105.
Correction to: Reasoning with inconsistent precedents.Ilaria Canavotto - forthcoming - Artificial Intelligence and Law:1-4.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,276,532)

6 months
5 (#1,039,842)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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

A logical framework for default reasoning.David Poole - 1988 - Artificial Intelligence 36 (1):27-47.
An assumption-based TMS.Johan de Kleer - 1986 - Artificial Intelligence 28 (2):127-162.
Cost-based abduction and MAP explanation.Eugene Charniak & Solomon Eyal Shimony - 1994 - Artificial Intelligence 66 (2):345-374.

View all 6 references / Add more references