Skip to search formSkip to main contentSkip to account menu
You are currently offline. Some features of the site may not work correctly.

Herbrand Award

The Herbrand Award for Distinguished Contributions to Automated Reasoning is an award given by CADE Inc. (although it predates the formal… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its… Expand
  • figure 1
2011
2011
Let R be a local ring, and let M and N be finitely generated R-modules such that M has finite complete intersection dimension. In… Expand
2009
2009
Abstract Herbrand’s theorem is one of the most fundamental results about first-order logic. In the context of proof analysis… Expand
2009
2009
We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem… Expand
  • figure 2
2004
2004
This is a slightly enhanced version of the acceptance speech given by the author after receiving the Herbrand Award at the 19th… Expand
  • figure 6
  • figure 7
  • figure 8
2001
2001
An atomic representation of a Herbrand model (ARM) is a finite set of (not necessarily ground) atoms over a given Herbrand… Expand
  • figure 1
1997
1997
The Robbins problem was solved in October 1996 [7] by the equational theorem prover EQP [6]. Although the solution was automatic… Expand
1994
1994
The paper describes a case study that explores the idea of building a planner with a neat semantics of the plans it produces, by… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 7
1982
1982
For a wide class of programming languages P and expressive interpretations I, we show that there exist sound and relatively… Expand
  • figure 3-4
Review
1982
Review
1982
These two books are best considered as companion volumes. They both treat the decision problem for formulas of first order logic… Expand