Incremental Satisfiability and Implication for UTVPI Constraints
暂无分享,去创建一个
[1] Daniele Frigioni,et al. Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights , 1998, ESA.
[2] Oded Maler,et al. Fast and Flexible Difference Constraint Propagation for DPLL(T) , 2006, SAT.
[3] Cesare Tinelli,et al. Abstract DPLL and Abstract DPLL Modulo Theories , 2005, LPAR.
[4] Peter J. Stuckey,et al. O-trees: a constraint-based index structure , 2000, Proceedings 11th Australasian Database Conference. ADC 2000 (Cat. No.PR00528).
[5] Michael J. Maher,et al. Beyond Finite Domains , 1994, PPCP.
[6] Antoine Miné,et al. The octagon abstract domain , 2001, High. Order Symb. Comput..
[7] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[8] K. Subramani,et al. On Solving Boolean Combinations of UTVPI Constraints , 2007, J. Satisf. Boolean Model. Comput..
[9] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[10] Andrew V. Goldberg,et al. Negative-Cycle Detection Algorithms , 1996, ESA.
[11] Shuvendu K. Lahiri,et al. An Efficient Decision Procedure for UTVPI Constraints , 2005, FroCoS.
[12] Ulrich Junker,et al. QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.
[13] Donald B. Johnson,et al. Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.