Access Restriction

Author Enea, Constantin ♦ Habermehl, Peter ♦ Inverso, Omar ♦ Parlato, Gennaro
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Integer Linear ♦ Fo-definable Class ♦ New Result Link ♦ Ilp Instance ♦ Alternative Decidability Result ♦ Feasibility Problem ♦ Auxiliary Storage ♦ Many Graph ♦ Common Principle ♦ Integer Linear Programming ♦ Program Verification
Abstract Abstract. We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it. However, one of these graphs is of path-width at most 2n, where n is the number of variables in the instance. Since FO is decidable on graphs of bounded path-width, we obtain an alternative decidability result for ILP. The technique we use underlines a common principle to prove decidability which has previously been employed for automata with auxiliary storage. We also show how this new result links to automata theory and program verification. 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article