Author:
Charatonik Witold,Georgieva Lilia,Maier Patrick
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Alechina, N., Immerman, N.: Reachability logic: An efficient fragment of transitive closure logic. Logic Journal of IGPL 8, 325–337 (2000)
2. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)
3. Bernays, P., Schönfinkel, M.: Zum Entscheidungsproblem der Mathematischen Logik. Math. Annalen 99, 342–372 (1928)
4. Lecture Notes in Computer Science;A. Biere,1999
5. Lecture Notes in Computer Science;R. Bornat,2004
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Variable Logic with Counting and Trees;ACM Transactions on Computational Logic;2016-11-15
2. Two-Variable Logic with Counting and Trees;2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science;2013-06
3. On the Complexity of the Bernays-Schönfinkel Class with Datalog;Logic for Programming, Artificial Intelligence, and Reasoning;2010
4. Bounded Model Checking of Pointer Programs;Computer Science Logic;2005