Paper
Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas
Authors
Fabian Vehlken, Thomas Zeume, Emilio Carrasco Bustamante, Maëlle Cornély, Lukas Pradel
Abstract
First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for (non-)equivalence and to provide explanations for non-equivalence. We propose such methods based on both theoretical insights and existing tools, implement them, and report on experiments testing their effectiveness on a large educational data set with > 100.000 pairs of first-order formulas.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2602.19673v1</id>\n <title>Identifying and Explaining (Non-)Equivalence of First-Order Logic Formulas</title>\n <updated>2026-02-23T10:17:50Z</updated>\n <link href='https://arxiv.org/abs/2602.19673v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2602.19673v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for (non-)equivalence and to provide explanations for non-equivalence. We propose such methods based on both theoretical insights and existing tools, implement them, and report on experiments testing their effectiveness on a large educational data set with > 100.000 pairs of first-order formulas.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='cs.LO'/>\n <published>2026-02-23T10:17:50Z</published>\n <arxiv:primary_category term='cs.LO'/>\n <author>\n <name>Fabian Vehlken</name>\n </author>\n <author>\n <name>Thomas Zeume</name>\n </author>\n <author>\n <name>Emilio Carrasco Bustamante</name>\n </author>\n <author>\n <name>Maëlle Cornély</name>\n </author>\n <author>\n <name>Lukas Pradel</name>\n </author>\n </entry>"
}