Affiliation:
1. University of Wrocław
2. University of Manchester
3. University of Opole
Abstract
In this article we discuss fragments and extensions of two-variable logics motivated by practical applications. We outline the decidability frontier, describing some of the techniques developed for deciding satisfiability and finite satisfiability, as well as characterizing their complexity.
Publisher
Association for Computing Machinery (ACM)
Reference49 articles.
1. Modal Languages and Bounded Fragments of Predicate Logic
2. F. Baader D. Calvanese D. L. McGuinness D. Nardi and P. F. Patel-Schneider. 2010. The description logic handbook: theory implementation and applications (2nd ed.). Cambridge University Press. F. Baader D. Calvanese D. L. McGuinness D. Nardi and P. F. Patel-Schneider. 2010. The description logic handbook: theory implementation and applications (2nd ed.). Cambridge University Press.
3. E. Börger E. Grädel and Y. Gurevich. 1997. The classical decision problem. Springer Berlin. E. Börger E. Grädel and Y. Gurevich. 1997. The classical decision problem. Springer Berlin.
4. W. Charatonik and P. Witkowski. 2016. Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science 12 2 (2016) 8:1--8:31. W. Charatonik and P. Witkowski. 2016. Two-variable Logic with Counting and a Linear Order. Logical Methods in Computer Science 12 2 (2016) 8:1--8:31.
5. A note on the Entscheidungsproblem
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献