<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8068</REFNUM><AUTHORS><AUTHOR>Miller,A.</AUTHOR></AUTHORS><YEAR>2005</YEAR><TITLE>Improved lower bounds for solving the minimal open stacks problem</TITLE><PLACE_PUBLISHED>Proceedings of the constraint modelling challenge, in conjuction with the fifth workshop on modelling and solving problems with constraints held at IJCAI'05, Edinburgh UK, July 2005.</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>36--43</PAGES><LABEL>Miller:2005:8068</LABEL><KEYWORDS><KEYWORD>model checking</KEYWORD></KEYWORDS<ABSTRACT>In this paper we demonstrate the benefit of calculating good lower bounds for the value of M, the maximum number of open stacks, for an optimal solution. We give several theoretical results and illustrate their use when applying a model checking approach to find solutions. The improvement afforded is equally valid when a constraints modelling approach is taken.</ABSTRACT></RECORD></RECORDS></XML>