Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Annals of Mathematics and Artificial Intelligence, Volume 69

> Home > Journals > Annals of Mathematics and Artificial Intelligence

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 69, Number 1, September 2013

Logics of Uncertainty

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/amai/Benferhat13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Benferhat13
Salem Benferhat:
Editorial introduction to the special issue. 1-2
- view
  authority control:
- export record
  dblp key:
  - journals/amai/PardoG13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/PardoG13
Pere Pardo, Lluís Godo:
t-DeLP: an argumentation-based Temporal Defeasible Logic Programming framework. 3-35
- view
  authority control:
- export record
  dblp key:
  - journals/amai/GottlobLMS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/GottlobLMS13
Georg Gottlob, Thomas Lukasiewicz, Maria Vanina Martinez, Gerardo I. Simari:
Query answering under probabilistic uncertainty in Datalog+ / - ontologies. 37-72
- view
  authority control:
- export record
  dblp key:
  - journals/amai/KoniecznyP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/KoniecznyP13
Sébastien Konieczny, Ramón Pino Pérez:
Confluence operators and their relationships with revision, update and merging. 73-101
- view
  authority control:
- export record
  dblp key:
  - journals/amai/GottifrediRGS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/GottifrediRGS13
Sebastian Gottifredi, Nicolás D. Rotstein, Alejandro Javier García, Guillermo Ricardo Simari:
Using argument strength for building dialectical bonsai. 103-129
- view
  authority control:
- export record
  dblp key:
  - journals/amai/AmgoudD13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/AmgoudD13
Leila Amgoud, Caroline Devred:
Argumentation frameworks as constraint satisfaction problems. 131-148

Volume 69, Number 2, October 2013

Special Issue: Learning and Intelligent Optimization: Selected Papers from LION 6

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/amai/HamadiS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/HamadiS13
Youssef Hamadi, Marc Schoenauer:
Guest editorial: special issue - revised selected papers of the LION 6 conference. 149-150
- view
  authority control:
- export record
  dblp key:
  - journals/amai/MersmannBT0BN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/MersmannBT0BN13
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
- view
  authority control:
- export record
  dblp key:
  - journals/amai/BurnsR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/BurnsR13
Ethan Burns, Wheeler Ruml:
Iterative-deepening search with on-line tree size prediction. 183-205
- view
  authority control:
- export record
  dblp key:
  - journals/amai/CasertaV13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/CasertaV13
Marco Caserta, Stefan Voß:
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing. 207-224

Volume 69, Number 3, November 2013

- view
  authority control:
- export record
  dblp key:
  - journals/amai/WulffO13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/WulffO13
Sharon Wulff, Cheng Soon Ong:
Analytic center cutting plane method for multiple kernel learning. 225-241
- view
  authority control:
- export record
  dblp key:
  - journals/amai/HadadKHR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/HadadKHR13
Meirav Hadad, Sarit Kraus, Irith Ben-Arroyo Hartman, Avi Rosenfeld:
Group planning with time constraints. 243-291
- view
  authority control:
- export record
  dblp key:
  - journals/amai/Iancu13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Iancu13
Ion Iancu:
Generalized modus Ponens using various implications and T-norm product with threshold. 293-311

Volume 69, Number 4, December 2013

Special Issue: Local Pattern Mining

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/amai/Berger-WolfH13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/Berger-WolfH13
Tanya Y. Berger-Wolf, Tamás Horváth:
Guest editors' foreword: special section on local pattern mining in graph-structured data. 313-314
- view
  authority control:
- export record
  dblp key:
  - journals/amai/GarrigaKR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/GarrigaKR13
Gemma C. Garriga, Roni Khardon, Luc De Raedt:
Mining closed patterns in relational, graph and network data. 315-342
- view
  authority control:
- export record
  dblp key:
  - journals/amai/SchietgatRB13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/SchietgatRB13
Leander Schietgat, Jan Ramon, Maurice Bruynooghe:
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. 343-376

a service of

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.