![](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
AI Communications, Volume 24
Volume 24, Number 1, 2011
- Martin C. Cooper
, Marie de Roquemaurel, Pierre Régnier:
A weighted CSP approach to cost-optimal planning. 1-29 - Pasquale De Meo, Antonino Nocera, Domenico Rosaci, Domenico Ursino:
Recommendation of reliable users, social networks and high-quality resources in a Social Internetworking System. 31-50 - Xiaofang Wang, Nicola Policella, Stephen F. Smith, Angelo Oddi
:
Constraint-based methods for scheduling discretionary services. 51-73 - Geoff Sutcliffe
:
The 5th IJCAR automated theorem proving system competition - CASC-J5. 75-89 - Johan Wittocx:
Finite domain and symbolic inference methods for extensions of first-order logic. 91-93 - Leander Schietgat:
Graph-based data mining for biological applications. 95-96 - Francisco Martínez-Álvarez
:
Clustering preprocessing to improve time series forecasting. 97-98 - Axel J. Soto
:
On the use of machine learning methods for modern drug discovery. 99-100 - Josep Argelich
:
Max-SAT formalisms with hard and soft constraints. 101-103
Volume 24, Number 2, 2011
- Marcello Balduccini, Stefan Woltran:
Special issue on answer set programming. 105-106 - Martin Gebser, Benjamin Kaufmann, Roland Kaminski, Max Ostrowski, Torsten Schaub
, Marius Schneider
:
Potassco: The Potsdam Answer Set Solving Collection. 107-124 - Mario Alviano
, Wolfgang Faber
:
Dynamic Magic Sets and super-coherent answer set programs. 125-145 - Marcello Balduccini:
Learning and using domain-specific heuristics in ASP solvers. 147-164 - Pedro Cabalar:
A logical characterisation of ordered disjunction. 165-175 - Christian Drescher, Oana Tifrea, Toby Walsh:
Symmetry-breaking answer set solving. 177-194 - Martin Gebser, Orkunt Sabuncu, Torsten Schaub
:
An incremental answer set programming based system for finite model computation. 195-212
Volume 24, Number 3, 2011
- Amin Nikanjam
, Hadi Sharifi, Adel Torkaman Rahmani:
Efficient model building in competent genetic algorithms using DSM clustering. 213-231 - Natalia Criado
, Estefania Argente
, Vicente J. Botti
:
Open issues for normative multi-agent systems. 233-264 - Luca Console, Ilaria Lombardi, Claudia Picardi, Rossana Simeoni:
Toward a social web of intelligent things. 265-279 - Roberto Carbone
:
LTL model-checking for security protocols. 281-283 - Alberto Freitas
:
Building cost-sensitive decision trees for medical applications. 285-287 - Marcos Aurélio Domingues
:
Exploiting multidimensional data for web site automation. 289-290 - Montserrat Batet
:
Ontology-based semantic clustering. 291-292
Volume 24, Number 4, 2011
- Omkar J. Tilak, Snehasis Mukhopadhyay:
Partially decentralized reinforcement learning in finite, multi-agent Markov decision processes. 293-309 - Francesco Calimeri
, Susanna Cozza, Giovambattista Ianni, Nicola Leone
:
Finitely recursive programs: Decidability and bottom-up computation. 311-334 - Cristina Urdiales:
The bare necessities: Adaptive assistance for wheelchair control. 337-339 - Michael Katz:
Implicit abstraction heuristics for cost-optimal planning. 343-345 - Jorge A. Baier:
Planning with rich goals, preferences and procedural operators via reformulation. 347-348 - Siddharth Srivastava:
Foundations and applications of generalized planning. 349-351
![](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.