Computing and Library Services - delivering an inspiring information environment

Common Subexpressions in Constraint Models of Planning Problems.

Rendl, Andrea, Miguel, Ian, Gent, Ian P. and Gregory, Peter (2009) Common Subexpressions in Constraint Models of Planning Problems. In: Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009. AAAI Press, California, USA, 128 - 135. ISBN 978-1-57735-433-8

Metadata only available from this repository.


Constraint Programming is an attractive approach for solving
AI planning problems by modelling them as Constraint Satisfaction
Problems (CSPs). However, formulating effective
constraint models of complex planning problems is challenging,
and CSPs resulting from standard approaches often require
further enhancement to perform well. Common subexpression
elimination is a computationally cheap and general
technique for improving CSPs, which can lead to a great reduction
in instance size, solving time and search space. In this
work we identify general causes of common subexpressions
from three modelling techniques often used to encode planning
problems into constraints. We present four case studies
of constraint models of AI planning problems. In each, we
describe the constraint model, highlight the sources of common
subexpressions, and present an empirical analysis of the
effects of eliminating common subexpressions

Item Type: Book Chapter
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Schools: School of Computing and Engineering
School of Computing and Engineering > Informatics Research Group > Knowledge Engineering and Intelligent Interfaces
Related URLs:
Depositing User: Peter Gregory
Date Deposited: 10 Jan 2012 11:24
Last Modified: 14 Feb 2012 11:15

Item control for Repository Staff only:

View Item

University of Huddersfield, Queensgate, Huddersfield, HD1 3DH Copyright and Disclaimer All rights reserved ©