TEASE-LP: Workshop on Trends, Extensions, Applications and Semantics of Logic Programming
Logic programming is a framework for expressing programs, propositions and relations as Horn clause theories, and for automatic inference in these theories. Horn clause theories are famous for its well-understood declarative semantics, in which models of logic programs are given inductively or coinductively. At the same time, Horn clauses give rise to efficient inference procedures, usually involving resolution. Logic programming found applications in type inference, verification, and AI. While logic programming was originally conceived for describing simple propositional facts, it was extended to account for much more complex theories. This includes first-order theories, higher-order theories, inductive and coinductive data, and stochastic/probabilistic theories.
The aim of this workshop is to bring together researchers that work on extensions of logic programming and inference methods, and to foster an exchange of methods and applications that have emerged in different communities.
The central idea of this workshop is to discuss the theory of logic programming and associated
topics that have as well the goal to automatically infer knowledge and proofs. Our intent is
to bring together researchers that work on the numerous topics that contribute to automatic
inference and foster an exchange that may lead to an advance in the theory of logic programming.
The topics that we have in mind are
- Henning Basold (chair), LIACS, Leiden University, NLD
- Nikolaj Bjørner, Microsoft Research, USA
- William Byrd, University of Alabama at Birmingham, USA
- Gopal Gupta, The University of Texas at Dallas, USA
- Ekaterina Komendantskaya (chair), Heriot-Watt University, GBR
- Dale Miller, INRIA and LIX/Ecole Polytechnique, FRA
- Gopalan Nadathur, University of Minnesota, USA
- Frank Pfenning, Carnegie Mellon University, USA
- Hiroshi Unno, University of Tsukuba, JPN
- Noam Zeilberger, University of Birmingham, GBR