Skip to search formSkip to main contentSkip to account menu

EQP

EQP, an abbreviation for equational prover, is an automated theorem proving program for equational logic, developed by the Mathematics and Computer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

2 relations
Automated theorem provingRobbins algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
ACFS: a completely fair scheduler for asymmetric single-isa multicore systems
Single-ISA (instruction set architecture) asymmetric multicore processors (AMPs) were shown to deliver higher performance per… 
2015
2015
Comparative Quantifiers and Negation: Implications for Scope Economy
I examine the scopal interactions between comparative quantifier phrases (CQPs) and negation and argue, based on the complex… 
2014
2014
Analysis of semi-distributed and global hydrological models in the central tropical basins of the Gulf of Mexico to the effects of extreme hydrometeorological phenomena
The progressive change in weather conditions in the world, have caused an increase in the frequency and severity of… 
2013
2013
Computer Theorem Proving and HoTT
Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the ‘LT’ LOGIC… 
2012
2012
Entropic Image Restoration as a Dynamic System with Entropy Operator // Image Restoration Recent Advances and Applications, Edited by Aymeric Histace, INTECH
2010
2010
Visual Spatio-Temporal Programming with a 3D Region Connection Calculus
The ability to perform qualitative spatial reasoning over a collection of 3D objects would be useful for a variety of problem… 
2002
2002
Comparing EQP and MOD_{p^k}P using Polynomial Degree Lower Bounds
We show that an oracle A that contains either 1/4 or 3/4 of all strings of length n can be used to separate EQP from the counting… 
1997
1997
First Order Logic in Practice
There is a trend away from monolithic automated theorem provers towards using automation as a tool in support of interactive… 
1994
1994
Specifying Instruction-Set Architectures in HOL: A Primer
This paper presents techniques for specifying microprocessor instruction set syntax and semantics in the HOL theorem proving… 
1984
1984
Validation of a fault-tolerant clock synchronization system
A validation method for the synchronization subsystem of a fault tolerant computer system is investigated. The method combines… 
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)