- Solving connected row convex constraints by variable elimination.Yuanlin Zhang & Satyanarayana Marisetti - 2009 - Artificial Intelligence 173 (12-13):1204-1219.details
|
|
Embedding Logics in the Local Computation Framework.Nic Wilson & Jérôme Mengin - 2001 - Journal of Applied Non-Classical Logics 11 (3):239-267.details
|
|
Practical solution techniques for first-order MDPs.Scott Sanner & Craig Boutilier - 2009 - Artificial Intelligence 173 (5-6):748-788.details
|
|
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering.Ole J. Mengshoel, David C. Wilkins & Dan Roth - 2006 - Artificial Intelligence 170 (16-17):1137-1174.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
|
|
A logical approach to efficient Max-SAT solving.Javier Larrosa, Federico Heras & Simon de Givry - 2008 - Artificial Intelligence 172 (2-3):204-233.details
|
|
Semiring induced valuation algebras: Exact and approximate local computation algorithms.J. Kohlas & N. Wilson - 2008 - Artificial Intelligence 172 (11):1360-1399.details
|
|
Algorithms and complexity results for persuasive argumentation.Eun Jung Kim, Sebastian Ordyniak & Stefan Szeider - 2011 - Artificial Intelligence 175 (9-10):1722-1736.details
|
|
Unifying tree decompositions for reasoning in graphical models.Kalev Kask, Rina Dechter, Javier Larrosa & Avi Dechter - 2005 - Artificial Intelligence 166 (1-2):165-193.details
|
|
A general scheme for automatic generation of search heuristics from specification dependencies☆☆preliminary versions of this paper were presented in [15,16,18]. This work was supported in part by nsf grant iis-0086529 and by muri onr award n00014-00-1-0617. [REVIEW]Kalev Kask & Rina Dechter - 2001 - Artificial Intelligence 129 (1-2):91-131.details
|
|
PRM inference using Jaffray & Faÿ’s Local Conditioning.Christophe Gonzales & Pierre-Henri Wuillemin - 2011 - Theory and Decision 71 (1):33-62.details
|
|
Decision making with multiple objectives using GAI networks.C. Gonzales, P. Perny & J. Ph Dubus - 2011 - Artificial Intelligence 175 (7-8):1153-1179.details
|
|
SampleSearch: Importance sampling in presence of determinism.Vibhav Gogate & Rina Dechter - 2011 - Artificial Intelligence 175 (2):694-729.details
|
|
New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.details
|
|
On the state of the art in machine learning: A personal review.Peter A. Flach - 2001 - Artificial Intelligence 131 (1-2):199-222.details
|
|
Sequential inference with reliable observations: Learning to construct force-dynamic models.Alan Fern & Robert Givan - 2006 - Artificial Intelligence 170 (14-15):1081-1100.details
|
|
Topological parameters for time-space tradeoff.Rina Dechter & Yousri El Fattah - 2001 - Artificial Intelligence 125 (1-2):93-118.details
|
|
AND/OR search spaces for graphical models.Rina Dechter & Robert Mateescu - 2007 - Artificial Intelligence 171 (2-3):73-106.details
|
|
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.details
|
|
A penalty‐logic simple‐transition model for structured sequences.Alan Fern - 2009 - In L. Magnani (ed.), Computational Intelligence. pp. 25--4.details
|
|