Automated Reasoning

1. Front Matter

   PDF

2. Invited Talks

   1. Taking Satisfiability to the Next Level with Z3

      • Nikolaj Bjørner

      Pages 1-8

   2. Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics

      • Yuri Matiyasevich

      Pages 9-9

   3. SAT and SMT Are Still Resolution: Questions and Challenges

      • Robert Nieuwenhuis

      Pages 10-13

3. Full Papers and System Descriptions

   1. Unification Modulo Synchronous Distributivity

      • Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michael Rusinowitch

      Pages 14-29

   2. SAT Encoding of Unification in \(\mathcal{ELH}_{{R}^+}\) w.r.t. Cycle-Restricted Ontologies

      • Franz Baader, Stefan Borgwardt, Barbara Morawska

      Pages 30-44

   3. UEL: Unification Solver for the Description Logic \(\mathcal{EL}\) – System Description

      • Franz Baader, Julian Mendez, Barbara Morawska

      Pages 45-51

   4. Effective Finite-Valued Semantics for Labelled Calculi

      • Matthias Baaz, Ori Lahav, Anna Zamansky

      Pages 52-66

   5. A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic

      • François Bobot, Sylvain Conchon, Evelyne Contejean, Mohamed Iguernelala, Assia Mahboubi, Alain Mebsout et al.

      Pages 67-81

   6. How Fuzzy Is My Fuzzy Description Logic?

      • Stefan Borgwardt, Felix Distel, Rafael Peñaloza

      Pages 82-96

   7. Truthful Monadic Abstractions

      • Taus Brock-Nannestad, Carsten Schürmann

      Pages 97-110

   8. Satallax: An Automatic Higher-Order Prover

      • Chad E. Brown

      Pages 111-117

   9. From Strong Amalgamability to Modularity of Quantifier-Free Interpolation

      • Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise

      Pages 118-133

   10. SPARQL Query Containment under RDFS Entailment Regime

       • Melisachew Wudage Chekol, Jérôme Euzenat, Pierre Genevès, Nabil Layaïda

       Pages 134-148

   11. Automated Verification of Recursive Programs with Pointers

       • Frank de Boer, Marcello Bonsangue, Jurriaan Rot

       Pages 149-163

   12. Security Protocols, Constraint Systems, and Group Theories

       • Stéphanie Delaune, Steve Kremer, Daniel Pasaila

       Pages 164-178

   13. Taming Past LTL and Flat Counter Systems

       • Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier

       Pages 179-193

   14. A Calculus for Generating Ground Explanations

       • Mnacho Echenim, Nicolas Peltier

       Pages 194-209

   15. EPR-Based Bounded Model Checking at Word Level

       • Moshe Emmer, Zurab Khasidashvili, Konstantin Korovin, Christoph Sticksel, Andrei Voronkov

       Pages 210-224

   16. Proving Non-looping Non-termination Automatically

       • Fabian Emmes, Tim Enger, Jürgen Giesl

       Pages 225-240

This book constitutes the refereed proceedings of the 6th International Joint Conference on Automated Reasoning, IJCAR 2012, held in Manchester, UK, in June 2012. IJCAR 2012 is a merger of leading events in automated reasoning, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems), FTP (International Workshop on First-Order Theorem Proving), and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). The 32 revised full research papers and 9 system descriptions presented together with 3 invited talks were carefully reviewed and selected from 116 submissions. The papers address all aspects of automated reasoning, including foundations, implementations, and applications.

• description logic
• formal methods
• model checking
• rules
• satisfiability

• Fakultät für Informatik, Technische Universität Wien, Wien, Austria

  Bernhard Gramlich

• École Polytechnique, INRIA Saclay and Laboratoire d’Informatique, Palaiseau Cedex, France

  Dale Miller

• School of Computer Science, University of Manchester, Manchester, UK

  Uli Sattler

Policies and ethics