LPAR-21: 21ST INTERNATIONAL CONFERENCE ON LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE AND REASONING
PROGRAM

Days: Sunday, May 7th Monday, May 8th Tuesday, May 9th Wednesday, May 10th Thursday, May 11th Friday, May 12th

Sunday, May 7th

View this program: with abstractssession overviewtalk overview

14:15-14:30Short Break
14:30-15:30 Session 2 (IWIL-2017)
14:30
Going Polymorphic - TH1 Reasoning for Leo-III ( abstract )
15:00
Capability Discovery for Automated Reasoning Systems ( abstract )
15:30-16:00Break
16:00-17:30 Session 3 (IWIL-2017)
16:00
Towards an Abstraction-Refinement Framework for Reasoning with Large Theories ( abstract )
16:30
Set of Support for Theory Reasoning ( abstract )
Monday, May 8th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 4: Invited Talk: Stephen Muggleton (LPAR-21)

Prof. Muggleton's career has concentrated on the development of theory, implementations and applications of Machine Learning, particularly in the field of Inductive Logic Programming. Stephen Muggleton's intellectual contributions within Machine Learning include the introduction of definitions for Inductive Logic Programming (ILP), Predicate Invention, Inverse Resolution, Closed World Specialisation, Predicate Utility, Layered Learning, U-learnability, Self-saturation and Stochastic logic programs. Over the last decade he has collaborated increasingly with biological colleagues on applications of Machine Learning to Biological prediction tasks. These tasks have included the determination of protein structure, the activity of drugs and toxins and the assignment of gene function.

09:00
Meta-Interpretive Learning of Logic Programs ( abstract )
10:00-10:30Break
10:30-12:30 Session 5: Theorem Provers and Proof Systems (LPAR-21)
10:30
Theorem Provers For Every Normal Modal Logic ( abstract )
11:00
Blocked Clauses in First-Order Logic ( abstract )
11:30
First-Order Interpolation and Interpolating Proofs Systems ( abstract )
12:00
Towards a Semantics of Unsatisfiability Proofs with Inprocessing ( abstract )
14:00-15:30 Session 6: Proof Search (LPAR-21)
14:00
Deep Network Guided Proof Search ( abstract )
14:30
Deep Proof Search in MELL ( abstract )
15:00
TacticToe: Learning to Reason with HOL4 Tactics ( abstract )
15:30-16:00Break
16:00-17:00 Session 7: Short Presentations I (LPAR-21)
16:00
An Interpolation-based Compiler and Optimizer for Relational Queries (System Implementation Report) ( abstract )
16:15
Leo-III Version 1.1 (System description) ( abstract )
17:30-21:00Reception
Tuesday, May 9th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 8: Invited Talk: Willem Visser (LPAR-21)

Willem Visser is a professor in the Division of Computer Science at Stellenbosch University. His research is mostly focussed around finding bugs in software. More specifically he works on testing, program analysis, symbolic execution, probabilistic symbolic execution and model checking. He is probably most well known for his work on Java PathFinder (JPF) and Symbolic PathFinder (SPF). He previously worked at NASA Ames Research Center, and SEVEN Networks.

09:00
Probabilistic Symbolic Execution: A New Hammer ( abstract )
10:00-10:30Break

Break

10:30-12:30 Session 9: Software Analysis Components (LPAR-21)
10:30
Automated analysis of Stateflow models ( abstract )
11:00
Quantified Boolean Formulas: Call the Plumber! ( abstract )
11:30
Cauliflower: a Solver Generator for Context-Free Language Reachability ( abstract )
12:00
Decidable linear list constraints ( abstract )
12:30-14:00Lunch
14:00-15:30 Session 10: Knowledge Representation and Databases (LPAR-21)
14:00
RACCOON: A Connection Reasoner for the Description Logic ALC ( abstract )
14:30
On the Interaction of Inclusion Dependencies with Independence Atoms ( abstract )
15:00
Propagators and Solvers for the Algebra of Modular Systems ( abstract )
15:30-16:00Break
16:00-17:00 Session 11: Short Presentations II (LPAR-21)
16:00
Reasoning with Concept Diagrams about Antipatterns ( abstract )
16:15
Formalization of some central theorems in combinatorics of finite sets ( abstract )
16:30
Abduction by Non-Experts ( abstract )
Wednesday, May 10th

View this program: with abstractssession overviewtalk overview

05:30-14:00 Session : Excursion (LPAR-21)

Moremi Day Trip: Starts at 5:30am and lasts 8 hrs. Game drive & game viewing are the main activity. A good chance to see wildlife such as lions, leopards, wild dogs, elephants, and many different antelope species.

Thursday, May 11th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 12: Invited Talk: Rupak Majumdar (LPAR-21)

Rupak Majumdar is a Scientific Director at the Max Planck Institute for Software Systems. His research interests are in the verification and control of reactive, real-time, hybrid, and probabilistic systems, software verification and programming languages, logic, and automata theory. Dr. Majumdar received the President's Gold Medal from IIT, Kanpur, the Leon O. Chua award from UC Berkeley, an NSF CAREER award, a Sloan Foundation Fellowship, an ERC Synergy award, "Most Influential Paper" awards from PLDI and POPL, and several best paper awards (including from SIGBED, EAPLS, and SIGDA). He received the B.Tech. degree in Computer Science from the Indian Institute of Technology at Kanpur and the Ph.D. degree in Computer Science from the University of California at Berkeley.

09:00
Programming by Composing Filters ( abstract )
10:00-10:30Break
10:30-12:30 Session 13: Complexity Analysis and Rewriting Systems (LPAR-21)
10:30
Analyzing Runtime Complexity via Innermost Runtime Complexity ( abstract )
11:00
Higher order interpretation for higher order complexity ( abstract )
11:30
From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes ( abstract )
12:00
On Simultaneous Transformations with Overlapping Graph Rewrite Systems ( abstract )
12:30-14:00Lunch
14:00-15:30 Session 14: Algorithms and Tools (LPAR-21)
14:00
A Quantitative Partial Model-Checking Function and Its Optimisation ( abstract )
14:30
Synchronizing Constrained Horn Clauses ( abstract )
15:00
Seminator: A Tool for Semi-Determinization of Omega-Automata ( abstract )
15:30-16:00Break
16:00-17:00 Session 15: Short Presentations III (LPAR-21)
16:00
Decidability of Fair Termination of Gossip Protocols ( abstract )
16:15
Translating C# to Branching Symbolic Transducers ( abstract )
Friday, May 12th

View this program: with abstractssession overviewtalk overview

09:00-10:00 Session 16: Program Verification (LPAR-21)
09:00
Quantified Heap Invariants for Object-Oriented Programs ( abstract )
09:30
Proving uniformity and independence by self-composition and coupling ( abstract )
10:00-10:30Break
10:30-12:30 Session 17: Substructural and Nonclassical Logics (LPAR-21)
10:30
Gödel logics and the fully boxed fragment of LTL ( abstract )
11:00
Bunched Hypersequent Calculi for Distributive Substructural Logics ( abstract )
11:30
A uniform framework for substructural logics with modalities ( abstract )
12:00
A One-Pass Tree-Shaped Tableau for LTL+Past ( abstract )
14:00-15:30 Session 18: Formal Analysis (LPAR-21)
14:00
A complete proof of Coq modulo Theory ( abstract )
14:30
Reasoning about Translation Lookaside Buffers ( abstract )
15:00
Formally Proving the Boolean Pythagorean Triples Conjecture ( abstract )
17:30-21:00Farewell Dinner