Solving systems of linear inequalities by bound propagation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6803 LNAI, Issue , 2011, Pages 369-383

  Korovin, Konstantin ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR INEQUALITIES;

AUTOMATION;

EID: 80051677313     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22438-6_28     Document Type: Conference Paper

References (7)

1. Davis, M., Logemann, G., Loveland, D.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394-397 (1962)
2. Korovin, K., Tsiskaridze, N., Voronkov, A.: Conflict resolution. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 509-523. Springer, Heidelberg (2009)
3. Korovin, K., Voronkov, A.: Solving systems of linear inequalities by bound propagation, full version (2011), http://www.cs.man.ac.uk/~korovink/my- pub/
4. Marques-Silva, J.P., Sakallah, K.A.: GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Computers 48(5), 506-521 (1999)
5. McMillan, K.L., Kuehlmann, A., Sagiv,M.: Generalizing DPLL to richer logics. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 462-476. Springer, Heidelberg (2009)
6. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL. J. ACM 53(6), 937-977 (2006) (Pubitemid 46276962)
7. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, West Sussex (1998)