Abstract is missing.
- Look-back Techniques for ASP Programs with AggregatesWolfgang Faber 0001, Nicola Leone, Marco Maratea, Francesco Ricca. [doi]
- Experimental Evaluation of Modern Variable Selection Strategies in Constraint Satisfaction ProblemsThanasis Balafoutis, Kostas Stergiou. [doi]
- A SAT-based Method for Solving the Two-dimensional Strip Packing ProblemTakehide Soh, Katsumi Inoue, Naoyuki Tamura, Mutsunori Banbara, Hidetomo Nabeshima. [doi]
- Distributed Cluster Tree EliminationIsmel Brito, Pedro Meseguer. [doi]
- CNF Instances from the Software Package Installation ProblemJosep Argelich, Inês Lynce. [doi]
- Experiencing ASP with Real World ApplicationsGiorgio Terracina, Erika De Francesco, Claudio Panetta, Nicola Leone. [doi]
- Belief Merging without Distance MeasuresMaria del Pilar Pozos Parra, Verónica Borja Macías. [doi]
- A Statistical Analysis of the Features of a Dynamic Tabu Search Algorithm for Course Timetabling ProblemsRuggero Bellio, Luca Di Gaspero, Andrea Schaerf. [doi]
- Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean FormulasC. Guillen, A. Lopez Lopez, G. De Ita. [doi]
- The SLGAD Procedure for Inference on Logic Programs with Annotated DisjunctionsFabrizio Riguzzi. [doi]
- Combinatorial Optimization Solutions for the Maximum Quartet Consistency ProblemAntónio Morgado, João Marques-Silva. [doi]
- Preprocessing Techniques for QBFsEnrico Giunchiglia, Paolo Marin, Massimo Narizzano. [doi]
- Solving Dynamic Constraint Satisfaction Problems by Identifying Stable FeaturesRichard J. Wallace, Diarmuid Grimes, Eugene C. Freuder. [doi]
- Efficient Plan Adaptation through Replanning Windows and Heuristic GoalsAlfonso Gerevini, Ivan Serina. [doi]