Journal of Algorithms, Volume 64

Volume 64, Number 1, January 2009

• Mauricio Osorio, Ivan Olmos:
  Preface. 1-2
  
• Stefania Costantini, Andrea Formisano:
  Modeling preferences and conditional preferences on resource consumption and production in ASP. 3-15
  
• Roxana Dánger, Rafael Berlanga Llavori:
  Generating complex ontology instances from documents. 16-30
  
• Alejandro Guerra-Hernández, José Martín Castro-Manzano, Amal El Fallah-Seghrouchni:
  CTL AgentSpeak(L): A specification language for agent programs. 31-40
  
• Claudia Zepeda, José Luis Carballido:
  P-stable models of strong kernel programs. 41-50
  
• David Pinto, Jorge Civera, Alberto Barrón-Cedeño, Alfons Juan, Paolo Rosso:
  A statistical approach to crosslingual natural language tasks. 51-60
  

Volume 64, Numbers 2-3, April - July 2009

• Pierre Flener, Justin Pearson:
  Solving necklace constraint problems. 61-73
  
• Tongquan Zhang, Weidong Li, Jianping Li:
  An improved approximation algorithm for the ATSP with parameterized triangle inequality. 74-78
  
• C. Cortés, José Miguel Díaz-Báñez, P. Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura:
  Bichromatic separability with two boxes: A general approach. 79-88
  
• Hugo L. Jonker, Sjouke Mauw, Jun Pang:
  A formal framework for quantifying voter-controlled privacy. 89-105
  
• Jan Treur:
  Past-future separation and normal forms in temporal predicate logic specifications. 106-124