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

Links

PhilArchive



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

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

Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE.Navasca Carmeliza Luna - unknown
Ubiquitous human computing.Jonathan Zittrain - manuscript
Polynomial time ultrapowers and the consistency of circuit lower bounds.Jan Bydžovský & Moritz Müller - 2020 - Archive for Mathematical Logic 59 (1-2):127-147.
Trial Equation Method Based on Symmetry and Applications to Nonlinear Equations Arising in Mathematical Physics.Cheng-Shi Liu - 2011 - Foundations of Physics 41 (5):793-804.
A second-order system for polytime reasoning based on Grädel's theorem.Stephen Cook & Antonina Kolokolova - 2003 - Annals of Pure and Applied Logic 124 (1-3):193-231.
Optimal Vaccination Policies for an SIR Model with Limited Resources.Yinggao Zhou, Kuan Yang, Kai Zhou & Yiting Liang - 2014 - Acta Biotheoretica 62 (2):171-181.
The bounded injury priority method and the learnability of unions of rectangles.Zhixiang Chen & Steven Homer - 1996 - Annals of Pure and Applied Logic 77 (2):143-168.
The Hilbert Zonotope and a Polynomial Time Algorithm for Universal Grobner Bases.Babson Eric, Onn Shmuel & Thomas Rekha - unknown
Time of day effects on problem solving: When the non-optimal is optimal.Mareike B. Wieth & Rose T. Zacks - 2011 - Thinking and Reasoning 17 (4):387 - 401.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Light affine lambda calculus and polynomial time strong normalization.Kazushige Terui - 2007 - Archive for Mathematical Logic 46 (3-4):253-280.
Computing leximin-optimal solutions in constraint networks.Sylvain Bouveret & Michel Lemaître - 2009 - Artificial Intelligence 173 (2):343-364.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Feasible Graphs and Colorings.Douglas Cenzer & Jeffrey Remmel - 1995 - Mathematical Logic Quarterly 41 (3):327-352.
Group theory and solutions of classical field theories with polynomial nonlinearities.A. M. Grundland, J. A. Tuszyński & P. Winternitz - 1993 - Foundations of Physics 23 (4):633-665.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,325,033)

6 months
7 (#441,920)

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