Image de couverture de livre

Using Large Language Models for (De-)Formalization and Natural Argumentation Exercises for Beginner's Students

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Carl, Merlin
Format:	Preprint
Publié:	2023
Sujets:	Computation and Language Logic
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Improving the Diproche CNL through Autoformalization via Large Language Models
par: Carl, Merlin
Publié: (2023)

NILE: Formalizing Natural-Language Descriptions of Formal Languages
par: Kneisel, Tristan, et autres
Publié: (2026)

A Neurosymbolic Approach to Natural Language Formalization and Verification
par: Bayless, Sam, et autres
Publié: (2025)

A Formalization of the Yul Language and Some Verified Yul Code Transformations
par: Coglio, Alessandro, et autres
Publié: (2025)

Pragmatics of Formally Verified Yet Efficient Static Analysis, in particular for Formally Verified Compilers
par: Monniaux, David
Publié: (2024)

Reliable Conversational Agents under ASP Control that Understand Natural Language
par: Zeng, Yankai
Publié: (2025)

Models of true arithmetic are integer parts of nice real closed fields
par: Carl, Merlin
Publié: (2013)

Hybrid Models for Natural Language Reasoning: The Case of Syllogistic Logic
par: Guzmán, Manuel Vargas, et autres
Publié: (2025)

Coherency through formalisations of Structured Natural Language, A case study on FRETish
par: Joosten, Joost J., et autres
Publié: (2026)

FSLI: An Interpretable Formal Semantic System for One-Dimensional Ordering Inference
par: Alkhairy, Maha, et autres
Publié: (2025)

Generics and Default Reasoning in Large Language Models
par: Kirkpatrick, James Ravi, et autres
Publié: (2025)

A Formal Semantics of the GraalVM Intermediate Representation
par: Webb, Brae J., et autres
Publié: (2021)

A Formally Verified Procedure for Width Inference in FIRRTL
par: Wang, Keyin, et autres
Publié: (2026)

Logical Relations for Formally Verified Authenticated Data Structures
par: Gregersen, Simon Oddershede, et autres
Publié: (2025)

What Formal Languages Can Transformers Express? A Survey
par: Strobl, Lena, et autres
Publié: (2023)

A Graded Modal Dependent Type Theory with Erasure, Formalized
par: Abel, Andreas, et autres
Publié: (2026)

Formal Analysis of Networked PLC Controllers Interacting with Physical Environments
par: Lee, Jaeseo, et autres
Publié: (2025)

Advancing Spatial Reasoning in Large Language Models: An In-Depth Evaluation and Enhancement Using the StepGame Benchmark
par: Li, Fangjun, et autres
Publié: (2024)

Four Formal Models of IEEE 1394 Link Layer
par: Garavel, Hubert, et autres
Publié: (2024)

ASP-Bench: From Natural Language to Logic Programs
par: Szeider, Stefan
Publié: (2026)

The Lost Melody Phenomenon
par: Carl, Merlin
Publié: (2014)

Randomness and Degree Theory for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2015)

Infinite Time Recognizability from Random Oracles and the Recognizable Jump Operator
par: Carl, Merlin
Publié: (2015)

The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines
par: Carl, Merlin
Publié: (2020)

Structures Associated with Real Closed Fields and the Axiom of Choice
par: Carl, Merlin
Publié: (2014)

Space-Bounded OTMs and REG$^{\infty}$
par: Carl, Merlin
Publié: (2017)

A Note on OTM-Realizability and Constructive Set Theories
par: Carl, Merlin
Publié: (2019)

Recognizable Realizability
par: Carl, Merlin
Publié: (2024)

Algorithmic Randomness for Infinite Time Register Machines
par: Carl, Merlin
Publié: (2014)

Taming Koepke's Zoo II: Register Machines
par: Carl, Merlin
Publié: (2019)

Reduction Complexities in Set Theory
par: Carl, Merlin
Publié: (2025)

Optimal Results on ITRM-recognizability
par: Carl, Merlin
Publié: (2013)

A Note on Clockability for Ordinal Turing Machines
par: Carl, Merlin
Publié: (2019)

The distribution of ITRM-recognizable reals
par: Carl, Merlin
Publié: (2012)

Lower bounds on $β(α)$ and other properties of $α$-ITRMs
par: Carl, Merlin
Publié: (2021)

A Note on Power-OTMs
par: Carl, Merlin
Publié: (2024)

Some Observations on Infinitary Complexity
par: Carl, Merlin
Publié: (2018)

The strange world of transfinite Melodies -- Recognizability for weak and strong infinite time $α$-register machines
par: Carl, Merlin
Publié: (2022)

Effective Reducibility for Statements of Arbitrary Quantifier Complexity with Ordinal Turing Machines
par: Carl, Merlin
Publié: (2024)

Generalized Effective Reducibility
par: Carl, Merlin
Publié: (2016)