Accepted Papers
| Limited Assignments: A New Cutoff Strategy for Incomplete Depth-First
Search Roman Bartak, Hana Rudova |
| On the Computational limits of Infinite Satisfaction Stefan Dantchev, Frank D. Valencia |
| Breaking Value Symmetries in Matrix Models using Channeling Constraints Y.C. Law, J.H.M. Lee |
| Hybrid Lagrangian Relaxation for Bandwidth-Constrained Routing:
Knapsack Decomposition Wided Ouaja, Barry Richards |
| A Branch-Price-and-Propagate Approach for Optimising IGP Weight
Setting subject to Unique Shortest Paths Farid Ajili, Robert Rodosek, Andrew Eremin |
| Solving Strategies using a Hybridization Model for Local Search
and Constraint Propagation Tony Lambert, Eric Monfroy, F. Saubion |
| Controlled Propagation in Continuous Numerical Constraint Networks Frédéric Goualard, Laurent Granvilliers |
| Timid Acquisition of Constraint Satisfaction Problems Sarah O'Connell, Barry O'Sullivan and Eugene C. Freuder |
The International Conference on Automated Planning & Scheduling (ICAPS) is the premier forum for researchers and practitioners in Intelligent Planning & Scheduling and related fields. Topics include all aspects of planning and scheduling theory and practice, including a wide spectrum of applications. The ICAPS 2005 main conference will be accompanied by a program of tutorials and workshops, a doctoral consortium, and demonstrations of planning and scheduling systems. As a novelty, the first International Competition on Knowledge Engineering for Planning will be held at the conference.
ICAPS 2005 will be take place in Monterey, California, U.S.A. between June 5 and 10 at the Hyatt Regency Monterey Resort and Conference Center.
On the Tractability of Restricted Disjunctive Temporal Problems
T. K. Satish Kumar, Stanford University,
USA
Improving Parallel Planning with Constraints on the Number of Operators
Markus Buttner, Jussi Rintanen, Albert-Ludwigs-Universitaet
Freiburg, Germany
Planning with Goal Preferences and Constraints
Ronen Brafman, Yuri Chernyavsky,
NASA Ames Research Center & Stanford University, USA
External Symbolic Heursitic Search with Pattern Databases
Stefan Edelkamp, University of Dortmund,
Germany
Genetic Planning Using Variable Length Chromosomes
Alexandre Brie, Philippe Morignot,
Ecole Polytechnique Palaiseau, France
Characterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem
Matthew Streeter, Stephen Smith,
Carnegie Mellon University, USA
Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems
Romeo Sanchez, Subbarao Kambhampati,
Arizona State University, USA
Contingent Planning via Heuristic Forward Search with Implicit Belief States
Joerg Hoffmann, Ronen Brafman, Max-Planck-Institut
fuer Informatik Saarbruecken, Germany
Concurrent Probabilistic Temporal Planning
Mausam, Daniel Weld, University
of Washington, USA
Automated Composition of Web Services by Planning in Asynchronous Domains
Marco Pistore, Paolo Traverso, Piergiorgio
Bertoli, University of Trento, Italy
Anytime Dynamic A*: An Anytime, Replanning Algorithm
Maxim Likhachev, David Ferguson,
Geoff Gordon, Anthony Stentz, Sebastian Thrun, Carnegie Mellon University,
USA
The Yoyo Planner: Going Where Hierarchical Task-Network Planning Meets With Symbolic Model Checking
Ugur Kuter, Dana Nau, Marco Pistore,
Paolo Traverso, University of Maryland, USA
Plan Repair as an Extension of Planning
Roman van der Krogt, Mathijs de Weerdt,
Delft University of Technology, Netherlands
Randomized Large Neighborhood Search for Cumulative Scheduling
Daniel Godard, Philippe Laborie,
Wim Nuitjen, ILOG, France
Minimizing Breaks in Sport Scheduling with Local Search
Pascal van Hentenryck, Yannis Vergados,
Brown University, USA
Online Stochastic Optimization Without Distributions
Pascal van Hentenryck, Russell Bent,
Brown University, USA
Learning Partial-Order Macros from Solutions
Adi Botea, Martin Mueller, Jonathan
Schaeffer, University of Alberta, Canada
Search Control in Planning for Temporally Extended Goals
Froduald Kabanza, Sylvie Thiebaux,
Universite de Sherbrooke, Canada
Activity Planning for the Mars Exploration Rovers
John Bresina, Ari Jonsson, Paul
Morris, Kanna Rajan, NASA Ames Research Center, USA
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework
Menkes van den Briel, Thomas Vossen,
Subbarao Kambhampati, Arizona State University, USA
Solving Over-constrained DTPs with Preferences
Bart Peintner, Michael Moffitt,
Martha Pollack, University of Michigan, USA
Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations
Hector Palacios, Blai Bonet, Adnan
Darwiche, Hector Geffner, Universitat Pompeu Fabra, Spain
On-line Planning and Scheduling for High-speed Manufacturing
Wheeler Ruml, Minh Do, Markus Fromherz,
Palo Alto Research Center, USA
Learning Action Models from Plan Examples with Incomplete Knowledge
Qiang Yang, K. Wu, Y. Jiang, Hong
Kong University of Science and Technology, China
Course of Action Generation for Cyber Security Using Classical Planning
Mark Boddy, Tom Haigh, Johnathan
Gohde, Steven Harp, Adventium Labs, USA
Retaining Flexibility to Maximize Quality: When the Scheduler Has the Right to Decide Activity Duration
Xiaofang Wang, Stephen Smith, Carnegie
Mellon University, USA
Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems
Laurence Kramer, Stephen Smith,
Carnegie Mellon University, USA
A Generalized Framework for Lifelong Planning A*
Maxim Likhachev, Sven Koenig, Carnegie
Mellon University, USA
Fast Exact Planning in Markov Decision Processes
H. Brendan McMahan, Geoff Gordon,
Carnegie Mellon University, USA
Beam-Stack Search: Integrating Backtracking with Beam Search
Rong Zhou, Eric Hansen, Mississippi
State University, USA
Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction
I-shiang Shu, Robert Effinger, Brian
Williams, MIT, USA
Discovering Planning Invariants as Anomalies in State Descriptions
Proshanto Mukherji, Lenhart Schubert,
University of Rochester, USA
Planning As Mixed-initiative Goal Manipulation
Michael Cox, Chen Zhang, Wright State University, USA
| Marco Benedetti. Evaluating QBFs via Symbolic Skolemization |
| Ullrich Hustadt, Boris Motik and Ulrike Sattler. A Decomposition Rule for Decision Procedures by Resolution-based Calculi |
| Carsten Schuermann and Mark-Oliver Stehr. An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf |
| Nathan Whitehead and Martín Abadi. BCiC: A System for Code Authentication and Verification |
| Mark Bickford, Robert Constable, Joseph Halpern and Sabina Petride. Knowledge-Based Synthesis of Distributed Systems Using Event Structures |
| Christoph Walther and Stephan Schweitzer. Automated Termination Analysis for Incompletely Defined Programs |
| Christopher Hardin. How the Location of * Influences Complexity in Kleene Algebra with Tests |
| Thomas Linke and Vladimir Sarsakov. Suitable Graphs for Answer Set Programming |
| Pascal Fontaine, Silvio Ranise and Calogero G. Zarba. Combining Lists with Non-Stably Infinite Theories |
| Thomas Eiter, Giovambattista Ianni, Roman Schindlauer and Hans Tompits. Nonmonotonic Description Logic Programs: Implementation & Experiments |
| Lennart Beringer, Martin Hofmann, Alberto Momigliano and Olha Shkaravska. Automatic Certification of Heap Consumption |
| George Metcalfe, Agata Ciabattoni and Christian Fermueller. Uniform Rules and Dialogue Games for Fuzzy Logics |
| Jerzy Marcinkowski, Jan Otop and Grzegorz Stelmaszek. On a Semantic Subsumption Test |
| Miyuki Koshimura, Mayumi Umeda and Ryuzo Hasegawa. Abstract Model Generation for Preprocessing Clause Sets |
| Albert Oliveras, Robert Nieuwenhuis and Cesare Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories |
| Vilhelm Dahllof. Applications of General Exact Satisfiability in Propositional Logic Modelling |
| Roberto Di Cosmo and Thomas Dufour. The theory of <N,0,1,+,.,^> is decidable, but not finitely axiomatisable. |
| Dietmar Berwanger and Erich Graedel. Entanglement -- A Measure for the Complexity of Directed Graphs With Applications to Logic and Games |
| Kevin Donnelly, Tyler Gibson, Neel Krishnaswami, Stephen Magill and Sungwoo Park. The Inverse Method for the Logic of Bunched Implications |
| Jeff Polakow and Pablo Lopez. Implementing Efficient Resource Management for Linear Logic Programming |
| Daniel Gorín and Carlos Areces. Ordered resolution with selection for H(@) |
| Paul Hankes Drielsma, Sebastian Mödersheim and Luca Viganò. A Formalization of Off-Line Guessing for Security Protocol Analysis |
| Davy Van Nieuwenborgh, Stijn Heymans and Dirk Vermeir. Weighted Answer Sets and Applications in Intelligence Analysis |
| Norbert Schirmer. A Verification Environment for Sequential Imperative Programs in Isabelle/HOL |
| Bejamin Aminof, Thomas Ball and Orna Kupferman. Reasoning about Systems with Transition Fairness |
| Helmut Seidl and Kumar Neeraj Verma. Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying |
| Flavio L. C. de Moura, Fairouz Kamareddine and Mauricio Ayala Rincon. Second-Order Matching via Explicit Substitutions |
| Jamshid Bagherzadeh and S. Arun-Kumar . Layered Clausal Resolution in the Multi-Modal Logic of Beliefs and Goals |
| Stefan Hetzl, Matthias Baaz, Alexander Leitsch, Clemens Richter and Hendrik Spohr. Cut-Elimination: Experiments with CERES |
| Lucas Bordeaux, Marco Cadoli and Toni Mancini. Exploiting Fixable, Substitutable and Determined Values in Constraint Satisfaction Problems |
| German Puebla, Manuel Hermenegildo and Elvira Albert. Abstraction-Carrying Code |
| Christoph Benzmueller, Volker Sorge, Mateja Jamnik and Manfred Kerber. Can a Higher-Order and a First-Order Theorem Prover Cooperate? |
| Gustav Nordh. A Trichotomy in the Complexity of Propositional Circumscription |