default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLawrence S. Moss
Larry Moss
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]Jayampathy Ratnayake, Annanthakrishna Manokaran, Romaine Jayewardene, Victoria Noquez, Lawrence S. Moss:
Presenting the Sierpinski Gasket in Various Categories of Metric Spaces. Appl. Categorical Struct. 32(4): 21 (2024)- [c55]Caleb Schultz Kisby, Saúl A. Blanco
, Lawrence S. Moss:
What Do Hebbian Learners Learn? Reduction Axioms for Iterated Hebbian Learning. AAAI 2024: 14894-14901 - 2023
- [j52]Aikaterini-Lida Kalouli, Hai Hu, Alexander F. Webb, Lawrence S. Moss, Valeria de Paiva:
Curing the SICK and Other NLI Maladies. Comput. Linguistics 49(1): 199-243 (2023) - [j51]Thomas F. Icard III, Lawrence S. Moss:
A Simple Logic of Concepts. J. Philos. Log. 52(3): 705-730 (2023) - [c54]Todd Schmid, Victoria Noquez, Lawrence S. Moss:
Fractals from Regular Behaviours. CALCO 2023: 14:1-14:18 - [c53]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors ((Co)algebraic pearls). CALCO 2023: 21:1-21:20 - [c52]Lawrence S. Moss:
Algebra of Self-Replication. MFPS 2023 - [i17]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Kripke, Vietoris and Hausdorff Polynomial Functors. CoRR abs/2303.11071 (2023) - [i16]Todd Schmid, Victoria Noquez, Lawrence S. Moss:
Fractals from Regular Behaviours. CoRR abs/2306.03894 (2023) - [i15]Valeria de Paiva, Qiyue Gao, Pavel Kovalev, Lawrence S. Moss:
Extracting Mathematical Concepts with Large Language Models. CoRR abs/2309.00642 (2023) - 2022
- [j50]Lawrence S. Moss, Ruy J. G. B. de Queiroz:
25th Workshop on Logic, Language, Information and Computation: WoLLIC 2018. J. Log. Lang. Inf. 31(4): 525-527 (2022) - [c51]Lawrence S. Moss, Victoria Noquez:
Corecursive Algebras in Nature. CMCS 2022: 155-175 - [c50]Caleb Kisby, Saúl A. Blanco, Lawrence S. Moss:
The Logic of Hebbian Learning. FLAIRS 2022 - [c49]Matthias Scheutz, Kamal Premaratne, Lawrence S. Moss, Avery Caulfield:
Probabilistic ‘If-Then’ Rules: On Bayesian Conditionals and Probabilistic Implications. ISAIM 2022 - [i14]Lawrence S. Moss, Thomas F. Icard III:
A Completeness Result for Inequational Reasoning in a Full Higher-Order Setting. CoRR abs/2202.08725 (2022) - [i13]Alexandru Baltag, Lawrence S. Moss, Slawomir Solecki:
Logics for Epistemic Actions: Completeness, Decidability, Expressivity. CoRR abs/2203.06744 (2022) - 2021
- [j49]Alex Kruckman, Lawrence S. Moss:
Exploring the Landscape of Relational Syllogistic Logics. Rev. Symb. Log. 14(3): 728-765 (2021) - [c48]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Initial Algebras Without Iteration ((Co)algebraic pearls). CALCO 2021: 5:1-5:20 - [c47]Zeming Chen, Qiyue Gao, Lawrence S. Moss:
NeuralLog: Natural Language Inference with Joint Neural and Logical Reasoning. *SEM 2021: 78-88 - [c46]Victoria Noquez, Lawrence S. Moss:
The Sierpinski Carpet as a Final Coalgebra. ACT 2021: 249-261 - [i12]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
An Initial Algebra Theorem Without Iteration. CoRR abs/2104.09837 (2021) - [i11]Zeming Chen, Qiyue Gao, Lawrence S. Moss:
NeuralLog: Natural Language Inference with Joint Neural and Logical Reasoning. CoRR abs/2105.14167 (2021) - 2020
- [j48]Lawrence S. Moss, Selçuk Topal:
Syllogistic Logic with Cardinality comparisons, on Infinite Sets. Rev. Symb. Log. 13(1): 1-22 (2020) - [c45]Caleb Kisby, Saúl A. Blanco, Alex Kruckman, Lawrence S. Moss:
Logics for Sizes with Union or Intersection. AAAI 2020: 2870-2876 - [c44]Kyle Richardson, Hai Hu, Lawrence S. Moss, Ashish Sabharwal:
Probing Natural Language Inference Models through Semantic Fragments. AAAI 2020: 8713-8721 - [c43]Hai Hu, Kyle Richardson, Liang Xu, Lu Li, Sandra Kübler, Lawrence S. Moss:
OCNLI: Original Chinese Natural Language Inference. EMNLP (Findings) 2020: 3512-3526 - [c42]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. FoSSaCS 2020: 17-36 - [i10]Hai Hu, Kyle Richardson, Liang Xu, Lu Li, Sandra Kübler, Lawrence S. Moss:
OCNLI: Original Chinese Natural Language Inference. CoRR abs/2010.05444 (2020)
2010 – 2019
- 2019
- [j47]Lawrence S. Moss, Maricarmen Martínez, Xavier Caicedo, Ruy J. G. B. de Queiroz:
25th Workshop on Logic, Language, Information and Computation (WoLLIC 2018). Log. J. IGPL 27(5): 766-776 (2019) - [j46]Jörg Endrullis, Lawrence S. Moss:
Syllogistic logic with "Most". Math. Struct. Comput. Sci. 29(6): 763-782 (2019) - [c41]Hai Hu, Qi Chen, Larry Moss:
Natural Language Inference with Monotonicity. IWCS (2) 2019: 8-15 - [e9]Lawrence S. Moss:
Proceedings Seventeenth Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2019, Toulouse, France, 17-19 July 2019. EPTCS 297, 2019 [contents] - [i9]Kyle Richardson, Hai Hu, Lawrence S. Moss, Ashish Sabharwal:
Probing Natural Language Inference Models through Semantic Fragments. CoRR abs/1909.07521 (2019) - [i8]Hai Hu, Qi Chen, Kyle Richardson, Atreyee Mukherjee, Lawrence S. Moss, Sandra Kübler:
MonaLog: a Lightweight System for Natural Language Inference Based on Monotonicity. CoRR abs/1910.08772 (2019) - [i7]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Well-Founded and Recursive Coalgebras. CoRR abs/1910.09401 (2019) - 2018
- [j45]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
Fixed points of functors. J. Log. Algebraic Methods Program. 95: 41-81 (2018) - [c40]Lawrence S. Moss:
Implementations of Natural Logics. ARQNL@IJCAR 2018: 1-10 - [c39]Frank M. V. Feys, Helle Hvid Hansen, Lawrence S. Moss:
Long-Term Values in Markov Decision Processes, (Co)Algebraically. CMCS 2018: 78-99 - [c38]Lawrence S. Moss, Charlotte Raty:
Reasoning About the Sizes of Sets: Progress, Problems, and Prospects. Bridging@IJCAI/ECAI 2018: 33-39 - [c37]Hai Hu, Larry Moss:
Polarity Computations in Flexible Categorial Grammar. *SEM@NAACL-HLT 2018: 124-129 - [e8]Lawrence S. Moss, Ruy J. G. B. de Queiroz, Maricarmen Martínez:
Logic, Language, Information, and Computation - 25th International Workshop, WoLLIC 2018, Bogota, Colombia, July 24-27, 2018, Proceedings. Lecture Notes in Computer Science 10944, Springer 2018, ISBN 978-3-662-57668-7 [contents] - [i6]Alex Kruckman, Lawrence S. Moss:
Exploring the Landscape of Relational Syllogistic Logics. CoRR abs/1809.00656 (2018) - 2017
- [c36]David Sprunger, Lawrence S. Moss:
Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence. CALCO 2017: 23:1-23:15 - [c35]Lawrence S. Moss, Michael Wollowski:
Natural Logic in AI and Cognitive Science. MAICS 2017: 41-46 - [c34]Thomas Icard, Lawrence S. Moss, William Tune:
A Monotonicity Calculus and Its Completeness. MOL 2017: 75-87 - 2016
- [j44]Valeria de Paiva, Lawrence S. Moss, Daniel Leivant, Ruy J. G. B. de Queiroz:
22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015). Log. J. IGPL 24(5): 859 (2016) - 2015
- [j43]Jirí Adámek, Paul Blain Levy, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday. Appl. Categorical Struct. 23(4): 609-641 (2015) - [j42]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Henning Urbat:
On finitary functors and their presentations. J. Comput. Syst. Sci. 81(5): 813-833 (2015) - [c33]Wlodek Zadrozny, Valeria de Paiva, Lawrence S. Moss:
Explaining Watson: Polymath Style. AAAI 2015: 4078-4082 - [c32]Jörg Endrullis, Lawrence S. Moss:
Syllogistic Logic with "Most". WoLLIC 2015: 124-139 - [e7]Lawrence S. Moss, Pawel Sobocinski:
6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, June 24-26, 2015, Nijmegen, The Netherlands. LIPIcs 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-84-2 [contents] - [e6]Makoto Kanazawa, Lawrence S. Moss, Valeria de Paiva:
Third Workshop on Natural Language and Computer Science, NLCS@ICALP/LICS 2015, Kyoto, Japan, 2015. EPiC Series in Computing 32, EasyChair 2015 [contents] - [e5]Valeria de Paiva, Ruy J. G. B. de Queiroz, Lawrence S. Moss, Daniel Leivant, Anjolina Grisi de Oliveira:
Logic, Language, Information, and Computation - 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings. Lecture Notes in Computer Science 9160, Springer 2015, ISBN 978-3-662-47708-3 [contents] - 2014
- [c31]Prasit Bhattacharya, Lawrence S. Moss, Jayampathy Ratnayake, Robert Rose:
Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra. Horizons of the Mind 2014: 146-167 - [c30]David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss:
Eigenvalues and Transduction of Morphic Sequences. Developments in Language Theory 2014: 239-251 - [c29]Alessio Lomuscio, Lawrence S. Moss, Ekaterina Ovchinnikova, Riccardo Rosati:
Tutorials. KR 2014 - [p4]Lawrence S. Moss:
Three Etudes on Logical Dynamics and the Program of Natural Logic. Johan van Benthem on Logic and Information Dynamics 2014: 705-727 - [i5]David Sprunger, William Tune, Jörg Endrullis, Lawrence S. Moss:
Eigenvalues and Transduction of Morphic Sequences: Extended Version. CoRR abs/1406.1754 (2014) - 2013
- [j41]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions. Log. Methods Comput. Sci. 9(3) (2013) - [j40]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras. Log. Methods Comput. Sci. 9(3) (2013) - [j39]J. Michael Dunn, Lawrence S. Moss, Zhenghan Wang:
Editors' Introduction: The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing. J. Philos. Log. 42(3): 443-459 (2013) - [c28]Thomas Icard, Lawrence S. Moss:
A Complete Calculus of Monotone and Antitone Higher-Order Functions. TACL 2013: 96-100 - [c27]Larry Moss, Jayampathy Ratnayake, Robert Rose:
Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra. TACL 2013: 158-162 - [i4]J. Michael Dunn, Lawrence S. Moss, Zhenghan Wang:
The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing. CoRR abs/1302.3465 (2013) - 2012
- [j38]Lawrence S. Moss:
The Soundness of Internalized Polarity Marking. Stud Logica 100(4): 683-704 (2012) - [c26]Lawrence S. Moss, Erik Wennstrom, Glen T. Whitney:
A Complete Logical System for the Equality of Recursive Terms for Sets. Logic and Program Semantics 2012: 180-203 - [c25]Jirí Adámek, Stefan Milius, Lawrence S. Moss:
On Finitary Functors and Their Presentations. CMCS 2012: 51-70 - [c24]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Well-Pointed Coalgebras (Extended Abstract). FoSSaCS 2012: 89-103 - [c23]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. LICS 2012: 335-344 - [e4]Thomas Bolander, Torben Braüner, Silvio Ghilardi, Lawrence S. Moss:
Advances in Modal Logic 9, papers from the ninth conference on "Advances in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012. College Publications 2012, ISBN 978-1-84890-068-4 [contents] - [i3]Clemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss:
Automatic Sequences and Zip-Specifications. CoRR abs/1201.3251 (2012) - 2011
- [j37]Lawrence S. Moss:
Syllogistic Logic with Comparative Adjectives. J. Log. Lang. Inf. 20(3): 397-417 (2011) - [c22]Jirí Adámek, Stefan Milius, Lawrence S. Moss, Lurdes Sousa:
Power-Set Functors and Saturated Trees. CSL 2011: 5-19 - [c21]Lawrence S. Moss:
Connections of coalgebra and semantic modeling. TARK 2011: 28-36 - 2010
- [j36]Lawrence S. Moss:
Syllogistic Logics with Verbs. J. Log. Comput. 20(4): 947-967 (2010) - [j35]Lawrence S. Moss:
A Note on Expressive Coalgebraic Logics for Finitary Set Functors. J. Log. Comput. 20(5): 1101-1111 (2010) - [c20]Lawrence S. Moss:
Logics for Two Fragments beyond the Syllogistic Boundary. Fields of Logic and Computation 2010: 538-564 - [c19]Stefan Milius, Lawrence S. Moss, Daniel Schwencke:
CIA Structures and the Semantics of Recursion. FoSSaCS 2010: 312-327
2000 – 2009
- 2009
- [j34]Hans van Ditmarsch, Lawrence S. Moss:
Special Issue on the Occasion of Johan van Benthem's 60th Birthday - Editorial. J. Philos. Log. 38(6): 587-588 (2009) - [j33]Ian Pratt-Hartmann, Lawrence S. Moss:
Logics for the Relational Syllogistic. Rev. Symb. Log. 2(4): 647-683 (2009) - [c18]Lawrence S. Moss:
Natural Logic and Semantics. Amsterdam Colloquium on Logic, Language and Meaning 2009: 84-93 - [c17]Lawrence S. Moss:
Intersecting Adjectives in Syllogistic Logic. MOL 2009: 223-237 - [i2]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CoRR abs/0904.2385 (2009) - 2008
- [j32]Lawrence S. Moss:
Confusion of memory. Inf. Process. Lett. 107(3-4): 114-119 (2008) - [j31]Stefan Milius, Lawrence S. Moss:
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]. Theor. Comput. Sci. 403(2-3): 409-415 (2008) - [i1]Ian Pratt-Hartmann, Lawrence S. Moss:
Logics for the Relational Syllogistic. CoRR abs/0808.0521 (2008) - 2007
- [j30]Lawrence S. Moss:
Finite Models Constructed from Canonical Formulars. J. Philos. Log. 36(6): 605-640 (2007) - [p3]Lawrence S. Moss, Hans-Jörg Tiede:
Applications of modal logic in linguistics. Handbook of Modal Logic 2007: 1031-1076 - [p2]Rohit Parikh, Lawrence S. Moss, Chris Steinsvold:
Topology and Epistemic Logic. Handbook of Spatial Logics 2007: 299-341 - 2006
- [j29]Lawrence S. Moss:
Recursion Theorems and Self-Replication Via Text Register Machine Programs. Bull. EATCS 89: 171-182 (2006) - [j28]Lawrence S. Moss, Ignacio D. Viglizzo:
Final coalgebras for functors on measurable spaces. Inf. Comput. 204(4): 610-636 (2006) - [j27]Stefan Milius, Lawrence S. Moss:
The category-theoretic solution of recursive program schemes. Theor. Comput. Sci. 366(1-2): 3-59 (2006) - [c16]Lawrence S. Moss:
Recursive Program Schemes: Past, Present, and Future. AMAST 2006: 2 - [c15]Lawrence S. Moss:
Uniform Functors on Sets. Essays Dedicated to Joseph A. Goguen 2006: 420-448 - 2005
- [j26]J. Michael Dunn, Tobias J. Hagge, Lawrence S. Moss, Zhenghan Wang:
Quantum logic as motivated by quantum computing. J. Symb. Log. 70(2): 353-359 (2005) - [j25]Lawrence S. Moss:
Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science. Math. Struct. Comput. Sci. 15(3): 407-408 (2005) - [j24]Joseph S. Miller, Lawrence S. Moss:
The Undecidability of Iterated Modal Relativization. Stud Logica 79(3): 373-407 (2005) - [j23]Lawrence S. Moss:
Joint review of "Introduction To Natural Computation by Dana H. Ballard"; MIT Press, 1997, ISBN 0-262-52258-6 and "Mathematical Methods in Artificial Intelligence by Edward A. Bender", IEEE Press, 1996 ISBN 0-8186-7200-5. SIGACT News 36(1): 21-24 (2005) - [c14]Stefan Milius, Lawrence S. Moss:
The Category Theoretic Solution of Recursive Program Schemes. CALCO 2005: 293-312 - 2004
- [j22]Lawrence S. Moss, Hans-Jörg Tiede:
Review of "Automata theory and its applications" by Bakhadyr Khoussainov and Anil Nerode. Birkhäuser Boston, Inc. 2001.: and "Automata, logics, and infinite games" by E.Grädel, W. Thomas, and T. Wilke. Springer-Verlag. SIGACT News 35(1): 8-12 (2004) - [j21]Alexandru Baltag, Lawrence S. Moss:
Logics for Epistemic Programs. Synth. 139(2): 165-224 (2004) - [c13]Lawrence S. Moss, Ignacio D. Viglizzo:
Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories. CMCS 2004: 279-295 - [e3]Lawrence S. Moss, Richard T. Oehrle:
Proceedings of the joint meeting of the 6th Conference on Formal Grammar (FG) and the 7th Conference on Mathematics of Language (MOL), FGMOL 2001, Helsinki, Finland, August 10-12, 2001. Electronic Notes in Theoretical Computer Science 53, Elsevier 2004 [contents] - 2003
- [j20]Lawrence S. Moss:
Recursion and corecursion have the same equational logic. Theor. Comput. Sci. 294(1/2): 233-267 (2003) - 2002
- [c12]Lawrence S. Moss:
Preface. CMCS 2002: 365-366 - [e2]Lawrence S. Moss:
Coalgebraic Methods in Computer Science, CMCS 2002, Satellite Event of ETAPS 2002, Grenoble, France, April 6-7, 2002. Electronic Notes in Theoretical Computer Science 65(1), Elsevier 2002 [contents] - 2001
- [j19]Lawrence S. Moss:
Simple Equational Specifications of Rational Arithmetic. Discret. Math. Theor. Comput. Sci. 4(2): 291-300 (2001) - [j18]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
Foreword : Coalgebraic Methods in Computer Science 1998. Theor. Comput. Sci. 260(1-2): 1 (2001) - [j17]Lawrence S. Moss:
Parametric corecursion. Theor. Comput. Sci. 260(1-2): 139-163 (2001) - [c11]Lawrence S. Moss, Richard T. Oehrle:
Preface. FGMOL 2001: 1-2 - 2000
- [j16]Andrew Dabrowski, Lawrence S. Moss:
The Johnson Graphs Satisfy a Distance Extension Property. Comb. 20(2): 295-300 (2000) - [j15]Lawrence S. Moss:
Exploring Logical Dynamics, Johan van Benthem. J. Log. Lang. Inf. 9(2): 261-263 (2000)
1990 – 1999
- 1999
- [j14]Lawrence S. Moss:
Coalgebraic Logic. Ann. Pure Appl. Log. 96(1-3): 277-317 (1999) - [j13]Lawrence S. Moss:
Erratum to "Coalgebraic Logic": Ann. pure appl. logic 96 (1999) 277-317. Ann. Pure Appl. Log. 99(1-3): 241-259 (1999) - [c10]Lawrence S. Moss:
Recursion and Corecursion Have the Same Equational Logic. MFPS 1999: 413-432 - 1998
- [j12]Jon Barwise, Lawrence S. Moss:
Modal Correspondence for Models. J. Philos. Log. 27(3): 275-294 (1998) - [j11]Antonius J. C. Hurkens, Monica McArthur, Yiannis N. Moschovakis, Lawrence S. Moss, Glen T. Whitney:
The Logic of Recursive Equations. J. Symb. Log. 63(2): 451-478 (1998) - [c9]Alexandru Baltag, Lawrence S. Moss, Slawomir Solecki:
The Logic of Public Announcements and Common Knowledge and Private Suspicions. TARK 1998: 43-56 - [c8]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
Preface. CMCS 1998: 259 - [e1]Bart Jacobs, Larry Moss, Horst Reichel, Jan J. M. M. Rutten:
First Workshop on Coalgebraic Methods in Computer Science, CMCS 1998, Lisbon, Portugal, March 28-29, 1998. Electronic Notes in Theoretical Computer Science 11, Elsevier 1998 [contents] - 1997
- [j10]Lawrence S. Moss, Norman Danner:
On the Foundations of Corecursion. Log. J. IGPL 5(2): 231-257 (1997) - [p1]Jerry Seligman, Lawrence S. Moss:
Situation Theory. Handbook of Logic and Language 1997: 239-309 - 1996
- [b1]