Incremental Satisfiability and Implication for UTVPI Constraints

References

• Bellman R. On a routing problem. Quart. Appl. Math. (1958) 16(1):87–90Crossref, Google Scholar
• Cherkassky B. V., Goldberg A. V., Diaz J., Sena M. Negative-cycle detection algorithms. Proc. Eur. Sympos. Algorithms (ESA '96) (1996) 1136(Springer-Verlag, Berlin) 349–363Lecture Notes in Computer ScienceCrossref, Google Scholar
• Cotton S., Maler O., Biere A., Gomes C. P. Fast and flexible difference constraint propagation for DPLL(T). Theory and Applications of Satisfiability Testing—SAT 2006 (2006) 4121(Springer-Verlag, Berlin) 170–183Lecture Notes in Computer ScienceCrossref, Google Scholar
• Ford L. R., Fulkerson D. R.Flows in Networks (1962) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Frigioni D., Marchetti-Spaccamela A., Nanni U., Bilardi G., Italiano G. F., Pietracaprina A., Pucci G. Fully dynamic shortest paths and negative cycle detection on digraphs with arbitrary edge weights. Proc. Eur. Sympos. Algorithms (ESA '98) (1998) 1461(Springer-Verlag, Berlin) 320–331Lecture Notes in Computer ScienceCrossref, Google Scholar
• Harvey W., Stuckey P. J. A unit two variable per inequality integer constraint solver for constraint logic programming. Proc. 20th Australasian Comput. Sci. Conf. (1997) 19(Australian Computer Science Communications, Sydney, Australia) 102–111Google Scholar
• Jaffar J., Maher M. J., Stuckey P. J., Yap R. H. C., Borning A. Beyond finite domains. Principles Practice Constraint Programming (PPCP '94) (1994) 874(Springer-Verlag, London) 86–94Lecture Notes in Computer ScienceCrossref, Google Scholar
• Johnson D. B. Efficient algorithms for shortest paths in sparse networks. J. ACM (1977) 24(1):1–13Crossref, Google Scholar
• Junker U. QuickXPlain: Preferred explanations and relaxations for overconstrained problems. Proc. 19th National Conf. Artificial Intelligence (2004) (AAAI Press, Menlo Park, CA) 167–172Google Scholar
• Lahiri S. K., Musuvathi M., Gramlich B. An efficient decision procedure for UTVPI constraints. Frontiers of Combining Systems (FroCoS 2005) (2005) 3717(Springer-Verlag, Berlin) 168–183Lecture Notes in Artificial IntelligenceCrossref, Google Scholar
• Miné A. The octagon abstract domain. Higher-Order Symbolic Comput. (2006) 19(1):31–100Crossref, Google Scholar
• Niewenhuis R., Oliveras A., Tinelli C., Baader F., Voronkov A. Abstract DPLL and abstract DPLL modulo theories. Logic Programming, Artificial Intelligence Reasoning (LPAR 2004) (2005) 3452(Springer-Verlag, Berlin) 36–50Lecture Notes in Artificial IntelligenceCrossref, Google Scholar
• Seshia S. A., Subramani K., Bryant R. E. On solving Boolean combinations of UTVPI constraints. J. Satisfiability, Boolean Modelling Comput. (2007) 3:67–90Crossref, Google Scholar
• Sitzmann I., Stuckey P. J., Orlowska M. O-Trees: A constraint based index structure. Proc. 11th Australasian Database Conf. (ADC2000) (2000) (IEEE Press, Los Alamitos, CA) 127–135Google Scholar