English
Related papers

Related papers: Evidence Algorithm and System for Automated Deduct…

200 papers

We present \textbf{QED}, an open-source multi-agent system that turns human-provided research questions into complete mathematical proofs without further human guidance. Its pipeline is designed to overcome common failures of single-query…

Artificial Intelligence · Computer Science 2026-05-25 Chenyang An , Qihao Ye , Minghao Pan , Jiayaun Zhang

Proof engineering is notoriously labor-intensive: proofs that are straightforward on paper often require lengthy scripts in theorem provers. Recent advances in large language models (LLMs) create new opportunities for proof automation:…

Programming Languages · Computer Science 2026-01-08 Yichen Xu , Martin Odersky

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a class of continuous real-time models of reactive systems for…

Programming Languages · Computer Science 2007-05-23 Emmanuel Beffara , Olivier Bournez , Hassen Kacem , Claude Kirchner

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a class of continuous real-time models of reactive systems for…

Logic in Computer Science · Computer Science 2009-07-20 Emmanuel Beffara , Olivier Bournez , Hassen Kacem , Claude Kirchner

Timed automata have been introduced by Rajeev Alur and David Dill in the early 90's. In the last decades, timed automata have become the de facto model for the verification of real-time systems. Algorithms for timed automata are based on…

Logic in Computer Science · Computer Science 2022-07-18 Patricia Bouyer , Paul Gastin , Frédéric Herbreteau , Ocan Sankur , B. Srivathsan

We consider the use of Quantifier Elimination (QE) technology for automated reasoning in economics. QE dates back to Tarski's work in the 1940s with software to perform it dating to the 1970s. There is a great body of work considering its…

Symbolic Computation · Computer Science 2018-05-16 Casey B. Mulligan , Russell Bradford , James H. Davenport , Matthew England , Zak Tonks

The field of geometric automated theorem provers has a long and rich history, from the early AI approaches of the 1960s, synthetic provers, to today algebraic and synthetic provers. The geometry automated deduction area differs from other…

Logic in Computer Science · Computer Science 2019-04-02 Nuno Baeta , Pedro Quaresma

In recent years, many design automation methods have been developed to routinely create approximate implementations of circuits and programs that show excellent trade-offs between the quality of output and required resources. This paper…

Neural and Evolutionary Computing · Computer Science 2021-08-17 Lukas Sekanina

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and…

Logic in Computer Science · Computer Science 2017-10-03 Ying Jiang , Jian Liu , Gilles Dowek , Kailiang Ji

Large language models (LLMs) have enabled agentic AI systems for scientific discovery, but most approaches remain limited to textbased reasoning without automated experimental verification. We propose MIND, an LLM-driven framework for…

Multiagent Systems · Computer Science 2026-04-16 Geonhee Ahn , Donghyun Lee , Hayoung Doo , Jonggeol Na , Hyunsoo Cho , Sookyung Kim

We report on several scenarios of using automated theorem proving software in university education. In particular, we focus on using the Theorema system in a software-enhanced logic-course for students in computer science or artificial…

Logic in Computer Science · Computer Science 2022-01-20 Wolfgang Windsteiger

Event-clock automata (ECA) are a well-known semantic subclass of timed automata (TA) which enjoy admirable theoretical properties, e.g., determinizability, and are practically useful to capture timed specifications. However, unlike for…

Formal Languages and Automata Theory · Computer Science 2024-08-07 S Akshay , Paul Gastin , R Govind , B Srivathsan

Proof theory began in the 1920's as a part of Hilbert's program, which aimed to secure the foundations of mathematics by modeling infinitary mathematics with formal axiomatic systems and proving those systems consistent using restricted,…

Logic · Mathematics 2017-12-19 Jeremy Avigad

Machine learning and artificial intelligence (ML/AI) are rapidly becoming an indispensable part of physics research, with domain applications ranging from theory and materials prediction to high-throughput data analysis. In parallel, the…

Noisy data, non-convex objectives, model misspecification, and numerical instability can all cause undesired behaviors in machine learning systems. As a result, detecting actual implementation errors can be extremely difficult. We…

Software Engineering · Computer Science 2017-06-28 Daniel Selsam , Percy Liang , David L. Dill

The automated generation of exercises may substantially reduce the time educators devote to manual exercise design. A major obstacle to the integration of such automation into teaching practice, however, lies in the ability to control the…

Logic in Computer Science · Computer Science 2026-03-10 João Mendes , João Marcos , Patrick Terrematte

One of the basic tasks which is responded for head of each university department, is employing lecturers based on some default factors such as experience, evidences, qualifies and etc. In this respect, to help the heads, some automatic…

Artificial Intelligence · Computer Science 2013-08-05 Shervan Fekri-Ershad , Hadi Tajalizadeh , Shahram Jafari

This survey paper is an expanded version of an invited keynote at the ThEdu'22 workshop, August 2022, in Haifa (Israel). After a short introduction on the developments of CAS, DGS and other useful technologies, we show implications in…

History and Overview · Mathematics 2023-03-20 Thierry Noah Dana-Picard

Since its beginnings in the 1940s, automated reasoning by computers has become a tool of ever growing importance in scientific research. So far, the rules underlying automated reasoning have mainly been formulated by humans, in the form of…

Computers and Society · Computer Science 2025-10-20 Konrad Hinsen

Despite the recent progress in automatic theorem provers, proof engineers are still suffering from the lack of powerful proof automation. In this position paper we first report our proof strategy language based on a meta-tool approach.…

Artificial Intelligence · Computer Science 2017-01-12 Yutaka Nagashima