Applications – 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:05:36 +0000 en-GB hourly 1 https://wordpress.org/?v=6.1.1 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 Davide Ancona, Luca Franceschini, Angelo Ferrando and Viviana Mascardi: A SWI-Prolog based implementation of RML https://www.coalg.org/tease-lp/2020/a-swi-prolog-based-implementation-of-rml/ https://www.coalg.org/tease-lp/2020/a-swi-prolog-based-implementation-of-rml/#respond Thu, 14 May 2020 12:28:06 +0000 https://www.coalg.org/tease-lp/?p=98 Runtime verification (RV) consists in dynamically checking event traces generated by single runs of a system against a formal specification; such a technique can be used after deployment to monitor and properly handle misbehavior.

We report on the implementation of RML, an expressive rewriting-based domain specific language for RV, where from specifications, monitors are automatically generated in SWI-Prolog; the LP paradigm and some advanced features of SWI-Prolog are particularly suited to adopt Prolog as a target language for RML.

Forum Full Abstract

]]> https://www.coalg.org/tease-lp/2020/a-swi-prolog-based-implementation-of-rml/feed/ 0