On the complexity of the Bernays-Schönfinkel class with datalog

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

Volumn 6397 LNCS, Issue , 2010, Pages 187-201

  Charatonik, Witold ^a   Witkowski, Piotr ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MODEL CHECKING; FORMAL LOGIC;

BOUNDED MODEL CHECKING; COUNTING QUANTIFIERS; DATALOG PROGRAMS; FIXED POINTS; LOWER BOUNDS; POINTER STRUCTURES; SATISFIABILITY; SATISFIABILITY PROBLEMS;

COMPUTER CIRCUITS;

EID: 85037523146     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16242-8_14     Document Type: Conference Paper

References (19)

1. Balaban, I., Pnueli, A., Zuck, L.D.: Shape analysis of single-parent heaps. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 91-105. Springer, Heidelberg (2007)
2. Bansal, K., Brochenin, R., Lozes, E.: Beyond shapes: Lists with ordered data. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 425-439. Springer, Heidelberg (2009)
3. Bouajjani, A., Drǎgoi, C., Enea, C., Sighireanu, M.: A logic-based framework for reasoning about composite data structures. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009 - Concurrency Theory. LNCS, vol. 5710, pp. 178-195. Springer, Heidelberg (2009)
4. Charatonik, W., Georgieva, L., Maier, P.: Bounded model checking of pointer programs. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 397-412. Springer, Heidelberg (2005)
5. Charatonik, W., Witkowski, P.: On the complexity of the Bernays-Schönfinkel class with datalog. Full version, http://www.ii.uni. wroc.pl/~pwit/BSD-full.pdf
6. Fürer,M.: The computational complexity of the unconstrained limited domino problem (with implications for logical decision problems). In: Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity, London, UK, pp. 312-319. Springer, London (1984)
7. Grädel, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 249-260. Springer, Heidelberg (1997)
8. Graedel, E., Otto, M., Rosen, E.: Two-variable logic with counting is decidable. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, p. 306. IEEE Computer Society, Los Alamitos (1997)
9. Immerman, N., Rabinovich, A., Reps, T., Sagiv, M., Yorsh, G.: The boundary between decidability and undecidability for transitive-closure logics. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 160-174. Springer, Heidelberg (2004) (Pubitemid 39751586)
10. Kosaraju, S.R.: Decidability of reachability in vector addition systems (preliminary version). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pp. 267-281 (1982)
11. Lahiri, S., Qadeer, S.: Back to the future: revisiting precise program verification using smt solvers. In: POPL 2008: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 171-182. ACM Press, New York (2008)
12. Leroux, J.: The general vector addition system reachability problem by presburger inductive invariants. In: Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, pp. 4-13 (2009)
13. Lipton, R.J.: The Reachability Problem Requires Exponential Space, Technical Report 62, Yale University, Department of Computer Science (January 1976)
14. Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput. 13(3), 441-460 (1984)
15. Nas, B.O.: Reachability problems in vector addition systems. The American Mathematical Monthly 80(3), 292-295 (1973)
16. Pacholski, L., Szwast, W., Tendera, L.: Complexity of two-variable logic with counting. In: LICS 1997: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science, Washington, DC, USA, p. 318. IEEE Computer Society, Los Alamitos (1997)
17. Pacholski, L., Szwast, W., Tendera, L.: Complexity results for first-order two-variable logic with counting. SIAM J. Comput. 29(4), 1083-1117 (2000)
18. Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. J. of Logic, Lang. and Inf. 14(3), 369-395 (2005)
19. Yorsh, G., Rabinovich, A., Sagiv, M., Meyer, A., Bouajjani, A.: A logic of reachable patterns in linked data-structures. Journal of Logic and Algebraic Programming 73(1-2), 111-142 (2007) (Pubitemid 47059069)