Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,168,394 papers from all fields of science
Search
Sign In
Create Free Account
Handbook of Automated Reasoning
The Handbook of Automated Reasoning (ISBN 0444508139, 2128 pages) is a collection of survey articles on the field of automated reasoning. Published…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Automated reasoning
Frank Pfenning
Harald Ganzinger
Inductive reasoning
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Refutation of Quantified Rewrite Rules
C. James
2020
Corpus ID: 214135082
We evaluate two quantified rewrite rules linked to Handbook of automated reasoning, which are not tautologous and hence refute…
Expand
Review
2012
Review
2012
UNIF 26 26 th International Workshop on Unification Proceedings July 1 , 2012 Manchester , United Kingdom
Santiago Escobar
,
Konstantin Korovin
,
V. Rybakov
2012
Corpus ID: 6041835
Unification modulo equational theories was originally introduced in automated deduction and term rewriting, but has recently also…
Expand
2010
2010
Computing an Ontological Semantics for a Natural Language Fragment
Bartlomiej Antoni Szymczak
,
J. Nilsson
,
Per Anker Jensen
2010
Corpus ID: 64677605
The key objective of the research that has been carried out has been to establish theoretically sound connections between the…
Expand
2010
2010
A Tableau Calculus for Dummett Logic Based on Increasing the Formulas Equivalent to the True and the Replacement Rule
G. Fiorino
2010
Corpus ID: 16446651
. In this paper we present a multiple premise tableau calculus for propositional Dummett Logic. The aim is to improve the e…
Expand
2009
2009
A Resolution Based Description Logic Calculus
Zsolt Zombori
Description Logics
2009
Corpus ID: 10747550
We present a resolution based reasoning algorithm called DL calculus that decides concept satisfiability for the SHQ language…
Expand
2009
2009
Paramodulation with Well-founded Orderings
Miquel Bofill
,
A. Rubio
Journal of Logic and Computation
2009
Corpus ID: 10894697
For many years, all existing completeness results for Knuth–Bendix completion and ordered paramodulation required the term…
Expand
2009
2009
Raisonnement Automatisé: Principes et Applications (partie I: logique du premier ordre)
N. Peltier
2009
Corpus ID: 9494920
This document contains the first part of the M2R course RAPA: Automated Reasoning: Principle and Applications. It presents the…
Expand
2008
2008
Rewriting Interpolants
C. Lynch
,
Yuefeng Tang
Fixed Points in Computer Science
2008
Corpus ID: 16274460
2007
2007
Multi-tier programming
2007
Corpus ID: 44493249
Multi-tier applications are traditionally designed in the style of a client-server architecture, forcing different parts of the…
Expand
2006
2006
Saturation Up to Redundancy for Tableau and Sequent Calculi
M. Giese
Logic Programming and Automated Reasoning
2006
Corpus ID: 15451858
We discuss an adaptation of the technique of saturation up to redundancy, as introduced by Bachmair and Ganzinger [1], to tableau…
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