Conference proceedings
© 1986

8th International Conference on Automated Deduction

Oxford, England, July 27- August 1, 1986. Proceedings

Editors:

Jörg H. Siekmann

Jörg H. Siekmann

View editor publications

You can also search for this editor in PubMed Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 230)

12k Accesses
583 Citations
3 Altmetric

Sections

Table of contents
Keywords
Bibliographic Information
Publish with us

Buy it now

Softcover Book USD 54.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (74 papers)

Front Matter

PDF
Connections and higher-order logic
- Peter B. Andrews
Pages 1-4
Commutation, transformation, and termination
- Leo Bachmair, Nachum Dershowitz
Pages 5-20
Full-commutation and fair-termination in equational (and combined) term-rewriting systems
- Sara Porat, Nissim Francez
Pages 21-41
An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations
- Ahlem Ben Cherifa, Pierre Lescanne
Pages 42-51
Proving termination of associative commutative rewriting systems by rewriting
- Isabelle Gnaedig, Pierre Lescanne
Pages 52-61
Relating resolution and algebraic completion for Horn logic
- Roland Dietrich
Pages 62-78
A simple non-termination test for the Knuth-Bendix method
- David A. Plaisted
Pages 79-88
A new formula for the execution of categorical combinators
- R. D. Lins
Pages 89-98
Proof by induction using test sets
- Deepak Kapur, Paliath Narendran, Hantao Zhang
Pages 99-117
How to prove equivalence of term rewriting systems without induction
- Yoshihito Toyama
Pages 118-127
Sufficient completeness, term rewriting systems and ”anti-unification”
- Hubert Comon
Pages 128-140
A new method for establishing refutational completeness in theorem proving
- Jieh Hsiang, Michael Rusinowitch
Pages 141-152
A theory of diagnosis from first principles
- R. Reiter
Pages 153-153
Some contributions to the logical analysis of circumscription
- Gerhard Jaeger
Pages 154-171
Modal theorem proving
- Martín Abadi, Zohar Manna
Pages 172-189
Computational aspects of three-valued logic
- P. H. Schmitt
Pages 190-198
Resolution and quantified epistemic logics
- Kurt Konolige
Pages 199-208
A commonsense theory of nonmonotonic reasoning
- Frank M. Brown
Pages 209-228
Negative paramodulation
- L. Wos, W. McCune
Pages 229-239

Keywords

Bibliographic Information

Book Title: 8th International Conference on Automated Deduction
Book Subtitle: Oxford, England, July 27- August 1, 1986. Proceedings
Editors: Jörg H. Siekmann
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-16780-3
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1986
Softcover ISBN: 978-3-540-16780-8Published: 01 July 1986
eBook ISBN: 978-3-540-39861-5Published: 08 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XII, 716
Topics: Mathematical Logic and Foundations, Mathematical Logic and Formal Languages, Artificial Intelligence

Publish with us

Policies and ethics

Access via your institution

Buy it now

Softcover Book USD 54.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Learn about institutional subscriptions