default search action
Annals of Mathematics and Artificial Intelligence, Volume 69
Volume 69, Number 1, September 2013
- Salem Benferhat:
Editorial introduction to the special issue. 1-2 - Pere Pardo, Lluís Godo:
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework. 3-35 - Georg Gottlob, Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari:
Query answering under probabilistic uncertainty in Datalog+ / - ontologies. 37-72 - Sébastien Konieczny, Ramón Pino Pérez:
Confluence operators and their relationships with revision, update and merging. 73-101 - Sebastian Gottifredi, Nicolás D. Rotstein, Alejandro Javier García, Guillermo Ricardo Simari:
Using argument strength for building dialectical bonsai. 103-129 - Leila Amgoud, Caroline Devred:
Argumentation frameworks as constraint satisfaction problems. 131-148
Volume 69, Number 2, October 2013
- Youssef Hamadi, Marc Schoenauer:
Guest editorial: special issue - revised selected papers of the LION 6 conference. 149-150 - Olaf Mersmann, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, Frank Neumann:
A novel feature-based approach to characterize algorithm performance for the traveling salesperson problem. 151-182 - Ethan Burns, Wheeler Ruml:
Iterative-deepening search with on-line tree size prediction. 183-205 - Marco Caserta, Stefan Voß:
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. 207-224
Volume 69, Number 3, November 2013
- Sharon Wulff, Cheng Soon Ong:
Analytic center cutting plane method for multiple kernel learning. 225-241 - Meirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld:
Group planning with time constraints. 243-291 - Ion Iancu:
Generalized modus Ponens using various implications and T-norm product with threshold. 293-311
Volume 69, Number 4, December 2013
- Tanya Y. Berger-Wolf, Tamás Horváth:
Guest editors' foreword: special section on local pattern mining in graph-structured data. 313-314 - Gemma C. Garriga, Roni Khardon, Luc De Raedt:
Mining closed patterns in relational, graph and network data. 315-342 - Leander Schietgat, Jan Ramon, Maurice Bruynooghe:
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. 343-376
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.