Lightning Talks – Workshop on Trends, Extensions, Applications and Semantics of Logic Programming https://www.coalg.org/tease-lp TEASE-LP, 28 and 29 May 2020, Virtual Event Wed, 27 May 2020 21:03:53 +0000 en-GB hourly 1 https://wordpress.org/?v=6.1.1 Robert Zinkov, Michael Ballantyne, Gregory L. Rosenblatt and William E. Byrd: Accelerating Program Synthesis in miniKanren https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/ https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/#respond Thu, 14 May 2020 12:42:11 +0000 https://www.coalg.org/tease-lp/?p=117 While many logic programming systems like miniKanren are highly expressive, they suffer from long and unpredictable running times. The challenge comes from the search algorithm being usually an uninformed search. Through the domain of program synthesis we show that it possible to greatly speedup this search by guiding it using example programs.


Forum    Video    Full Abstract

]]> https://www.coalg.org/tease-lp/2020/accelerating-program-synthesis-in-minikanren/feed/ 0 Dmitrii Kosarev and Dmitry Boulytchev: Relational Synthesis of Pattern Matching https://www.coalg.org/tease-lp/2020/relational-synthesis-of-pattern-matching/ https://www.coalg.org/tease-lp/2020/relational-synthesis-of-pattern-matching/#respond Thu, 14 May 2020 12:37:25 +0000 https://www.coalg.org/tease-lp/?p=111 We present an approach to pattern matching code generation based on application of relational programming and, in particular, relational interpreters.

Forum Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/relational-synthesis-of-pattern-matching/feed/ 0 Anduo Wang: Analyzing Internet Routing Policies with Answer Set Programming https://www.coalg.org/tease-lp/2020/analyzing-internet-routing-policies-with-answer-set-programming/ https://www.coalg.org/tease-lp/2020/analyzing-internet-routing-policies-with-answer-set-programming/#respond Thu, 14 May 2020 12:34:41 +0000 https://www.coalg.org/tease-lp/?p=106 Internet routing is the process of selecting paths across the Internet to connect the communicating hosts, it is unique in that path selection is jointly determined by a network of independently operated networks, known as domains or Autonomous Systems (ASes), that interconnect to form the Internet. In fact, the present routing infrastructure takes such an extreme position that it favors local autonomy — an AS can use arbitrary path preference to override the default shortest path policy, at the expense of potential global oscillation — a collection of AS preferences (policies) can fail to converge on a stable path, a path that is also the most preferred possible for every AS along the path. In this paper, we examine the route oscillation problem with non-monotonic reasoning. We observe that, in the absence of any AS specific policies, Internet routing degenerates into the monotonic computation of shortest path — a preferred (shorter) (super)path always extends another preferred (sub)path; But fully autonomous AS policies are non-monotonic — a path favored by one AS can be an extension of a less preferred path of a neighbor, to which an “upgrade” to a better path can cause this AS to downgrade to a less preferred path previously discarded. Based on this insight, we present an Answer Set Programming (ASP) formulation that allows for automatic oscillation detection.

Forum Full Abstract

Attachments

]]> https://www.coalg.org/tease-lp/2020/analyzing-internet-routing-policies-with-answer-set-programming/feed/ 0 Maria Kuklina and Ekaterina Verbitskaia: Supercompilation Strategies of Relational Programs https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/ https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/#respond Thu, 14 May 2020 12:31:08 +0000 https://www.coalg.org/tease-lp/?p=104 In this paper we research methods of supercompilation in the context of relational program specialization. We implement a supercompiler for miniKanren with different unfolding strategies and compare them.

Forum Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/supercompilation-strategies-of-relational-programs/feed/ 0 João Barbosa, Mário Florido and Vítor Santos Costa: Sound Type Assignment for Logic Programs https://www.coalg.org/tease-lp/2020/sound-type-assignment-for-logic-programs/ https://www.coalg.org/tease-lp/2020/sound-type-assignment-for-logic-programs/#respond Thu, 14 May 2020 12:30:10 +0000 https://www.coalg.org/tease-lp/?p=102 Type systems are a powerful tool in modern programming languages. We argue that, to be successfully adopted by the logic programming community, the first step is to design a type system that is able to catch obvious and relevant errors at compile-time. To do so, we defined a new type system which describes polymorphic well-typings for logic programs while respecting the main properties that make types useful and semantically sound. We now tackle the question of automatically producing a well typing for a logic program. We concentrated first on the implementation of a new type inference algorithm and its application to several logic programs.


Forum  Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/sound-type-assignment-for-logic-programs/feed/ 0 Ekaterina Verbitskaia, Irina Artemeva and Daniil Berezun: Binding-Time Analysis for miniKanren https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/ https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/#respond Thu, 14 May 2020 12:29:05 +0000 https://www.coalg.org/tease-lp/?p=100 We present a binding-time analysis algorithm for miniKanren. It is capable to determine the order in which names within a program are bound and can be used to facilitate specialization and as a step of conversion into a functional language.

Forum Video Full Abstract

]]> https://www.coalg.org/tease-lp/2020/binding-time-analysis-for-minikanren/feed/ 0