![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Artificial Intelligence, Volume 132
Volume 132, Number 1, October 2001
- Basilis Boutsinas, Michael N. Vrahatis:
Artificial nonmonotonic neural networks. 1-38 - Bruno Bouzy, Tristan Cazenave:
Computer Go: An AI oriented survey. 39-103 - Bernd S. W. Schröder
:
Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard. 105-117
Volume 132, Number 2, November 2001
- Dale Schuurmans, Finnegan Southey:
Local search characteristics of incomplete SAT procedures. 121-150 - Minh Binh Do, Subbarao Kambhampati:
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. 151-182 - Kate Larson
, Tuomas Sandholm:
Bargaining with limited computation: Deliberation equilibrium. 183-217 - Günther Gediga, Ivo Düntsch
:
Rough approximation quality revisited. 219-234
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.