For copyright reasons, some papers are posted in preprint form only.
Also, I'm slow in posting many of the papers. Feel free to write for preprints.
2021
(with Alex Kruckman) Exploring the Landscape of Relational Syllogistic Logics, Review of Symbolic Logic, Volume 14, Issue 3, 728–765, September 2021.
(with Zeming Chen and Qiyue Gao) NeuralLog: Natural Language Inference with Joint Neural and Logical Reasoning, in V. Nastase and I. Vulic (eds.), Proc. STARSEM’21, 78–88, 2021.
(with Victoria Noquez) The Sierpinski Carpet as a Final Coalgebra, in Proceedings of the Fourth International Conference on Applied Category Theory (ACT 2021), Cambridge, United Kingdom, 12-16th July 2021, Electronic Proceedings in Theoretical Computer Science. (13 pages), 2021.
(with Jiří Adámek and Stefan Milius) Initial Algebras Without Iteration, in Fabio Gadducci and Alexandra Silva (eds), Proceedings of CALCO’21, LIPIcs, Vol. 211, ISBN 978-3-95977-212-9, 5:1–5:20, 2021.
2020
(with Selcuk Topal) Syllogistic Logic with Cardinality Comparisons, On Infinite Sets, Review of Symbolic Logic 13:1, 2020, 1-22.
(with Hai Hu, Qi Chen, Atreyee Mukherjee, Sandra Kubler, and Kyle Richardson), MonaLog: a Lightweight System for Natural Language Inference Based on Monotonicity, in Gaja Jarosz and Allyson Ettinger (eds.), Proceedings of the Third Meeting of the Society for Computation in Linguistics (SCiL 2020), 2020.
(with Kyle Richardson, Hai Hu, and Ashish Sabharwal) Probing Natural Language Inference Models through Semantic Fragments, In V. Conitzer and F. Sha (eds.), Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI'20, 8713--8721.
(with Caleb Kisby, Saul Blanco, and Alex Kruckman) Logics for Sizes with Union or Intersection, in V. Conitzer and F. Sha (eds.), Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI'20, 2870--2876 (2020).
(with Jiří Adámek and Stefan Milius) On Well-Founded and Recursive Coalgebras, in J. Goubault-Larrecq and B. Konig (eds.), Proceedings of FoSSaCS 2020, Springer LNCS, 17--36.
(with Hai Hu, Kyle Richardson, Liang Xu, Lu Li, and Sandra Kubler) OCNLI: Original Chinese Natural Language Inference, in the Findings of the ACL: EMNLP 2020, 3512-3526.
(with Hai Hu) An Automatic Monotonicity Annotation Tool Based on CCG Trees, in D. Deng et al (eds.), Proc., Second Tsinghua Interdisciplinary Workshop on Logic, Language, and Meaning: Monotonicity in Logic and Language, Tsinghua University, December 2020.
2019
(with Joerg Endrullis) Syllogistic Logic with ``Most'', in V. de Paiva et al (eds.) Proceedings, Workshop on Logic, Language, Information and Computation (WoLLIC'15), 2015, 215--229. Also appears in Mathematical Structures in Computer Science 29(6): 763-782 (2019).
(with Hai Hu and Qi Chen) Natural Language Inference with Monotonicity, in S.~Chatzikyriakidis et al (eds.), Proceedings of the 13th Int'l Conference on Computational Semantics ACL, 8--15.
2018
(with Jiří Adámek and Stefan Milius) Fixed Points of Functors, Journal of Logical and Algebraic Methods in Programming, Volume 95, 2018, 41--81.
(with Frank Feys and Helle Hansen) Long-term Values in Markov Decision Processes (Co)Algebraically, in C. Cirstea (ed.), Proc. of CMCS'18, Springer LNCS 11202, 2018, 78--99.
(with Hai Hu) Polarity Computations in Flexible Categorial Grammar, in Proceedings of the 7th Joint Conference on Lexical and Computational Semantics (STARSEM 2018), 6 pp.
(with Hai Hu and Thomas F. Icard) Automated Reasoning from Polarized Parse Trees, in A. Asudeh et al (eds.), Proceedings of NLCS 2018.
(with Charlotte Raty) Reasoning About the Sizes of Sets: Progress, Problems and Prospects, in C. Schon (ed), Proceedings of the Workshop on Bridging the Gap between Human and Automated Reasoning. CEUR Workshop Proceedings, 2018.
Implementations of Natural Logics, in C. Benzmuller and J.Otten (eds), Automated Reasoning and Quantified Non-classical Logics (ARQNL'18), 2018.
2017
(with Alex Kruckman) All and Only, in H. Christiansen, et al (eds.) Proceedings, Partiality and Underspecification in Information, Languages, and Knowledge, Cambridge Scholars Publishing, 2017, 189--217.
(with Michael Wollowski) Natural Logic in AI and Cognitive Science, in Proceedings, Modern Artificial Intelligence and Cognitive Science (MAICS 2017). CEUR-WS, 2017.
(with Thomas Icard and William Tune), A Monotonicity Calculus and Its Completeness, in M. Kanazawa (et al, eds.), Proceedings of the 15th Meeting on the Mathematics of Language, 2017
(with David Sprunger) Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence, in F. Bonchi and B. Konig (eds.), Proc. of CALCO'17, 23:1--23:15.
2016
(with Tri Lai and Jorg Endrullis) Majority Digraphs, Proceedings of the American Mathematical Society, 144 (2016), 3701-3715.
Syllogistic Logic with Cardinality Comparisons, in Katalin Bimbo (ed.), J. Michael Dunn on Information Based Logics, Springer Outstanding Contributions in Logic, 2016, 391--415.
(with Alexandru Baltag and Slawomir Solecki) The Logic of Common Knowledge, Public Announcements, and Private Suspicions (reprint of an item above) in H.Arlo Costa, (eds.), Readings in Formal Epistemology, Springer-Verlag 2016.
2015
(with (with Jiří Adámek, Stefan Milius, and Henning Urbat) On Finitary Functors and Their Presentations, special issue of the Journal of Computer and System Sciences, 81(5): 813-833, 2015.
(with Wlodek Zadrozny and Valeria de Paiva) Explaining Watson: Polymath Style>, Proceedings, Twenty-Ninth Conference Association for the Advancement of Artificial Intelligence (AAAI-15)}, 2015, 4078--4082.
(with Jason Hemann and Cameron Swords), Two Advances in the Implementation of Syllogistic Logics, in M. Balduccini et al (eds.), Proceedings of NLPAR'15, 2015.
2014
Three Etudes on Logical Dynamics and the Program of Natural Logic, in A. Baltag and S. Smets (eds.), Johan van Benthem on Logic and Informational Dynamics, Springer Outstanding Contributions to Logic Vol. 5, 2014, 705--727.
(with Prasit Bhattacharya, Jayampathy Ratnayake and Robert Rose), Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra, in F. van Breugel et al (eds), Horizons of the Mind. A Tribute to Prakash Panangaden Springer LNCS vol. 8464, 2014, 146--167. Expanded version of a paper above.
Commentary on Dag Westerstahl's paper ``Classical vs. Modern Squares of Opposition, and Beyond'' in Johan van Benthem and Fenrong Liu (eds.) Logic Across the University: Foundations and Applications, Proceedings of the Tsinghua Logic Conference, 2014, 3 pp. (unrefereed invited paper)
Interview on Philosophical Logic, to appear in Tracy Lupher and Thomas Adajian (eds.) Philosophy of Logic: 5 Questions. Automatic Press / VIP, 2014, 5 pp. (unrefereed invited paper)
Applied Logic: A Manifesto, Bulgarian translation an earlier unpublished text. To appear in the book Skazki po Logika, and in the journal Philosophical Alternatives.
(with David Sprunger, William Tune, and Joerg Endrullis) Eigenvalues and Transduction of Morphic Sequences, ms., Indiana University, in Arseny M. Shur and Mikhail V. Volkov (eds.), Proceedings, Developments in Language Theory 2014, Springer LNCS 8633, 239-251, 2014.
2013
Jiří Adámek, S. Milius, L. Moss, and L. Sousa, Well-Pointed Coalgebras. In LMCS 2013, and also available here.
J. M. Dunn, L. S. Moss, and Z. Wang, The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing, Journal of Philosophical Logic 42:3 (2013), pp. 443-459.
S. Milius, L. S. Moss, and D. Schwencke, Abstract GSOS Rules and a Modular Treatment of Recursive Definitions, Logical Methods in Computer Science 2013, special issue on selected papers from FoSSACS 2010.
Three Etudes on Logical Dynamics and the Program of Natural Logic, to appear in A. Baltag and S. Smets (eds.), Logical/Informational Dynamics, a Festschrift for Johan van Benthem.
T. Icard III and L. Moss, Recent Progress on Monotonicity, to appear in Linguistic Issues in Language Technology 2013.
2012
J. Adámek, P. B. Levy, S. Milius, L. Moss, and L. Sousa, On Final Coalgebras of Power-Set Functors and Saturated Trees, submitted, 2012.
Inference in a Boolean Fragment, in Thomas Graf, Denis Paperno, Anna Szabolcsi, and Jos Tellings (eds.), Theories of Everything: In Honor of Ed Keenan. UCLA Working Papers in Linguistics 17, 2012, 261-273.
T. Brauner, T. Bolander, S. Ghilardi, and L.S. Moss (Editors), Proceedings of the Ninth Conference on Advances in Modal Logic, College Publications, 2012, 592 pp.
J. Adámek, S. Milius, L. Moss, and L. Sousa, Well-Pointed Coalgebras, in L. Birkendal (ed.), Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2012), LNCS 7213, 2012, 89-103.
The Soundness of Internalized Polarity Marking, Studia Logica 100:683-704, 2012.
L. Moss, E. Wennstrom, and G. Whitney, A Complete Logical System for the Equality of Recursive Terms for Sets, to appear in R. L. Constable and A. Silva (eds.), Logic and Program Semantics: Essays Dedicated to Dexter Kozen on the Occasion of his Sixtieth Birthday, LNCS 7230, 2012, pp. 180-203.
J. Adámek, S. Milius, and L. S. Moss, On Finitary Functors and Their Presentations, in D. Pattinson and L. Schröder (eds.) Proc. Coalgebraic Methods in Computer Science (CMCS 2012), LNCS 2012, 51–70.
J. Endrullis, C. Grabmayer, D. Hendricks, J. W. Klop, and L. S. Moss, Automatic Sequences and Zip-Specifications, in N. Dershowitz (ed.) Proc. Logic in Computer Science (LICS 2012), 335-344. Here is a preprint.
2011
Connections of Coalgebra and Semantic Modeling, in K. Apt (ed) Proc. Theoretical Aspects of Rationality and Knowledge (TARK 2011), 7 pp.
Syllogistic Logic with Comparative Adjectives, J. Logic, Language, and Information 20:3, 2011, special issue on papers from MoL 2007, 397-417.
J. Adámek, S. Milius, L. Moss, and L. Sousa, Power-Set Functors and Saturated Trees, in M. Bezem (ed.) Proc. Computer Science Logic 2011, 5-19.
The Role of Mathematical Methods, in D. G. Fara and G. Russell (eds.), Routledge Companion to the Philosophy of Language, Routledge, 2011, 533-543.
2010
Natural Logic and Semantics, in M. Aloni et al (eds.), Proceedings, 17th Amsterdam Colloquium, LNAI 6042, 2010, 84-93.
S. Milius, L. Moss, and D. Schwencke, CIA Structures and the Semantics of Recursion, in C.-H. L. Ong (ed.), Proc. Foundations of Software Science and Computation Structures (FoSSaCS 2010), LNCS 6014, 2010, 312-327. Here is a full version of this paper.
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, A. Blass, N. Dershowitz, and W. Reisig (eds.), LNCS, vol. 6300, Springer-Verlag, 2010, 538-563.
Syllogistic Logics with Verbs, Journal of Logic and Computation, special issue on papers from Order, Algebra and Logics, Vol. 20, No. 4, 2010, 947-967.
A Note on Expressive Coalgebraic Logics for Finitary Set Functors, in a special issue of the Journal of Logic and Computation, Vol. 20, No. 5, 2010, 1101-1111.
Syllogistic Logic with Complements, in J. van Benthem, A. Gupta, and E. Pacuit (eds.), Games, Norms and Reasons: Logic at the Crossroads, Springer Synthese Library Series, 2010, 185-203.
Intersecting Adjectives in Syllogistic Logic, in C. Ebert, G. Jaeger, and J. Michaelis, Proc. MoL 10/11, LNAI 6149, 2010, 223-237.
Interview on Epistemic Logic, in O. Roy and V. Hendricks (eds.) Epistemic Logic, 5 Questions, Automatic Press /VIP, 2010.
2009
S. Milius and L. Moss, Equational Properties of Recursive Program Scheme Solutions, Cahiers de Topologie et Géométrie Différentielle Catégoriques, (special volume of in Honour of J. Adámek on the Occasion of his Sixtieth Birthday), 50 (2009), 23-66.
G. Bezhanishvili and L. Moss, Undecidability of First-Order Logic, educational module for the NSF-sponsored project on Learning Discrete Mathematics and Computer Science via Primary Historical Sources, 26 pp, 2009.
I. Pratt-Hartmann and L. Moss, Logics for the Relational Syllogistic, Review of Symbolic Logic, Vol. 2, No. 4, 2009, 647-683. Here is a preprint of this paper.
2008
S. Milius and L. S. Moss, Corrigendum to paper below, Theoretical Computer Science, Volume 403 (2008), no. 2-3, 409-415.
Completeness Theorems for Syllogistic Fragments, in F. Hamm and S. Kepser (eds.) Logics for Linguistic Structures, Mouton de Gruyter, 2008, 143-173.
Confusion of Memory, Information Processing Letters, 107:3-4, 2008, 114-119.
A. Baltag and H. van Ditmarsch and L. S. Moss, Epistemic Logic and Information Update, in P. Adriaans and J. van Benthem (eds.), Handbook of the Philosophy of Information, Elsevier, 2008, 369--463.
Non-wellfounded Set Theory, in The Stanford Encyclopedia of Philosophy, Edward N. Zalta (ed.), article first published April 16, 2008.2007
Finite Models Constructed From Canonical Formulas. Journal of Philosophical Logic, vol. 36, no. 6, 2007, 605-640.
L. S. Moss and H.-J.Tiede, Applications of Modal Logic in Linguistics, Chapter 19 of P. Blackburn, J. van Benthem, and F. Wolter (eds.), The Handbook of Modal Logic, Elsevier, 2007, 299-341.
R. Parikh, L. S. Moss, and C. Steinsvold, Topology and Epistemic Logic, Chapter 6 of M. Aiello, I. Pratt-Hartmann, and J. van Benthem (eds.), Handbook of Spatial Logics, Springer, 2007, 299-342.
2006
Applied Logic: A Manifesto, in D. Gabbay, S. Goncharov, and M. Zakharyaschev (eds.) Mathematical Problems from Applied Logics I: New Logics for the XXIst Century, Springer International Mathematical Series, 2006, 23 pp.
L. S. Moss and I. D. Viglizzo, Final Coalgebras for Measurable Spaces, Information and Computation, Volume 204, Issue 4 (April 2006) (special issue on selected papers from CMCS'04), 610-636.
Recursion Theorems and Self-Replication Via Text Register Machine Programs. Bulletin of the European Association for Theoretical Computer Science, Number 89, 2006, 171-182.
Uniform Functors on Sets, in K. Futatsugi et al. (eds.) Algebra, Meaning, and Computation: Festschrift in Honor of Prof. Joseph Goguen, Springer-Verlag LNCS 4064, 2006, 420-448.
S. Milius and L. S. Moss, The Category Theoretic Solution of Recursive Program Schemes. Theoretical Computer Science, Volume 366, Issues 1-2, November 2006, pp. 3-59, special issue on papers presented at CALCO'05. Preliminary version published in J. L. Fiadero et al (eds.) the Proc. CALCO'05 Springer LNCS 3629, 2005, 293-312. Here is a link to a revised version of this paper, following an important correction to the 2006 version.
2005
J. S. Miller and L. S. Moss, The Undecidability of Iterated Modal Relativization, Studia Logica, vol. 79, 373-407, 2005.
J. M. Dunn, T. J. Hagge, L. Moss, and Z. Wang, Quantum Logic as Motivated by Quantum Computing, Journal of Symbolic Logic vol. 70, no. 2, 353-359 (2005).
2004
L. S. Moss and I. D. Viglizzo, Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories, in J. Adámek and S. Milius (eds.), Proceedings 7th CMCS, ENTCS vol. 106, 279-295, 2004.
A. Baltag and L. S. Moss, Logics for Epistemic Programs, Synthese, Vol. 139, issue 2 (2004), 165-224.
2003
Recursion and Corecursion Have the Same Equational Logic, Theoretical Computer Science 294 (2003), no. 1-2, 233-267. Preliminary version in the Proc. of the 15th Meeting on Mathematical Foundations of Programming Semantics, ENTCS, Vol. 20, Elsevier, 1999.
2001
Parametric Corecursion, Theoretical Computer Science 260 (1-2), 2001, 139-163.
Simple Equational Specifications of Rational Arithmetic, Discrete Mathematics and Theoretical Computer Science, Volume 4, no. 2 (2001), 291-300.
2000
A. Dabrowski and L. S. Moss, The Johnson Graphs Satisfy a Distance Extension Property, Combinatorica, 20 (2), 2000, 295-300.
1999
From Hypersets to Kripke Models in Logics of Announcements. In JFAK. Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, Vossiuspers, Amsterdam University Press, 1999.
Coalgebraic Logic, in Festschrift on the occasion of Professor Rohit Parikh's 60th birthday. Annals of Pure and Applied Logic 96 (1999), no. 1-3, 277-317. The last sections of this publication appear with lots of blank spaces due to a bug in the printing process, and they re-appear in the same journal: vol. 99 (1999) no. 1-3, 241-259.
1998
Jon Barwise and L. S. Moss, Modal Correspondence for Models, the Journal of Philosophical Logic, Vol. 27 (1998), 275-294. Preliminary version in P. Dekker et al (eds.) Proceedings of the Tenth Amsterdam Colloquium, 1996.
A. J. C. Hurkens, M. McArthur, Y. N. Moschovakis, L. S. Moss, and G. Whitney, The Logic of Recursion Equations, the J. Symbolic Logic, Vol. 63, No. 2 (1998), 451-478.
A. Baltag, L. S. Moss, and S. Solecki, The Logic of Common Knowledge, Public Announcements, and Private Suspicions, Proceedings of TARK-VII , 1998.
1997
N. Danner and L. S. Moss, On the Foundations of Corecursion, Logic Journal of the IGPL, Vol. 5, No. 2 (1997) (Special issue on papers from the 5th Workshop on Logic, Language, and Information), pp. 231-257.
1996
A. Dabrowski and R. Parikh, Topological Reasoning and the Logic of Knowledge. Annals of Pure and Applied Logic 78 (1996), no. 1-3, papers in honor of the Symposium on Logical Foundations of Computer Science, ``Logic at St. Petersburg'' (St. Petersburg, 1994), 73-110.
J. Seligman and L. S. Moss, Situation Theory, Chapter 4 of J. van Benthem and A. ter Meulen (eds.), Handbook of Logic and Language, Kluwer, 1996, pp. 239-309.
