Skip to search formSkip to main contentSkip to account menu

Herbrand Award

The Herbrand Award for Distinguished Contributions to Automated Reasoning is an award given by CADE Inc. (although it predates the formal… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Automated theorem provingCompetitions and prizes in artificial intelligenceConference on Automated DeductionEdmund M. Clarke

Broader (1)

Logic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Cut-Elimination in Schematic Proofs and Herbrand Sequents
In a recent paper [8], a procedure was developed extending the first-order CERES method [4] so that it can handle cut-elimination… 
2013
2013
THE GLEASON COVER OF A REALIZABILITY TOPOS
Recently Benno van den Berg (1) introduced a new class of realizability toposes which he christened Herbrand toposes. These… 
Review
2009
Review
2009
Learning Semantic Web Rules : State of the Art and Directions of Research
The acquisition of Semantic Web rules is very demanding and can be automated though partially by applying Machine Learning (ML… 
2009
2009
Describing proofs by short tautologies
2007
2007
SEKI is published by the following institutions : German Research
We give some lectures on the work on formal logic of Jacques He rbrand, and sketch his life and his influence on automated… 
1995
1995
A constructor-based EI-model semantics of EI-CTRS
This paper investigates the semantics of conditional term rewriting systems with negation (denoted by EI-CTRS), called… 
1993
1993
First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment
AbstractThis paper investigates a consistent versioncwasof Reiter's closed-world assumptioncwa. It provides a syntactic… 
1992
1992
Remarks on Herbrand normal forms and Herbrand realizations
SummaryLetAH be the Herbrand normal form ofA andAH,D a Herbrand realization ofAH. We show(i)There is an example of an (open… 
1982
1982
On effective axiomatizations of Hoare logics
For a wide class of programming languages P and expressive interpretations I, we show that there exist sound and relatively… 
Review
1982
Review
1982
Review of "Unsolvable classes of quantificational formulas" by Harry R. Lewis. Addison-Wesley 1979. and "The decision problem: solvable classes of quantificational formulas" by Burton Dreben and…
These two books are best considered as companion volumes. They both treat the decision problem for formulas of first order logic… 
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)