- 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
Hybrid tractability of valued constraint problems
Artificial Intelligence 175 (9-10):1555-1569 (2011)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
Hybrid artificial intelligence system in constraint based scheduling of integrated manufacturing ERP systems.Izabela Rojek & Mieczysław Jagodziński - 2012 - In Emilio Corchado, Vaclav Snasel, Ajith Abraham, Michał Woźniak, Manuel Grana & Sung-Bae Cho (eds.), Hybrid Artificial Intelligent Systems. Springer. pp. 229--240.
Hybrid backtracking bounded by tree-decomposition of constraint networks.Philippe Jégou & Cyril Terrioux - 2003 - Artificial Intelligence 146 (1):43-75.
Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value.Gianluigi Greco, Francesco Lupia & Francesco Scarcello - 2020 - Artificial Intelligence 278 (C):103180.
Three-valued semantics for hybrid MKNF knowledge bases revisited.Fangfang Liu & Jia-Huai You - 2017 - Artificial Intelligence 252 (C):123-138.
Compiling constraint satisfaction problems.Rainer Weigel & Boi Faltings - 1999 - Artificial Intelligence 115 (2):257-287.
Solving quantified constraint satisfaction problems.Ian P. Gent, Peter Nightingale, Andrew Rowley & Kostas Stergiou - 2008 - Artificial Intelligence 172 (6-7):738-771.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
Tractability of explaining classifier decisions.Martin C. Cooper & João Marques-Silva - 2023 - Artificial Intelligence 316 (C):103841.
Variable symmetry breaking in numerical constraint problems.Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo & Carme Torras - 2015 - Artificial Intelligence 229 (C):105-125.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,406,036)
6 months
5 (#836,811)
2020-12-22
Downloads
7 (#1,406,036)
6 months
5 (#836,811)
Historical graph of downloads
Citations of this work
Tractability of explaining classifier decisions.Martin C. Cooper & João Marques-Silva - 2023 - Artificial Intelligence 316 (C):103841.
References found in this work
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
The complexity of soft constraint satisfaction.David A. Cohen, Martin C. Cooper, Peter G. Jeavons & Andrei A. Krokhin - 2006 - Artificial Intelligence 170 (11):983-1016.
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.Martin C. Cooper, Peter G. Jeavons & András Z. Salamon - 2010 - Artificial Intelligence 174 (9-10):570-584.
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-6686886f5-xdvnm uwo