Artificial Intelligence, Volume 170

Volume 170, Number 1, January 2006

Sanjiang Li, Huaiqing Wang:
RCC8 binary constraint network can be consistently extended. 1-18
Russell Greiner, Ryan Hayward, Magdalena Jankowska, Michael Molloy:
Finding optimal satisficing strategies for and-or trees. 19-58

Maria Fox, Malik Ghallab, Guillaume Infantes, Derek Long:
Robot introspection through learned hidden Markov models. 59-113
Phan Minh Dung, Robert A. Kowalski, Francesca Toni:
Dialectic proof procedures for assumption-based, admissible argumentation. 114-159
Joohyung Lee, Fangzhen Lin:
Loop formulas for circumscription. 160-185

Benjamin W. Wah, Yixin Chen:
Constraint partitioning in penalty formulations for solving temporal planning problems. 187-231
Gianfranco Lamperti, Marina Zanella:
Flexible diagnosis of discrete-event systems by similarity-based reasoning techniques. 232-297
Vincent Vidal, Hector Geffner:
Branching and pruning: An optimal temporal POCL planner based on constraint programming. 298-335

Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri, Paolo Traverso:
Strong planning under partial observability. 337-384
Rong Zhou, Eric A. Hansen:
Breadth-first heuristic search. 385-408
Shou de Lin, Kevin Knight:
Discovering the linear writing order of a two-dimensional ancient hieroglyphic script. 409-421
Xianchao Xie, Zhi Geng, Qiang Zhao:
Decomposition of structural learning about directed acyclic graphs. 422-439
Roie Zivan, Amnon Meisels:
Concurrent search for distributed CSPs. 440-461
Franz Huber:
Ranking functions and rankings on languages. 462-471
Ivayla Vatcheva, Hidde de Jong, Olivier Bernard, Nicolaas J. I. Mars:
Experiment selection for the discrimination of semi-quantitative models of dynamical systems. 472-506

Jörg Hoffmann, Ronen I. Brafman:
Conformant planning via heuristic forward search: A new approach. 507-541
Thomas Eiter, Thomas Lukasiewicz:
Causes and explanations in the structural-model approach: Tractable cases. 542-580
Mingsheng Ying:
Linguistic quantifiers modeled by Sugeno integrals. 581-606
Vincent Conitzer, Tuomas Sandholm:
Complexity of constructing solutions in the core based on synergies among coalitions. 607-619
Mitja Lustrek, Matjaz Gams, Ivan Bratko:
Is real-valued minimax pathological? 620-642
Francesco Savelli:
Existential assertions and quantum levels on the tree of the situation calculus. 643-652

David Maxwell Chickering, Christopher Meek:
On the incompatibility of faithfulness and monotone DAG faithfulness. 653-666
M. Rebolledo:
Rough intervals - enhancing intervals for qualitative modeling of technical systems. 667-685
Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans:
Constraint-based optimization and utility elicitation using the minimax decision criterion. 686-713
Sharlee Climer, Weixiong Zhang:
Cut-and-solve: An iterative search strategy for combinatorial optimization problems. 714-738
Yan Zhang, Norman Y. Foo:
Solving logic program conflict through strong and weak forgettings. 739-778
Marco Cadoli, Toni Mancini:
Automated reformulation of specifications by safe delay of constraints. 779-801

Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh:
Propagation algorithms for lexicographic ordering constraints. 803-834
Michael Wooldridge, Paul E. Dunne:
On the computational complexity of coalitional resource games. 835-871
Silvana Badaloni, Massimiliano Giacomin:
The algebra IA^fuz: a framework for qualitative fuzzy temporal reasoning. 872-908

Weiru Liu:
Analyzing the degree of conflict among belief functions. 909-924
Giuseppe Carenini, Johanna D. Moore:
Generating and evaluating evaluative arguments. 925-952
Riccardo Poli, William B. Langdon:
Backward-chaining evolutionary algorithms. 953-982
David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin:
The complexity of soft constraint satisfaction. 983-1016
Erik T. Mueller:
Event calculus and temporal action logics compared. 1017-1029

Jussi Rintanen, Keijo Heljanko, Ilkka Niemelä:
Planning as satisfiability: parallel plans and algorithms for plan search. 1031-1080

Alan Fern, Robert Givan:
Sequential inference with reliable observations: Learning to construct force-dynamic models. 1081-1100
Aron Culotta, Trausti T. Kristjansson, Andrew McCallum, Paul A. Viola:
Corrective feedback and persistent learning for information extraction. 1101-1122

Robert C. Holte, Ariel Felner, Jack Newton, Ram Meshulam, David Furcy:
Maximizing over multiple pattern databases speeds up heuristic search. 1123-1136
Ole J. Mengshoel, David C. Wilkins, Dan Roth:
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering. 1137-1174
Susan Craw, Nirmalie Wiratunga, Ray Rowe:
Learning adaptation knowledge to improve case-based reasoning. 1175-1192

Special Review Issue

Field review

Book reviews

Michael L. Anderson:
Strike while the iron is. 1213-1217
Roger B. Dannenberg:
David Cope, Computer Models of Musical Creativity, MIT Press (2005). 1218-1221
Tim Oates, Waiyian Chong:
Marcus Hutter, Universal Artificial Intelligence, Springer (2004). 1222-1226
Drew V. McDermott:
Kurzweil's argument for the success of AI. 1227-1233
William J. Idsardi:
Three books on language: pro-Noam, anti-Noam, net-Noam. 1234-1236
Tom Costello, John McCarthy:
Jon Doyle, Extending Mechanics to Minds: The Mechanical Foundations of Psychology and Economics, Cambridge University Press (2006). 1237-1238
Leora Morgenstern:
Knowledge representation and commonsense reasoning: Reviews of four books. 1239-1250

The Turing Tapes: Comments and Controversies in AI

Lee Spector:
Evolution of artificial intelligence. 1251-1253
Roger C. Schank:
Once upon a time in AI. 1254-1255
Terry Winograd:
Shifting viewpoints: Artificial intelligence and human-computer interaction. 1256-1258

Last update Sat May 18 20:00:44 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page