Copyright © 2009 K. Subramani. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

1. Editors, Proceedings of SAT 2001, SAT 2002 and SAT 2003.
2. S. A. Cook, “The complexity of theorem-proving procedures,” in Proceedings of the ACM Symposium on Theory of Computing (STOC '71), 1971.
3. U. Schöning, “New algorithms for k-SAT based on the local search principle,” in Proceedings of the Symposium on Mathematical Foundations of Computer Science (MFCS '01), 2001.
4. U. Schöning, “A probabilistic algorithm for k-SAT based on limited local search and restart,” Algorithmica, vol. 32, 2002. View at Zentralblatt MATH
5. O. Kullmann, “New methods for 3-SAT decision and worst-case analysis,” Theoretical Computer Science, vol. 223, no. 1-2, pp. 1–72, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
6. B. Selman, H. J. Levesque, and D. G. Mitchell, “A new method for solving hard satisfiability problems,” in Proceedings of the 10th National Conference on Artificial Intelligence (AAAI '92), pp. 440–446, San Jose, Calif, USA, July 1992.
7. W. Wei and B. Selman, “Accelerating random walks,” in Proceedings of the 8th International Conference on Constraint Programming (CP '02), Lecture Notes in Computer Science, pp. 216–232, 2002.
8. T. J. Schaefer, “The complexity of satisfiability problems,” in Proceedings of the 10th Annual ACM Symposium on Theory of Computing, A. Aho, Ed., pp. 216–226, ACM Press, San Diego, Calif, USA, 1978.
9. B. Aspvall, M. F. Plass, and R. E. Tarjan, “A linear-time algorithm for testing the truth of certain quantified Boolean formulas,” Information Processing Letters, vol. 8, no. 3, pp. 121–123, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
10. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, Mass, USA, 1994. View at MathSciNet
11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
12. S. A. Seshia, K. Subramani, and R. E. Bryant, “On solving boolean combinations of UTVPI constraints,” Journal on Satisfiability, Boolean Modeling and Computation, vol. 3, no. 1-2, pp. 67–90, 2007. View at Zentralblatt MATH
13. S. K. Lahiri and M. Musuvathi, “An efficient decision procedure for UTVPI constraints,” in Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FroCoS '05), pp. 168–183, Vienna, Austria, September 2005. View at Publisher · View at Google Scholar
14. S. Porschen and E. Speckenmeyer, “Satisfiability of mixed Horn formulas,” Tech. Rep., University of Cologne, Cologne, Germany, 2005.
15. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1988. View at MathSciNet
16. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, Mass, USA, 2nd edition, 1992.
17. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Application, Prentice-Hall, Englewood Cliffs, NJ, USA, 1993. View at MathSciNet
18. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, USA, 1995.
19. A. Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, New York, NY, USA, 1987.
20. E. Clarke, A. Biere, R. Raimi, and Y. Zhu, “Bounded model checking using satisfiability solving,” Formal Methods in System Design, vol. 19, no. 1, pp. 7–34, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
21. A. Wall, K. Sandström, J. Mäki-Turja, C. Norström, and W. Yi, “Verifying temporal constraints on data in multi-rate transactions using timed automata,” in RTCSA, pp. 263–270, 2000.
22. J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard, “Difference decision diagrams,” in Computer Science Logic (Madrid, 1999), vol. 1683, pp. 111–125, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
23. R. Alur and D. L. Dill, “A theory of timed automata,” Theoretical Computer Science, vol. 126, no. 2, pp. 183–235, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
24. J. I. Rasmussen, K. G. Larsen, and K. Subramani, “Resource-optimal scheduling using priced timed automata,” in Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '04), K. Jensen and A. Podelski, Eds., vol. 2988 of Lecture Notes in Computer Science, pp. 220–235, Springer, April 2004.
25. A. V. Goldberg, “Scaling algorithms for the shortest paths problem,” SIAM Journal on Computing, vol. 24, no. 3, pp. 494–504, 1995. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
26. P. Brucker, Scheduling Algorithms, Springer, Berlin, Germany, 2nd edition, 1998. View at MathSciNet
27. C.-C. Han and K.-J. Lin, “Scheduling real-time computations with separation constraints,” Information Processing Letters, vol. 42, no. 2, pp. 61–66, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
28. N. Muscettola, B. Smith, S. Chien, et al., “In-board planning for autonomous spacecraft,” in Proceedings of the 4th International Symposium on Artificial Intelligence, Robotics, and Automation for Space (i-SAIRAS '97), July 1997.
29. N. Muscettola, P. Morris, B. Pell, and B. Smith, “Issues in temporal reasoning for autonomous control systems,” in Proceedings of the 2nd International Conference on Autonomous Agents, Minneapolis, Minn, USA, 1998.
30. B. A. Madsen, “An algorithm for exact satisfiability analysed with the number of clauses as parameter,” Information Processing Letters, vol. 97, no. 1, pp. 28–30, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
31. H. van Maaren and L. van Norden, “Hidden threshold phenomena for fixed-density sat formulae,” in Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, 2004.
32. R. T. Rockafellar, Convex Analysis, vol. 28 of Princeton Mathematics Series, Princeton University Press, Princeton, NJ, USA, 1970.
33. J. B. Hiriart-Urruty and C. Lemarechal, Convex Analysis and Minimization Algorithms, Springer, Berlin, Germany, 1993.
34. M. Dyer, A. Frieze, and R. Kannan, “A random polynomial-time algorithm for approximating the volume of convex bodies,” Journal of the Association for Computing Machinery, vol. 38, no. 1, pp. 1–17, 1991. View at Zentralblatt MATH · View at MathSciNet
35. M. E. Dyer and A. M. Frieze, “On the complexity of computing the volume of a polyhedron,” SIAM Journal on Computing, vol. 17, no. 5, pp. 967–974, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
36. K. Subramani, “On identifying simple and quantified lattice points in the 2SAT polytope,” in Proceedings of the 5th International Conference on Artificial Intelligence and Symbolic Computation (AISC '02), J. Calmet, et al., Ed., vol. 2385 of Lecture Notes in Artificial Intelligence, pp. 217–230, Springer, July 2002.
37. V. Chandru and J. Hooker, Optimization Methods for Logical Inference, Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons, New York, NY, USA, 1999. View at MathSciNet
38. K. Truemper, personal communication, 2003.
39. J. H. Reif, “Symmetric complementation,” Journal of the Association for Computing Machinery, vol. 31, no. 2, pp. 401–421, 1984. View at Zentralblatt MATH · View at MathSciNet
40. O. Reingold, “Undirected ST-connectivity in log-space,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC '05), pp. 376–385, Baltimore, Md, USA, May 2005. View at Publisher · View at Google Scholar
41. M. Sipser, Introduction to the Theory of Computation. Thompson Course Technology, 2nd edition, 2006.
42. P. M. VaidyaA. Aho, “An algorithm for linear programming which requires $O(((m+n)n^2+(m+n){}^{1.5}n)L)$ arithmetic operations,” in Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 29–38, ACM Press, New York, NY, USA, May 1987.
43. K. Subramani, “On deciding the non-emptiness of 2SAT polytopes with respect to first order queries,” Mathematical Logic Quarterly, vol. 50, no. 3, pp. 281–292, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet