Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 211,134,998 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Automated theorem proving
Competitions and prizes in artificial intelligence
Conference on Automated Deduction
Edmund M. Clarke
Expand
Broader (1)
Logic in computer science
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Herbrand-Confluence for Cut Elimination in Classical First Order Logic
Stefan Hetzl
,
Lutz Straßburger
Annual Conference for Computer Science Logic
2012
Corpus ID: 1428130
We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its…
Expand
2011
2011
Asymptotic behavior of Ext functors for modules of finite complete intersection dimension
Olgur Celikbas
,
H. Dao
2011
Corpus ID: 115177799
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
Lectures on Jacques Herbrand as a Logician
Claus-Peter Wirth
,
J. Siekmann
,
Christoph Benzmüller
,
S. Autexier
ArXiv
2009
Corpus ID: 8518142
We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem…
Expand
2003
2003
Herbrand Award Acceptance Speech
Peter B. Andrews
Journal of automated reasoning
2003
Corpus ID: 9542444
This is a slightly enhanced version of the acceptance speech given by the author after receiving the Herbrand Award at the 19th…
Expand
1997
1997
Well-Behaved Search and the Robbins Problem
W. McCune
International Conference on Rewriting Techniques…
1997
Corpus ID: 28009249
The Robbins problem was solved in October 1996 [7] by the equational theorem prover EQP [6]. Although the solution was automatic…
Expand
1994
1994
Turning an Action Formalism into a Planner - A Case Study
J. Hertzberg
,
S. Thiébaux
Journal of Logic and Computation
1994
Corpus ID: 7625383
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
1993
1993
First-order syntactic characterizations of minimal entailment, domain-minimal entailment, and Herbrand entailment
M. Suchenek
Journal of automated reasoning
1993
Corpus ID: 38135575
AbstractThis paper investigates a consistent versioncwasof Reiter's closed-world assumptioncwa. It provides a syntactic…
Expand
1992
1992
Remarks on Herbrand normal forms and Herbrand realizations
U. Kohlenbach
Archive for Mathematical Logic
1992
Corpus ID: 5074966
SummaryLetAH be the Herbrand normal form ofA andAH,D a Herbrand realization ofAH. We show(i)There is an example of an (open…
Expand
1982
1982
On effective axiomatizations of Hoare logics
E. Clarke
,
S. German
,
Joseph Y. Halpern
ACM-SIGACT Symposium on Principles of Programming…
1982
Corpus ID: 508523
For a wide class of programming languages P and expressive interpretations I, we show that there exist sound and relatively…
Expand
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…
J. Cherniavsky
SIGA
1982
Corpus ID: 44893298
These two books are best considered as companion volumes. They both treat the decision problem for formulas of first order logic…
Expand
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)
ACCEPT & CONTINUE