Clausal Temporal Resolution

ACM Transactions on Computational Logic

Volumn 2, Issue 1, 2001, Pages 12-56

  Fisher, Michael ^a   Dixon, Clare ^a   Peim, Martin ^b  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Algorithms; Resolution; Temporal logic; Theorem proving; Theory; Verification

Indexed keywords

EID: 85016913363     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/371282.371311     Document Type: Article

References (26)

1. Agarwal, P. K., and Procopiuc, C. M. 2002. Exact and approximation algorithms for clustering. Algorithmica 33, 2, 201-226.
2. Alber, J., Bodlaender, H. L., Fernau, H., Kloks, T., and Niedermeier, R. 2002. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 4, 461-493.
3. Alber, J., Fernau, H., and Niedermeier, R. 2004. Parameterized complexity: Exponential speed-up for planar graph problems. J. Algorithms 54, 26-56.
4. Alber, J., and Fiala, J. 2004. Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52, 2, 134-151.
5. Arnborg, S., Lagergren, J., and Seese, D. 1991. Easy problems for tree-decomposable graphs. J. Algorithms 12, 2, 308-340.
6. Baker, B. S. 1994. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41, 1, 153-180.
7. Barilan, J., Kortsarz, G., and Peleg, D. 1993. How to allocate network centers. J. Algorithms 15, 3, 385-415.
8. Chen, Z.-Z. 2001. Approximation algorithms for independent sets in map graphs. J. Algorithms 41, 1, 20-40.
9. Chen, Z.-Z., Grigni, E., and Papadimitriou, C. H. 2002. Map graphs. J. ACM 49, 2, 127-138.
10. Courcelle, B. 1990. Graph rewriting: An algebraic and logic approach. In Handbook of Theoretical Computer Science, Vol. B. Elsevier, Amsterdam, the Netherlands, 193-242.
11. Demaine, E. D., HAjiaghayi, M., and Thilikos, D. M. 2003. Exponential speedup of fixed parameter algorithms on K3, 3-minor-free or K5-minor-free graphs. In Proceedings of the 13th International Symposium on Algorithms and Computation (ISAAC 2002). Lecture Notes in Computer Science, vol. 2518. Springer-Verlag, Berlin, Germany, 262-273.
12. Downey, R. G., and Fellows, M. R. 1999. Parameterized Complexity. Springer-Verlag, New York. EPPSTEIN, D. 2000. Diameter and treewidth in minor-closed graph families. Algorithmica 27, 3-4, 275-291.
13. Fomin, F., and Thilikos, D. 2003. Dominating sets in planar graphs: Branch-width and exponential speed-up. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 168-177.
14. Gavoille, C., Peleg, D., Raspaud, A., and Sopena, E. 2001. Small k-dominating sets in planar graphs with applications. In Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001). Lecture Notes in Computer Science, vol. 2204. Springer-Verlag, Berlin, Germany, 201-216.
15. Gonzalez, T. F. 1985. Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci. 38, 2-3, 293-306.
16. Grohe, M. 2003. Local tree-width, excluded minors, and approximation algorithms. Combinatoria 23, 4, 613-632.
17. Gupta, A., and Nishimura, N. 1994. Sequential and parallel algorithms for embedding problems on classes of partial k-trees. In Proceedings of the 4th Scandinavian Workshop on Algorithm Theory (SWAT 1994). Lecture Notes in Computer Science, vol. 824. Springer-Verlag, Berlin, Germany, 172-182.
18. Hicks, I. V. 2000. Branch decompositions and their applications. Ph.D. dissertation. Rice University.
19. Kanj, I., and PerkoviC, L. 2002. Improved parameterized algorithms for planar dominating set. In Proceedings of the 27th International Symposium Mathematical Foundations of Computer Science (MFCS 2002). Lecture Notes in Computer Science, vol. 2420. Springer-Verlag, Berlin, Germany, 399-410.
20. Kloks, T., Lee, C. M., and Liu, J. 2002. New algorithms for k-face cover, k-feedback vertex set, and k-disjoint set on plane and planar graphs. In Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2002). Lecture Notes in Computer Science, vol. 2573. Springer-Verlag, Berlin, Germany, 282-296.
21. Plesnìk, J. 1980. On the computational complexity of centers locating in a graph. Československá Akademie Věd. Aplikace Matematiky 25, 6, 445-452. (With a loose Russian summary.).
22. Robertson, N., and Seymour, P. D. 1991. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52, 2, 153-190.
23. Robertson, N., Seymour, P. D., and Thomas, R. 1994. Quickly excluding a planar graph. J. Combin. Theory Ser B 62, 2, 323-348.
24. Seymour, P. D., and Thomas, R. 1994. Call routing and the ratcatcher. Combinatorica 14, 2, 217-241.
25. Swamy, C., and Kumar, A. 2004. Primal-dual algorithms for connected facility location problems. Algorithmica 40, 4, 245-269.
26. Thorup, M. 1998. Map graphs in polynomial time. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS 1998). IEEE Computer Society Press, Los Alamitos, Calif., 396-405.