- 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
The computational complexity of abduction
Artificial Intelligence 49 (1-3):25-60 (1991)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Philosophy and Cognitive Science Ii: Western & Eastern Studies.Woosuk Park, Ping Li & Lorenzo Magnani (eds.) - 2015 - Cham: Springer Verlag.
Tractability and the computational mind.Rineke Verbrugge & Jakub Szymanik - 2018 - In Mark Sprevak & Matteo Colombo (eds.), The Routledge Handbook of the Computational Mind. Routledge. pp. 339-353.
Complexity and postmodernism: understanding complex systems.Paul Cilliers - 1998 - New York: Routledge.
Computation models for parameterized complexity.Marco Cesati & Miriam Dilanni - 1997 - Mathematical Logic Quarterly 43 (2):179-202.
The Computational Complexity of Quantified Reciprocals.Jakub Szymanik - 2009 - In Peter Bosch, David Gabelaia & Jérôme Lang (eds.), Lecture Notes on Artificial Intelligence 5422, Logic, Language, and Computation 7th International Tbilisi Symposium on Logic, Language, and Computation. Springer.
The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
Universality, Invariance, and the Foundations of Computational Complexity in the light of the Quantum Computer.Michael Cuffaro - 2018 - In Hansson Sven Ove (ed.), Technology and Mathematics: Philosophical and Historical Investigations. Cham, Switzerland: Springer Verlag. pp. 253-282.
Computational complexity and Godel's incompleteness theorem.Gregory J. Chaitin - 1970 - [Rio de Janeiro,: Centro Técnico Científico, Pontifícia Universidade Católica do Rio de Janeiro. Edited by Gregory J. Chaitin.
Logic and Computational Complexity International Workshop Lcc '94, Indianapolis, in, Usa, October 13-16, 1994 : Selected Papers'.Daniel Leivant - 1995 - Springer Verlag.
Deterministic chaos and computational complexity: The case of methodological complexity reductions. [REVIEW]Theodor Leiber - 1999 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 30 (1):87-101.
The computational complexity of logical theories.Jeanne Ferrante - 1979 - New York: Springer Verlag. Edited by Charles W. Rackoff.
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
Analytics
Added to PP
2020-12-22
Downloads
10 (#1,184,994)
6 months
6 (#508,473)
2020-12-22
Downloads
10 (#1,184,994)
6 months
6 (#508,473)
Historical graph of downloads
Citations of this work
From simple associations to systematic reasoning: A connectionist representation of rules, variables, and dynamic binding using temporal synchrony.Lokendra Shastri & Venkat Ajjanagadde - 1993 - Behavioral and Brain Sciences 16 (3):417-51.
The shared circuits model. How control, mirroring, and simulation can enable imitation and mind reading.Susan Hurley - 2008 - Behavioral and Brain Sciences 31 (1):1-22.
AlphaGo, Locked Strategies, and Eco-Cognitive Openness.Lorenzo Magnani - 2019 - Philosophies 4 (1):8.
Backpropagation of Spirit: Hegelian Recollection and Human-A.I. Abductive Communities.Rocco Gangle - 2022 - Philosophies 7 (2):36.
Models of scientific explanation.Paul Thagard & Abninder Litt - 2008 - In Ron Sun (ed.), The Cambridge Handbook of Computational Psychology. Cambridge University Press. pp. 549--564.
References found in this work
A theory of diagnosis from first principles.Raymond Reiter - 1987 - Artificial Intelligence 32 (1):57-95.
Fusion, propagation, and structuring in belief networks.Judea Pearl - 1986 - Artificial Intelligence 29 (3):241-288.
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Diagnosing multiple faults.Johan de Kleer & Brian C. Williams - 1987 - Artificial Intelligence 32 (1):97-130.
Distributed revision of composite beliefs.Judea Pearl - 1987 - Artificial Intelligence 33 (2):173-215.
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-659b74868d-jrkjf uwo