Zobrazeno 1 - 10
of 122
pro vyhledávání: '"Lawrence S. Moss"'
Publikováno v:
Computational Linguistics, Vol 49, Iss 1 (2023)
Against the backdrop of the ever-improving Natural Language Inference (NLI) models, recent efforts have focused on the suitability of the current NLI datasets and on the feasibility of the NLI task as it is currently approached. Many of the recent st
Externí odkaz:
https://doaj.org/article/b4af7406fc844959963404016848648f
Autor:
Lawrence S. Moss
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 2 (2001)
We exhibit an initial specification of the rational numbers equipped with addition, subtraction, multiplication, greatest integer function, and absolute value. Our specification uses only the sort of rational numbers. It uses one hidden function; tha
Externí odkaz:
https://doaj.org/article/1eec6150683a49a7a913b0e1c8e8f9aa
Publikováno v:
Logics; Volume 1; Issue 2; Pages: 97-147
We build and study dynamic versions of epistemic logic. We study languages parameterized by an action signature that allows one to express epistemic actions such as (truthful) public announcements, completely private announcements to groups of agents
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::fc9bfdf121ed9724f66fc2515fafb140
Autor:
Lawrence S. Moss
Publikováno v:
Algebraic Structures in Natural Language ISBN: 9781003205388
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a2b4f6581f987aae52d4f14fd2609ec
https://doi.org/10.1201/9781003205388-10
https://doi.org/10.1201/9781003205388-10
Autor:
Alex Kruckman, Lawrence S. Moss
Publikováno v:
The Review of Symbolic Logic. 14:728-765
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 res
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c334983081b4aa251ff103fa3270b283
https://doi.org/10.1017/s1755020320000386
https://doi.org/10.1017/s1755020320000386
Publikováno v:
AAAI
This paper presents the most basic logics for reasoning about the sizes of sets that admit either the union of terms or the intersection of terms. That is, our logics handle assertions All x y and AtLeast x y, where x and y are built up from basic te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66bb17b43106eceeb94c2dddc2d0480f
https://doi.org/10.1609/aaai.v34i03.5677
https://doi.org/10.1609/aaai.v34i03.5677
Autor:
Lawrence S. Moss, Victoria Noquez
Publikováno v:
Coalgebraic Methods in Computer Science ISBN: 9783031107351
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::303765bcd8fdeee90c2daac29b24093b
https://doi.org/10.1007/978-3-031-10736-8_8
https://doi.org/10.1007/978-3-031-10736-8_8
Publikováno v:
Logic Journal of the IGPL. 27:766-776
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03c3756cb8b79a32a0d111bb6655664c
https://doi.org/10.1093/jigpal/jzz004
https://doi.org/10.1093/jigpal/jzz004
Publikováno v:
SEM
Deep learning (DL) based language models achieve high performance on various benchmarks for Natural Language Inference (NLI). And at this time, symbolic approaches to NLI are receiving less attention. Both approaches (symbolic and DL) have their adva
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37e3b977050adb7537de48ee9fdc85c9
https://doi.org/10.18653/v1/2021.starsem-1.7
https://doi.org/10.18653/v1/2021.starsem-1.7
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
Terminal coalgebras for a functor serve as semantic domains for state-based systems of various types. For example, behaviors of CCS processes, streams, infinite trees, formal languages and non-well-founded sets form terminal coalgebras. We present a
Externí odkaz:
https://doaj.org/article/1821ce7e953c47668be8429003e98200