Skip to search formSkip to main contentSkip to account menu

Automated theorem proving

Known as: Automatic proof system, Automatic theorem proving, List of automated theorem provers 
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACM Turing AwardAlgebraic normal formAutomated proof checkingCADE ATP System Competition

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
TDM Virtual-Circuit Configuration for Network-on-Chip
In network-on-chip (NoC), time-division-multiplexing (TDM) virtual circuits (VCs) have been proposed to satisfy the quality-of… 
2007
2007
Another look at automated theorem-proving
I examine the use of automated theorem-proving for reductionist security arguments in cryptography and discuss three papers that… 
Highly Cited
2004
Highly Cited
2004
Proportionale Aktivierung von ATPase-Aktivität und Kontraktionsspannung durch Calciumionen in isolierten contractilen Strukturen verschiedener Muskelarten
Summary“Isolated” contractile Actomyosinsystems (i.e. glycerolextracted musclefibres) were suspended in ATP-saltsolutions. A… 
Highly Cited
2001
Highly Cited
2001
Refined Search Tree Technique for Dominating Set on Planar Graphs 1
We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an… 
2000
2000
Chaining techniques for automated theorem proving in many-valued logics
We apply chaining techniques to automated theorem proving in many-valued logics. In particular, we show that superposition… 
1999
1999
Three Tactic Theorem Proving
We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic… 
Review
1990
Review
1990
Many-Sorted Inferences in Automated Theorem Proving
A brief account of the basic ideas and advantages of many-sorted first-order logic is given. Based on this survey, a many-sorted… 
1986
1986
Paths to High-Performance Automated Theorem Proving
We present four components of a strategy for the implementation of high-performance automated theorem proving systems. These are… 
1985
1985
Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques
Recent findings indicate that logic design still constitutes 50 percent of the total design effort, and yet few automated tools… 
Highly Cited
1980
Highly Cited
1980
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities
A modified resolution procedure is described which has been designed to prove theorems about general linear inequalities. This… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)