Lawrence S. Moss

According to our database1, Lawrence S. Moss authored at least 95 papers between 1988 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 




NeuralLog: Natural Language Inference with Joint Neural and Logical Reasoning.
CoRR, 2021

An Initial Algebra Theorem Without Iteration.
CoRR, 2021

Syllogistic Logic with Cardinality comparisons, on Infinite Sets.
Rev. Symb. Log., 2020

On Well-Founded and Recursive Coalgebras.
Proceedings of the Foundations of Software Science and Computation Structures, 2020

OCNLI: Original Chinese Natural Language Inference.
Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: Findings, 2020

Probing Natural Language Inference Models through Semantic Fragments.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Logics for Sizes with Union or Intersection.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Syllogistic logic with "Most".
Math. Struct. Comput. Sci., 2019

25th Workshop on Logic, Language, Information and Computation (WoLLIC 2018).
Log. J. IGPL, 2019

MonaLog: a Lightweight System for Natural Language Inference Based on Monotonicity.
CoRR, 2019

Fixed points of functors.
J. Log. Algebraic Methods Program., 2018

Exploring the Landscape of Relational Syllogistic Logics.
CoRR, 2018

Reasoning About the Sizes of Sets: Progress, Problems, and Prospects.
Proceedings of the fourth Workshop on Bridging the Gap between Human and Automated Reasoningco-located with the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence (IJCAI-ECAI 2018), 2018

Long-Term Values in Markov Decision Processes, (Co)Algebraically.
Proceedings of the Coalgebraic Methods in Computer Science, 2018

Implementations of Natural Logics.
Proceedings of the 3rd International Workshop on Automated Reasoning in Quantified Non-Classical Logics (ARQNL 2018) affiliated with the International Joint Conference on Automated Reasoning (IJCAR 2018), 2018

A Monotonicity Calculus and Its Completeness.
Proceedings of the 15th Meeting on the Mathematics of Language, 2017

Natural Logic in AI and Cognitive Science.
Proceedings of the 28th Modern Artificial Intelligence and Cognitive Science Conference 2017, 2017

Precongruences and Parametrized Coinduction for Logics for Behavioral Equivalence.
Proceedings of the 7th Conference on Algebra and Coalgebra in Computer Science, 2017

22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015).
Log. J. IGPL, 2016

On finitary functors and their presentations.
J. Comput. Syst. Sci., 2015

On Final Coalgebras of Power-Set Functors and Saturated Trees - To George Janelidze on the Occasion of His Sixtieth Birthday.
Appl. Categorical Struct., 2015

Explaining Watson: Polymath Style.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Eigenvalues and Transduction of Morphic Sequences: Extended Version.
CoRR, 2014

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014

Eigenvalues and Transduction of Morphic Sequences.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra.
Proceedings of the Horizons of the Mind. A Tribute to Prakash Panangaden, 2014

Three Etudes on Logical Dynamics and the Program of Natural Logic.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

Editors' Introduction: The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing.
J. Philos. Log., 2013

Well-Pointed Coalgebras
Log. Methods Comput. Sci., 2013

The Third Life of Quantum Logic: Quantum Logic Inspired by Quantum Computing
CoRR, 2013

Abstract GSOS Rules and a Modular Treatment of Recursive Definitions.
Log. Methods Comput. Sci., 2013

A Complete Calculus of Monotone and Antitone Higher-Order Functions.
Proceedings of the TACL 2013. Sixth International Conference on Topology, Algebra and Categories in Logic, Vanderbilt University, Nashville, Tennessee, USA, July 28, 2013

The Soundness of Internalized Polarity Marking.
Stud Logica, 2012

Automatic Sequences and Zip-Specifications.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Well-Pointed Coalgebras (Extended Abstract).
Proceedings of the Foundations of Software Science and Computational Structures, 2012

On Finitary Functors and Their Presentations.
Proceedings of the Coalgebraic Methods in Computer Science - 11th International Workshop, 2012

A Complete Logical System for the Equality of Recursive Terms for Sets.
Proceedings of the Logic and Program Semantics, 2012

Syllogistic Logic with Comparative Adjectives.
J. Log. Lang. Inf., 2011

Connections of coalgebra and semantic modeling.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Power-Set Functors and Saturated Trees.
Proceedings of the Computer Science Logic, 2011

A Note on Expressive Coalgebraic Logics for Finitary Set Functors.
J. Log. Comput., 2010

Syllogistic Logics with Verbs.
J. Log. Comput., 2010

CIA Structures and the Semantics of Recursion.
Proceedings of the Foundations of Software Science and Computational Structures, 2010

Logics for Two Fragments beyond the Syllogistic Boundary.
Proceedings of the Fields of Logic and Computation, 2010

Logics for the Relational Syllogistic.
Rev. Symb. Log., 2009

Special Issue on the Occasion of Johan van Benthem's 60th Birthday - Editorial.
J. Philos. Log., 2009

Intersecting Adjectives in Syllogistic Logic.
Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

Natural Logic and Semantics.
Proceedings of the Logic, Language and Meaning - 17th Amsterdam Colloquium, 2009

Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59].
Theor. Comput. Sci., 2008

Confusion of memory.
Inf. Process. Lett., 2008

Topology and Epistemic Logic.
Proceedings of the Handbook of Spatial Logics, 2007

Finite Models Constructed from Canonical Formulars.
J. Philos. Log., 2007

Applications of modal logic in linguistics.
Proceedings of the Handbook of Modal Logic., 2007

The category-theoretic solution of recursive program schemes.
Theor. Comput. Sci., 2006

Final coalgebras for functors on measurable spaces.
Inf. Comput., 2006

Recursion Theorems and Self-Replication Via Text Register Machine Programs.
Bull. EATCS, 2006

Uniform Functors on Sets.
Proceedings of the Algebra, Meaning, and Computation, 2006

Recursive Program Schemes: Past, Present, and Future.
Proceedings of the Algebraic Methodology and Software Technology, 2006

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, 2005

The Undecidability of Iterated Modal Relativization.
Stud Logica, 2005

Introduction: special issue on selected papers from the Fifth Workshop on Coalgebraic Methods in Computer Science.
Math. Struct. Comput. Sci., 2005

Quantum logic as motivated by quantum computing.
J. Symb. Log., 2005

Logics for Epistemic Programs.
Synth., 2004

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, 2004

Harsanyi Type Spaces and Final Coalgebras Constructed from Satisfied Theories.
Proceedings of the Workshop on Coalgebraic Methods in Computer Science, 2004

Proceedings of the Coalgebraic Methods in Computer Science, 2002

Parametric corecursion.
Theor. Comput. Sci., 2001

Electron. Notes Theor. Comput. Sci., 2001

Simple Equational Specifications of Rational Arithmetic.
Discret. Math. Theor. Comput. Sci., 2001

Exploring Logical Dynamics, Johan van Benthem.
J. Log. Lang. Inf., 2000

The Johnson Graphs Satisfy a Distance Extension Property.
Comb., 2000

Recursion and Corecursion Have the Same Equational Logic.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Erratum to "Coalgebraic Logic": Ann. pure appl. logic 96 (1999) 277-317.
Ann. Pure Appl. Log., 1999

Coalgebraic Logic.
Ann. Pure Appl. Log., 1999

The Logic of Recursive Equations.
J. Symb. Log., 1998

Modal Correspondence for Models.
J. Philos. Log., 1998

The Logic of Public Announcements and Common Knowledge and Private Suspicions.
Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-98), 1998

On the Foundations of Corecursion.
Log. J. IGPL, 1997

Situation Theory.
Proceedings of the Handbook of Logic and Language., 1997

Topological Reasoning and the Logic of Knowledge.
Ann. Pure Appl. Log., 1996

Vicious circles - on the mathematics of non-wellfounded phenomena.
CSLI lecture notes series 60, CSLI, ISBN: 978-1-57586-009-1, 1996

Dynamic Interpretations of Constraint-Based Grammar Formalisms.
J. Log. Lang. Inf., 1995

Power Set Recursion.
Ann. Pure Appl. Log., 1995

Modal Logic and Algebraic Specifications.
Theor. Comput. Sci., 1993

Some Formal Properties of Stratified Feature Grammars.
Ann. Math. Artif. Intell., 1993

A Unification-Based Parser for Relational Grammar.
Proceedings of the 31st Annual Meeting of the Association for Computational Linguistics, 1993

Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability.
Theor. Comput. Sci., 1992

Distanced graphs.
Discret. Math., 1992

Topological Reasoning and The Logic of Knowledge.
Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

Non-Well-Founded Sets Modeled as Ideal Fixed Points
Inf. Comput., July, 1991

Books received.
Stud Logica, 1991

Generalization of Final Algebra Semantics by Relativization.
Proceedings of the Mathematical Foundations of Programming Semantics, 5th International Conference, Tulane University, New Orleans, Louisiana, USA, March 29, 1989

Non-Well-Founded Sets Obtained from Ideal Fixed Points
Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Algebraic Operational Semantics and Occam.
Proceedings of the CSL '89, 1989

Optimal semantics of data type extensions.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988