- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
On the hardness of approximate reasoning
Artificial Intelligence 82 (1-2):273-302 (1996)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Reasoning about cardinal directions between extended objects: The NP-hardness result.Weiming Liu & Sanjiang Li - 2011 - Artificial Intelligence 175 (18):2155-2169.
Using approximate reasoning to represent default knowledge.Ronald R. Yager - 1987 - Artificial Intelligence 31 (1):99-112.
Book review: Bram Roth, case-based reasoning in the law: A formal theory of reasoning by case comparison. Ph. D. thesis, the university of maastricht, 2003. 181 pp. [REVIEW]Trevor Bench-Capon - 2004 - Artificial Intelligence and Law 12 (3):227-229.
Approximation and hardness of Shift-Bribery.Piotr Faliszewski, Pasin Manurangsi & Krzysztof Sornat - 2021 - Artificial Intelligence 298 (C):103520.
John Zeleznikow and Dan Hunter, Building Intelligent Legal Information Systems: Representation and Reasoning in Law.R. Susskind - 1996 - Artificial Intelligence and Law 4:73-76.
Tractable approximate deduction for OWL.Jeff Z. Pan, Yuan Ren & Yuting Zhao - 2016 - Artificial Intelligence 235 (C):95-155.
Approximate inference in Boltzmann machines.Max Welling & Yee Whye Teh - 2003 - Artificial Intelligence 143 (1):19-50.
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms.Peter Jonsson, Victor Lagerkvist & George Osipov - 2021 - Artificial Intelligence 296 (C):103505.
Hardness of Case-Based Decisions: a Formal Theory.Heng Zheng - 2021 - The 18Th International Conference on Artificial Intelligence and Law (Icail 2021).
Analytics
Added to PP
2020-12-22
Downloads
5 (#847,061)
6 months
4 (#1,635,958)
2020-12-22
Downloads
5 (#847,061)
6 months
4 (#1,635,958)
Historical graph of downloads
Citations of this work
Is Causal Reasoning Harder Than Probabilistic Reasoning?Milan Mossé, Duligur Ibeling & Thomas Icard - 2024 - Review of Symbolic Logic 17 (1):106-131.
On probabilistic inference by weighted model counting.Mark Chavira & Adnan Darwiche - 2008 - Artificial Intelligence 172 (6-7):772-799.
Connectionist semantic systematicity.Stefan L. Frank, Willem F. G. Haselager & Iris van Rooij - 2009 - Cognition 110 (3):358-379.
References found in this work
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Making believers out of computers.Hector J. Levesque - 1986 - Artificial Intelligence 30 (1):81-108.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-594f89468-ckkwp uwo