Days: Monday, May 8th Tuesday, May 9th Wednesday, May 10th Thursday, May 11th Friday, May 12th
View this program: with abstractssession overviewtalk overviewside by side with other conferences
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: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 | Deep Network Guided Proof Search ( abstract ) |
14:30 | Deep Proof Search in MELL ( abstract ) |
15:00 | TacticToe: Learning to Reason with HOL4 Tactics ( abstract ) |
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 ) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
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 ) |
Break
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 ) |
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 ) |
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 ) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
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.
View this program: with abstractssession overviewtalk overviewside by side with other conferences
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: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 ) |
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 ) |
16:00 | Decidability of Fair Termination of Gossip Protocols ( abstract ) |
16:15 | Translating C# to Branching Symbolic Transducers ( abstract ) |
View this program: with abstractssession overviewtalk overviewside by side with other conferences
09:00 | Quantified Heap Invariants for Object-Oriented Programs ( abstract ) |
09:30 | Proving uniformity and independence by self-composition and coupling ( abstract ) |
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 | 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 ) |