Automated Reasoning

1. Front Matter

   Pages I-XVIII

   PDF

2. An Assumption-Based Approach for Solving the Minimal S5-Satisfiability Problem

   • Jean-Marie Lagniez, Daniel Le Berre, Tiago de Lima, Valentin Montmirail

   Pages 1-18

3. FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics

   • Yizheng Zhao, Renate A. Schmidt

   Pages 19-27

4. Superposition for Lambda-Free Higher-Order Logic

   • Alexander Bentkamp, Jasmin Christian Blanchette, Simon Cruanes, Uwe Waldmann

   Pages 28-46

5. Automated Reasoning About Key Sets

   • Miika Hannula, Sebastian Link

   Pages 47-63

6. A Tableaux Calculus for Reducing Proof Size

   • Michael Peter Lettmann, Nicolas Peltier

   Pages 64-80

7. FORT 2.0

   • Franziska Rapp, Aart Middeldorp

   Pages 81-88

8. Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover

   • Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel, Uwe Waldmann

   Pages 89-107

9. The Higher-Order Prover Leo-III

   • Alexander Steen, Christoph Benzmüller

   Pages 108-116

10. Well-Founded Unions

    • Jeremy Dawson, Nachum Dershowitz, Rajeev Goré

    Pages 117-133

11. Implicit Hitting Set Algorithms for Maximum Satisfiability Modulo Theories

    • Katalin Fazekas, Fahiem Bacchus, Armin Biere

    Pages 134-151

12. Cubicle-\(\mathcal {W}\): Parameterized Model Checking on Weak Memory

    • Sylvain Conchon, David Declerck, Fatiha Zaïdi

    Pages 152-160

13. \({\textsf {QRAT}}^{+}\): Generalizing QRAT by a More Powerful QBF Redundancy Property

    • Florian Lonsing, Uwe Egly

    Pages 161-177

14. A Why3 Framework for Reflection Proofs and Its Application to GMP’s Algorithms

    • Guillaume Melquiond, Raphaël Rieu-Helft

    Pages 178-193

15. Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic

    • Marcelo Finger, Sandro Preto

    Pages 194-210

16. Uniform Substitution for Differential Game Logic

    • André Platzer

    Pages 211-227

17. A Logical Framework with Commutative and Non-commutative Subexponentials

    • Max Kanovich, Stepan Kuznetsov, Vivek Nigam, Andre Scedrov

    Pages 228-245

18. Exploring Approximations for Floating-Point Arithmetic Using UppSAT

    • Aleksandar Zeljić, Peter Backeman, Christoph M. Wintersteiger, Philipp Rümmer

    Pages 246-262

19. Complexity of Combinations of Qualitative Constraint Satisfaction Problems

    • Manuel Bodirsky, Johannes Greiner

    Pages 263-278

20. A Generic Framework for Implicate Generation Modulo Theories

    • Mnacho Echenim, Nicolas Peltier, Yanis Sellami

    Pages 279-294

This book constitutes the refereed proceedings of the 9th International Joint Conference on Automated Reasoning, IJCAR 2018, held in Oxford, United Kingdom, in July 2018, as part of the Federated Logic Conference, FLoC 2018. In 2018, IJCAR unites CADE, TABLEAUX, and FroCoS, the International Symposium on Frontiers of Combining Systems, and, for the fourth time, is part of the Federated Logic Conference.
The 38 revised full research papers and 8 system descriptions presented together with two invited talks were carefully reviewed and selected from 108 submissions. The papers focus on topics such as logics, deductive systems, proof-search methods, theorem proving, model checking, verification, formal methods, and program analysis.

• artificial intelligence
• computability
• constraint theory
• decidability
• decision procedure
• first order logic
• formal logic
• modal logic
• model checking
• problem solving
• programing languages
• programming languages
• proof search methods
• satisfiability
• semantics
• software engineering
• software evaluation
• theorem provers
• theorem proving
• verification

• Université de Lorraine, Vandoeuvre-lès-Nancy, France

  Didier Galmiche

• Baden-Wuerttemberg Cooperative State University, Stuttgart, Germany

  Stephan Schulz

• University of Trento, Trento, Italy

  Roberto Sebastiani

Policies and ethics