- Learning general constraints in CSP.Michael Veksler & Ofer Strichman - 2016 - Artificial Intelligence 238:135-153.details
|
|
|
Reasoning about qualitative temporal information.Peter van Beek - 1992 - Artificial Intelligence 58 (1-3):297-326.details
|
|
|
Efficient solution techniques for disjunctive temporal reasoning problems.Ioannis Tsamardinos & Martha E. Pollack - 2003 - Artificial Intelligence 151 (1-2):43-89.details
|
|
|
State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.Marcel Steinmetz & Jörg Hoffmann - 2017 - Artificial Intelligence 245 (C):1-37.details
|
|
|
Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.details
|
|
|
Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.details
|
|
|
An empirical study of phase transitions in binary constraint satisfaction problems.Patrick Prosser - 1996 - Artificial Intelligence 81 (1-2):81-109.details
|
|
|
Concurrent forward bounding for distributed constraint optimization problems.Arnon Netzer, Alon Grubshtein & Amnon Meisels - 2012 - Artificial Intelligence 193 (C):186-216.details
|
|
|
Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference. [REVIEW]Pedro Meseguer & Carme Torras - 2001 - Artificial Intelligence 129 (1-2):133-163.details
|
|
|
Memory intensive AND/OR search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1492-1524.details
|
|
|
AND/OR Branch-and-Bound search for combinatorial optimization in graphical models.Radu Marinescu & Rina Dechter - 2009 - Artificial Intelligence 173 (16-17):1457-1491.details
|
|
|
The complexity of constraint satisfaction revisited.Alan K. Mackworth & Eugene C. Freuder - 1993 - Artificial Intelligence 59 (1-2):57-62.details
|
|
|
A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.details
|
|
|
Bounding the cost of learned rules.Jihie Kim & Paul S. Rosenbloom - 2000 - Artificial Intelligence 120 (1):43-80.details
|
|
|
On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning.Subbarao Kambhampati - 1998 - Artificial Intelligence 105 (1-2):161-208.details
|
|
|
Failure driven dynamic search control for partial order planners: an explanation based approach.Subbarao Kambhampati, Suresh Katukam & Yong Qu - 1996 - Artificial Intelligence 88 (1-2):253-315.details
|
|
|
Local search with constraint propagation and conflict-based heuristics.Narendra Jussien & Olivier Lhomme - 2002 - Artificial Intelligence 139 (1):21-45.details
|
|
|
Hybrid backtracking bounded by tree-decomposition of constraint networks.Philippe Jégou & Cyril Terrioux - 2003 - Artificial Intelligence 146 (1):43-75.details
|
|
|
Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.details
|
|
|
Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.details
|
|
|
Fuzzy constraint networks for signal pattern recognition.P. Félix, S. Barro & R. Marín - 2003 - Artificial Intelligence 148 (1-2):103-140.details
|
|
|
New Tableau Characterizations for Non-clausal MaxSAT Problem.Guido Fiorino - 2022 - Logic Journal of the IGPL 30 (3):422-436.details
|
|
|
EXPtime tableaux for ALC.Francesco M. Donini & Fabio Massacci - 2000 - Artificial Intelligence 124 (1):87-138.details
|
|
|
Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.details
|
|
|
Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.details
|
|
|
Structure-driven algorithms for truth maintenance.Rina Dechter & Avi Dechter - 1996 - Artificial Intelligence 82 (1-2):1-20.details
|
|
|
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.details
|
|
|
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.details
|
|
|
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.details
|
|
|
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism.Claudio Castellini, Enrico Giunchiglia & Armando Tacchella - 2003 - Artificial Intelligence 147 (1-2):85-117.details
|
|
|
Arc-consistency and arc-consistency again.Christian Bessière - 1994 - Artificial Intelligence 65 (1):179-190.details
|
|
|
Metaqueries: Semantics, complexity, and efficient algorithms.Rachel Ben-Eliyahu-Zohary, Ehud Gudes & Giovambattista Ianni - 2003 - Artificial Intelligence 149 (1):61-87.details
|
|
|
Default reasoning using classical logic.Rachel Ben-Eliyahu & Rina Dechter - 1996 - Artificial Intelligence 84 (1-2):113-150.details
|
|
|
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem.Ann Becker & Dan Geiger - 1996 - Artificial Intelligence 83 (1):167-188.details
|
|
|
An optimal backtrack algorithm for tree-structured constraint satisfaction problems.Roberto J. Bayardo & Daniel P. Miranker - 1994 - Artificial Intelligence 71 (1):159-181.details
|
|
|
Partition-based logical reasoning for first-order and propositional theories.Eyal Amir & Sheila McIlraith - 2005 - Artificial Intelligence 162 (1-2):49-88.details
|
|
