- 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 some tractable classes in deduction and abduction
Artificial Intelligence 116 (1-2):297-313 (2000)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
What makes propositional abduction tractable.Gustav Nordh & Bruno Zanuttini - 2008 - Artificial Intelligence 172 (10):1245-1284.
Tractable approximate deduction for OWL.Jeff Z. Pan, Yuan Ren & Yuting Zhao - 2016 - Artificial Intelligence 235 (C):95-155.
Characterising tractable constraints.Martin C. Cooper, David A. Cohen & Peter G. Jeavons - 1994 - Artificial Intelligence 65 (2):347-361.
Tractable reasoning via approximation.Marco Schaerf & Marco Cadoli - 1995 - Artificial Intelligence 74 (2):249-310.
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
Backdoors to tractable answer set programming.Johannes Klaus Fichte & Stefan Szeider - 2015 - Artificial Intelligence 220 (C):64-103.
Augmenting tractable fragments of abstract argumentation.Wolfgang Dvořák, Sebastian Ordyniak & Stefan Szeider - 2012 - Artificial Intelligence 186 (C):157-173.
Tractable approximations for temporal constraint handling.Robin Hirsch - 2000 - Artificial Intelligence 116 (1-2):287-295.
Tractable combinatorial auctions and b-matching.Moshe Tennenholtz - 2002 - Artificial Intelligence 140 (1-2):231-243.
Interpretation as abduction.Jerry R. Hobbs, Mark E. Stickel, Douglas E. Appelt & Paul Martin - 1993 - Artificial Intelligence 63 (1-2):69-142.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,459,590)
6 months
3 (#1,061,821)
2020-12-22
Downloads
11 (#1,459,590)
6 months
3 (#1,061,821)
Historical graph of downloads
Citations of this work
What makes propositional abduction tractable.Gustav Nordh & Bruno Zanuttini - 2008 - Artificial Intelligence 172 (10):1245-1284.
Complexity results for explanations in the structural-model approach.Thomas Eiter & Thomas Lukasiewicz - 2004 - Artificial Intelligence 154 (1-2):145-198.
References found in this work
Abduction versus closure in causal theories.Kurt Konolige - 1992 - Artificial Intelligence 53 (2-3):255-272.
Support set selection for a bductive and default reasoning.Bart Selman & Hector J. Levesque - 1996 - Artificial Intelligence 82 (1-2):259-272.
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-99fc7d78b-s277s uwo