- 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
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms
Artificial Intelligence 296 (C):103505 (2021)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Algorithms for estimating the partition function of restricted Boltzmann machines.Oswin Krause, Asja Fischer & Christian Igel - 2020 - Artificial Intelligence 278 (C):103195.
Algorithms for electric vehicle scheduling in large-scale mobility-on-demand schemes.Emmanouil S. Rigas, Sarvapali D. Ramchurn & Nick Bassiliades - 2018 - Artificial Intelligence 262 (C):248-278.
Consistency restoration and explanations in dynamic CSPs—Application to configuration.Jérôme Amilhastre, Hélène Fargier & Pierre Marquis - 2002 - Artificial Intelligence 135 (1-2):199-234.
Concurrent search for distributed CSPs.Roie Zivan & Amnon Meisels - 2006 - Artificial Intelligence 170 (4-5):440-461.
Accelerating filtering techniques for numeric CSPs.Yahia Lebbah & Olivier Lhomme - 2002 - Artificial Intelligence 139 (1):109-132.
Solving infinite-domain CSPs using the patchwork property.Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak & George Osipov - 2023 - Artificial Intelligence 317 (C):103880.
Iterative voting and acyclic games.Reshef Meir, Maria Polukarov, Jeffrey S. Rosenschein & Nicholas R. Jennings - 2017 - Artificial Intelligence 252 (C):100-122.
Limitations of acyclic causal graphs for planning.Anders Jonsson, Peter Jonsson & Tomas Lööw - 2014 - Artificial Intelligence 210 (C):36-55.
Approximation and hardness of Shift-Bribery.Piotr Faliszewski, Pasin Manurangsi & Krzysztof Sornat - 2021 - Artificial Intelligence 298 (C):103520.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Analytics
Added to PP
2021-04-16
Downloads
25 (#879,283)
6 months
12 (#294,748)
2021-04-16
Downloads
25 (#879,283)
6 months
12 (#294,748)
Historical graph of downloads
Citations of this work
Solving infinite-domain CSPs using the patchwork property.Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak & George Osipov - 2023 - Artificial Intelligence 317 (C):103880.
References found in this work
A Spatial Logic Based on Regions and Connection.David Randell, Cui A., Cohn Zhan & G. Anthony - 1992 - KR 92:165--176.
On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus.Jochen Renz & Bernhard Nebel - 1999 - Artificial Intelligence 108 (1-2):69-123.
An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
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-667477cd97-lv8mh dc2