LPAR-16 Accepted Papers

The list of accepted papers is given below. Click this link to view this list with abstracts.

Full Papers

Reinhard Pichler , Stefan Rümmele and Stefan Woltran . Counting and Enumeration Problems with Bounded Treewidth
Lennart Beringer , Robert Grabowski and Martin Hofmann . Verifying Pointer and String Analyses with Region Type Systems
Javier Larrosa , Albert Oliveras and Enric Rodríguez-Carbonell . Semiring-Induced Propositional Logic: Definition and Basic Algorithms
Fausto Spoto . The Nullness Analyser of Julia
John Fearnley. Non-oblivious Strategy Improvement
Gilles Barthe, marion DAUBIGNARD, Bruce Kapron, Yassine Lakhnech and Vincent Laporte. An equational logic for probabilistic terms
Orna Kupferman and Tami Tamir . Coping with Selfish On-going Behaviors
Regis Blanc, Thomas Henzinger , Thibaud B. Hottelier and Laura Kovacs . ABC: Algebraic Bound Computation for Loops
Orna Kupferman and Moshe Vardi . Synthesis for trigger properties
Michael Gabbay and Murdoch Gabbay . A simple class of Kripke-style models in which logic and computation have equal standing
Didier Galmiche and Yakoub Salhi. Label-free Proof Systems for Modal Intuitionistic Logic IS5
Harald Zankl and Aart Middeldorp . Solving Non-Linear Real Arithmetic for Matrix Interpretations over the Reals
Matthias Horbach . Disunification for Ultimately Periodic Interpretations
Jiri Vyskocil, David Stanovsky and Josef Urban . Automated proof shortening by invention of new definitions
Laura Bozzelli, Axel Legay and Sophie Pinchinat . Hardness of preorder checking for basic formalisms
Gourinath Banda and John Gallagher . Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation
Michael Codish and Moshe Ivri-Zazon. Pairwise Cardinality Networks
Marco Faella, Margherita Napoli and Mimmo Parente . Graded Alternating-Time Temporal Logic
Dougherty Daniel and Liquori Luigi . Logic and computation in a lambda calculus with intersection and union types
Margus Veanes , Nikolai Tillmann and Jonathan de Halleux . Qex: Symbolic SQL Query Explorer
Paola Bruscoli, Alessio Guglielmi, Tom Gundersen and Michel Parigot. A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae
Amir Aavani , shahab tasharrofi, Gulay Unel, Eugenia Ternovska and David Mitchell . Speed-up Techniques for Negation in Grounding
Fabio Mogavero , Aniello Murano and Moshe Y. Vardi . Relentful Strategic Reasoning in Alternating-Time Temporal Logic
Rustan Leino . Dafny: An Automatic Program Verifier for Functional Correctness
Martin Berger and Laurence Tratt . Program Logics for Homogeneous Meta-Programming
Bruno Woltzenlogel Paleo . Atomic Cut Introduction by Resolution: Proof Structuring and Compression
Yoichi Hirai . An Intuitionistic Epistemic Logic for Sequential Consistency on Shared Memory

Short Papers

Antonina Kolokolova, Liu Yongmei, David Mitchell and Eugenia Ternovska . On the Complexity of Model Expansion
Michael Gabbay . A proof-theoretic treatment of lamda-reduction: lambda-calculus as a logic programming language
Belaïd Benhamou, Tarek Nabhani, Richard Ostrowski and Mohamed Réda saidi. Dynamic symmetry detection and elimination in the satisfiability problem
Gregory Wheeler . AGM Belief Revision in Monotone Modal Logics
Choh Man Teng and Gregory Wheeler . Robustness of Evidential Probability
Amir Aavani , Xiongnan (Newman) Wu, David Mitchell and Eugenia Ternovska . Grounding Count Aggregates
Yannick Chevalier and Mounira Kourjieh. Decidability of Ground Entailment Problems for Saturated Sets of Clauses
Shahab Tasharrofi and Eugenia Ternovska . Knowledge Representation with Built-in Arithmetic
Jiewen Wu . Plan-based Axiom Absorption for Description Logics Reasoning

LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR LPAR