Logic for Programming, Artificial Intelligence, and Reasoning: 16th International Conference, LPAR-16, Dakar, Senegal, April 25–May 1, 2010, Revised Selected Papers

526 Pages·2010·5.38 MB·English

by  Geoff Sutcliffe (auth.)

Lecture Notes in Artificial Intelligence 6355
EditedbyR.Goebel,J.Siekmann,andW.Wahlster
Subseries of Lecture Notes in Computer Science
Edmund M. Clarke Andrei Voronkov (Eds.)
Logic for Programming,
Artificial Intelligence,
and Reasoning
16th International Conference, LPAR-16
Dakar, Senegal, April 25–May 1, 2010
Revised Selected Papers
1 3
SeriesEditors
RandyGoebel,UniversityofAlberta,Edmonton,Canada
JörgSiekmann,UniversityofSaarland,Saarbrücken,Germany
WolfgangWahlster,DFKIandUniversityofSaarland,Saarbrücken,Germany
VolumeEditors
EdmundM.Clarke
CarnegieMellonUniversity
ComputerScienceDepartment
5000ForbesAvenue,Pittsburgh,PA15213-3891, USA
E-mail:[email protected]
AndreiVoronkov
UniversityofManchester
SchoolofComputerScience
KilburnBuilding,OxfordRoad,Manchester,M139PL,UK
E-mail:[email protected]
LibraryofCongressControlNumber:2010939948
CRSubjectClassification(1998):I.2.3,I.2,F.4.1,F.3,D.2.4,D.1.6,D.3
LNCSSublibrary:SL7–ArtificialIntelligence
ISSN 0302-9743
ISBN-10 3-642-17510-4SpringerBerlinHeidelbergNewYork
ISBN-13 978-3-642-17510-7SpringerBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
springer.com
©Springer-VerlagBerlinHeidelberg2010
PrintedinGermany
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper 06/3180
Preface
The 16th LPAR event was held in Africa for the very first time, signalling a
bright future for a conference with a glowing history. For many years it was
a goal of the steering committee to hold LPAR in Africa and the enthusiasm
for our presence far exceeded our expectations. With the help of local organiser
WalyFaye,LPARintegrateditselfintothesurroundingcultureandatmosphere,
allowing participants to enjoy a collage of music, dancing, food, and logic.
OrganisationalissuescausedLPAR16,originallyintendedtobeheldin2009,
to be delayed to 2010. Despite this, LPAR 16 received 47 submissions. Each
submissionwasreviewedbyatleast4,andonaverage4.1,programmecommittee
members. The committee members decided to accept 27 regular papers and 9
short papers. They deliberated electronically via the EasyChair system, which
continued to provide a platform for smoothly carrying out all aspects of the
program selection and finalization and conference registration. It has been a
tradition of LPAR to invite some of the most influential researchers in its focus
areatodiscusstheirworkandtheirvisionforthefield.Thisyear’sdistinguished
speakers were Geoff Sutcliffe (University of Miami, USA) and Michel Parigot
(PPS, France). This volume contains the revised versions of the accepted full
papers as well as the full text of Geoff Sutcliffe’s talk.
This conference would not have been possible without the hard work of the
many people who relentlessly handled the local arrangements, especially Wale
Faye,whoofferedusthefullhospitalityofhiscountry,villageandextendedfam-
ily.Wearemostgratefultothe32membersoftheProgramCommittee,whodid
an excellent job in handling the submissions, and the additional reviewers,who
assisted them in their evaluations. We greatly appreciate the generous support
of our sponsors, the Office of Naval Research and Microsoft Research. We are
alsoespeciallygratefultoMichaelGabbayfororganising,draftingandcompiling
these proceedings. Finally we are grateful to the authors, the invited speakers
and the attendees who made this conference an enjoyable and fruitful event.
June 2010 Edmund Clarke
Andrei Voronkov
Conference Organisation
Programme Chairs
Edmund Clarke
Andrei Voronkov
Programme Committee
Rajeev Alur Michael Kohlhase
Matthias Baaz Konstantin Korovin
Peter Baumgartner Laura Kovacs
Armin Biere Orna Kupferman
Nikolaj Bjorner Leonid Libkin
Iliano Cervesato Aart Middeldorp
Agata Ciabattoni Luke Ong
Hubert Comon-Lundh Frank Pfenning
Nachum Dershowitz Andreas Podelski
Ju¨rgen Giesl Andrey Rybalchenko
Guillem Godoy Helmut Seidl
Georg Gottlob Geoff Sutcliffe
Jean Goubault-Larrecq Ashish Tiwari
Reiner Haehnle Toby Walsh
Claude Kirchner Christoph Weidenbach
External Reviewers
Wolfgang Ahrendt Adrian Craciun
Martin Avanzini Hans de Nivelle
Andreas Bauer Marc Denecker
Ralph Becket Manfred Droste
Eli Ben-Sasson Stephan Falke
Paul Brauner Oliver Fasching
Angelo Brillout Germain Faure
Christopher Broadbent Arnaud Fietzke
Robert Brummayer Bernd Finkbeiner
Roberto Bruttomesso Alain Finkel
Richard Bubel Guido Fiorino
Guillaume Burel Carsten Fuhs
Elie Bursztein Deepak Garg
Silvia Calegari St´ephane Gaubert
VIII Conference Organisation
Samir Genaim Florian Rabe
Valentin Goranko Jason Reed
Torsten Grust Andreas Reuss
Stefan Hetzl Zdenek Sawa
Matthias Horbach Peter Schneider-Kamp
Fulya Horozal Lutz Schr¨oder
Radu Iosif Dirk Seifert
Tomi Janhunen Olivier Serre
Predrag Janicic Niklas So¨rensson
Christian Kern Christoph Sticksel
Michel Ludwig Lutz Strassburger
Ines Lynce Martin Suda
Michael Maher Kazushige Terui
William McCune Rene Thiemann
Chris Mears Michael Vanden Boom
Georg Moser Eelco Visser
Nina Narodytska Bogdan Warinschi
Robert Nieuwenhuis Markus Wedler
Albert Oliveras Martin Weichert
Carsten Otto Benjamin Weiss
Bruno Woltzenlogel Paleo Patrick Wischnewski
Luca Paolini Harald Zankl
Nicolas Peltier
Table of Contents
The TPTP World – Infrastructure for Automated Reasoning .......... 1
Geoff Sutcliffe
Speed-Up Techniques for Negation in Grounding..................... 13
Amir Aavani, Shahab Tasharrofi, Gulay Unel,
Eugenia Ternovska, and David Mitchell
Constraint-Based Abstract Semantics for Temporal Logic: A Direct
Approach to Design and Implementation............................ 27
Gourinath Banda and John P. Gallagher
On the Equality of Probabilistic Terms ............................. 46
Gilles Barthe, Marion Daubignard, Bruce Kapron,
Yassine Lakhnech, and Vincent Laporte
ProgramLogics for Homogeneous Meta-programming................. 64
Martin Berger and Laurence Tratt
Verifying Pointer and String Analyses with Region Type Systems ...... 82
Lennart Beringer, Robert Grabowski, and Martin Hofmann
ABC: Algebraic Bound Computation for Loops ...................... 103
R´egis Blanc, Thomas A. Henzinger, Thibaud Hottelier, and
Laura Kova´cs
Hardness of Preorder Checking for Basic Formalisms ................. 119
Laura Bozzelli, Axel Legay, and Sophie Pinchinat
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via
Atomic Flows and Threshold Formulae ............................. 136
Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, and
Michel Parigot
Pairwise Cardinality Networks..................................... 154
Michael Codish and Moshe Zazon-Ivry
Logic and Computation in a Lambda Calculus with Intersection and
Union Types .................................................... 173
Daniel J. Dougherty and Luigi Liquori
Graded Alternating-Time Temporal Logic........................... 192
Marco Faella, Margherita Napoli, and Mimmo Parente
Non-oblivious Strategy Improvement ............................... 212
John Fearnley
X Table of Contents
A Simple Class of Kripke-Style Models in Which Logic and
Computation Have Equal Standing................................. 231
Michael Gabbay and Murdoch J. Gabbay
Label-Free Proof Systems for Intuitionistic Modal Logic IS5 ........... 255
Didier Galmiche and Yakoub Salhi
An Intuitionistic Epistemic Logic for Sequential Consistency on Shared
Memory ........................................................ 272
Yoichi Hirai
Disunification for Ultimately Periodic Interpretations................. 290
Matthias Horbach
Synthesis of Trigger Properties .................................... 312
Orna Kupferman and Moshe Y. Vardi
Semiring-Induced Propositional Logic: Definition and
Basic Algorithms ................................................ 332
Javier Larrosa, Albert Oliveras, and Enric Rodr´ıguez-Carbonell
Dafny: An Automatic ProgramVerifier for Functional Correctness ..... 348
K. Rustan M. Leino
Relentful Strategic Reasoning in Alternating-Time Temporal Logic..... 371
Fabio Mogavero, Aniello Murano, and Moshe Y. Vardi
Counting and Enumeration Problems with Bounded Treewidth ........ 387
Reinhard Pichler, Stefan Ru¨mmele, and Stefan Woltran
The Nullness Analyser of Julia.................................... 405
Fausto Spoto
Qex: Symbolic SQL Query Explorer ................................ 425
Margus Veanes, Nikolai Tillmann, and Jonathan de Halleux
Automated Proof Compression by Invention of New Definitions........ 447
Jiˇr´ı Vyskoˇcil, David Stanovsk´y, and Josef Urban
Atomic Cut Introduction by Resolution: Proof Structuring and
Compression .................................................... 463
Bruno Woltzenlogel Paleo
Satisfiability of Non-linear (Ir)rational Arithmetic.................... 481
Harald Zankl and Aart Middeldorp
Coping with Selfish On-Going Behaviors ............................ 501
Orna Kupferman and Tami Tamir
Author Index.................................................. 517
The TPTP World –
Infrastructure for Automated Reasoning
Geoff Sutcliffe
University of Miami, USA
Abstract. The TPTP World is a well known and established infras-
tructurethat supportsresearch, development, and deployment of Auto-
mated Theorem Proving (ATP) systems for classical logics. The data,
standards, and services provided by the TPTP World have made it in-
creasingly easy to build, test, and apply ATP technology. This paper
reviewsthecorefeaturesoftheTPTPWorld,describeskeyservicecom-
ponentsof theTPTP World, presentssome successful applications, and
gives an overview of the most recent developments.
1 Introduction
AutomatedTheoremProving(ATP)isconcernedwiththedevelopmentanduse
of computer programsthat automate sound reasoning:the derivationof conclu-
sions that follow inevitably from facts. The dual discipline, automated model
finding, develops computer programs that establish that a set of statements is
consistent, and in this work we consider automated model finding to be part of
ATP.Thesecapabilitieslieattheheartofmanyimportantcomputationaltasks,
e.g.,formalmethodsforsoftwareandhardwaredesignandverification,theanal-
ysis of network security protocols, solving hard problems in mathematics, and
inference for the semantic web. High performance ATP systems (for logics sup-
ported in the TPTP World) include E/EP [16], LEO-II [1], Paradox[3], SPASS
[33], Vampire [14], and Waldmeister [7].
The TPTP World is a well known and established infrastructure that sup-
ports research, development, and deployment of Automated Theorem Proving
(ATP) systems for classical logics. The TPTP World includes the TPTP prob-
lem library, the TSTP solution library, standards for writing ATP problems
and reporting ATP solutions, tools for processing ATP problems and solutions,
and harnesses for controlling the execution of ATP systems and tools. The
TPTP World infrastructure has been deployed in a range of applications, in
both academia and industry. Section 2 of this paper reviews the core of the
TPTP World, Section 3 describes key service components of the TPTP World,
Section 4 presents some applications, and Section 5 gives an overview of the
most recent developments in the TPTP World. Section 6 concludes.
E.M.ClarkeandA.Voronkov(Eds.):LPAR-16,LNAI6355,pp.1–12,2010.
(cid:2)c Springer-VerlagBerlinHeidelberg2010