Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exploring the Landscape of Relational Syllogistic Logics

Published 3 Sep 2018 in math.LO, cs.CL, and cs.LO | (1809.00656v2)

Abstract: This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. David A. McAllester. Automatic recognition of tractability in inference relations. J. ACM, 40(2):284–303, 1993.
  2. Natural language syntax and first-order inference. Artificial Intelligence, 56:1–20, 1992.
  3. Lawrence S. Moss. Completeness theorems for syllogistic fragments. In F. Hamm and S. Kepser, editors, Logics for Linguistic Structures, pages 143–173. Mouton de Gruyter, 2008.
  4. Lawrence S. Moss. Logics for two fragments beyond the syllogistic boundary. In Fields of Logic and Computation: Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, volume 6300 of LNCS, pages 538–563. Springer-Verlag, 2010.
  5. Lawrence S. Moss. Syllogistic logics with verbs. Journal of Logic and Computation, 20(4):947–967, 2010. Journal of Logic and Computation.
  6. Lawrence S. Moss. Natural Logic. In Handbook of Contemporary Semantic Theory, Second Edition, chapter 18. John Wiley & Sons, 2015.
  7. Lawrence S. Moss. Logic from language. ms., Indiana University, to appear.
  8. All and only. In Partiality, Underspecification, and Natural Language Processing. Cambridge Scholars Publishers, 2017.
  9. Ian Pratt-Hartmann. The relational syllogistic revisited. Linguistic Issues in Language Technology, pages 195–227, 2014.
  10. Logics for the relational syllogistic. Review of Symbolic Logic, 2(4):647–683, 2009.
  11. Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, pages 216–226, San Diego, California, 1978.
  12. Edith Spaan. Complexity of Modal Logics. PhD thesis, ILLC, University of Amsterdam, 1993.
Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up