On optimizing over lift-and-project closures

The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by computing all mixed integer Gomory cuts read from all tableau's corresponding to feasible and infeasible bases. In this paper, we present an algorithm for approximating the value of the lift-and-project closure. The originality of our method is that it is based on a very simple cut generation linear programming problem which is obtained from the original linear relaxation by simply modifying the bounds on the variables and constraints. This separation LP can also be seen as the dual of the cut generation LP used in disjunctive programming procedures with a particular normalization. We study some properties of this separation LP in particular relating it to the equivalence between lift-and-project cuts and Gomory cuts shown by Balas and Perregaard. Finally, we present some computational experiments and comparisons with recent related works

CHR as grammar formalism. A first report

Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.Comment: 12 pages. Presented at ERCIM Workshop on Constraints, Prague, Czech Republic, June 18-20, 200

Edsger Wybe Dijkstra (1930 -- 2002): A Portrait of a Genius

We discuss the scientific contributions of Edsger Wybe Dijkstra, his opinions and his legacy.Comment: 10 pages. To appear in Formal Aspects of Computin

Logic Programming for Describing and Solving Planning Problems

A logic programming paradigm which expresses solutions to problems as stable models has recently been promoted as a declarative approach to solving various combinatorial and search problems, including planning problems. In this paradigm, all program rules are considered as constraints and solutions are stable models of the rule set. This is a rather radical departure from the standard paradigm of logic programming. In this paper we revisit abductive logic programming and argue that it allows a programming style which is as declarative as programming based on stable models. However, within abductive logic programming, one has two kinds of rules. On the one hand predicate definitions (which may depend on the abducibles) which are nothing else than standard logic programs (with their non-monotonic semantics when containing with negation); on the other hand rules which constrain the models for the abducibles. In this sense abductive logic programming is a smooth extension of the standard paradigm of logic programming, not a radical departure.Comment: 8 pages, no figures, Eighth International Workshop on Nonmonotonic Reasoning, special track on Representing Actions and Plannin

The linear matching method applied to the high temperature life integrity of structures. Part 1. Assessments involving constant residual stress fields

Design and life assessment procedures for high temperatures are based on 'expert knowledge' in structural mechanics and materials science, combined with simplified methods of structural analysis. Of these R5 is one of the most widely used life assessment methods internationally with procedures based on reference stress techniques and shakedown calculations using linear elastic solutions. These have been augmented by full finite element analysis and, recently, the development of a new programming method, the Linear Matching Method (LMM), that allows a range of direct solutions that include shakedown methods and simplified analysis in excess of shakedown. In this paper LMM procedures are compared with calculations typical of those employed in R5 for cyclic loading problems when the assumption of a constant residual stress field is appropriate including shakedown and limit analyses, creep rupture analysis and the evaluation of accumulated creep deformation. A typical example of a 3D holed plate subjected to a cyclic thermal load and a constant mechanical load is assessed in detail. These comparisons demonstrate the significant advantages of linear matching methods for a typical case. For a range of cyclic problems when the residual stress field varies during the cycle, which include the evaluation of plastic strain amplitude, ratchet limit and accumulated creep strains during a high temperature dwell periods, the corresponding LMM and R5 procedures are discussed in an accompanying paper

Applying XP Ideas Formally: The Story Card and Extreme X-Machines

By gathering requirements on story cards extreme programming (XP) makes requirements collection easy. However it is less clear how the story cards are translated into a �finished product. We propose that a formal specification method based on X-Machines can be used to direct this transition. Extreme X-Machines �t in to the XP method well, without large overheads in design and maintenance. We also investigate how such machines adapt to change in the story cards and propose how this could be further enhanced