Volume •Abstracts •Preface •Authors •Keywords •BibTex Entries

LPAR-21S: Volume Information

IWIL Workshop and LPAR Short Presentations

Editors: Thomas Eiter, David Sands, Geoff Sutcliffe and Andrei Voronkov

Kalpa Publications in Computing•Volume 1

11 articles•134 pages•Published: June 4, 2017

Papers

LPAR-21 Short Presentation Papers

An Interpolation-based Compiler and Optimizer for Relational Queries (System design Report)

David Toman and Grant Weddell

1-10

Leo-III Version 1.1 (System description)

Christoph Benzmüller, Alexander Steen and Max Wisniewski

11-26

Reasoning with Concept Diagrams about Antipatterns

Zohreh Shams, Mateja Jamnik, Gem Stapleton and Yuri Sato

27-42

Formalization of some central theorems in combinatorics of finite sets

Abhishek Kr Singh

43-57

Abduction by Non-Experts

Nikolaj Bjorner, Dejan Jovanović, Tancrède Lepoint, Philipp Rümmer and Martin Schäf

58-72

Decidability of Fair Termination of Gossip Protocols

Krzysztof Apt and Dominik Wojtczak

73-85

Translating C# to Branching Symbolic Transducers

Olli Saarikivi and Margus Veanes

86-99

IWIL 2017 Papers

Going Polymorphic - TH1 Reasoning for Leo-III

Alexander Steen, Max Wisniewski and Christoph Benzmüller

100-112

Capability Discovery for Automated Reasoning Systems

Alexander Steen, Max Wisniewski, Hans-Jörg Schurr and Christoph Benzmüller

113-118

Towards an Abstraction-Refinement Framework for Reasoning with Large Theories

Julio Cesar Lopez Hernandez and Konstantin Korovin

119-123

Set of Support for Theory Reasoning

Giles Reger and Martin Suda

124-134

Keyphrases

abduction, antichains, Antipatterns, automata theory, automated theorem prover, chains, computational complexity of reasoning, Crowdsourcing, diagrammatic reasoning, Dilworth's theorem, Domain Specific Language, epistemic logic, fair termination, formal proofs, gossip protocols, Hall's Theorem, higher-order logic, Horn solving, interpolation, Knowledge-based programs, knowledge representation, Mirsky's theorems, Ontologies, paramodulation, partially ordered sets, query optimization, symbolic transducer, system description, tableau proofs.