Semantics of Input-Consuming Logic Programs

Input-consuming programs are logic programs with an additional restriction on the selectability (actually, on the resolvability) of atoms. this class of programs arguably allows to model logic programs employing a dynamic selection rule and constructs such as delay declarations: as shown also in [5], a large number of them are actually input-consuming. \ud in this paper we show that - under some syntactic restrictions - the tex2html_wrap_inline117-semantics of a program is correct and fully abstract also for input-consuming programs. this allows us to conclude that for a large class of programs employing delay declarations there exists a model-theoretic semantics which is equivalent to the operational one

Static Trace-Based Deadlock Analysis for Synchronous Mini-Go

We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expressions extended with a fork operator capture the communication behavior of a program. Starting from a simple criterion that characterizes traces of deadlock-free programs, we develop automata-based methods to check for deadlock-freedom. The approach is implemented and evaluated with a series of examples

Breaking the Constitutional Deadlock: Lessons from Deliberative Experiments in Constitutional Change

This work provides comparative insights into how deliberation on proposed constitutional amendments might be more effectively pursued. It reports on a new nationwide survey of public attitudes to constitutional reform, examining the potential in Australia of innovative Canadian models of reform led by Citizens' Assemblies. Assembly members are selected at random and are demographically representative of the wider public. They deliberate over reforms for several months while receiving instruction from experts in relevant fields. Members thus become 'public-experts': citizens who stand in for the wider public but are versed in constitutional fundamentals. The author finds striking empirical evidence that, if applied in the Australian context, public trust would be substantially greater for Citizens' Assemblies compared with traditional processes of change. The article sets these results in context, reading the Assemblies against theories of deliberative democracy and public trust. One reason for greater public trust in the Assemblies' may be an ability to accommodate key values that are otherwise in conflict: majoritarian democratic legitimacy, on the one hand, and fair and well-informed (or 'deliberatively rational') decision-making, on the other. Previously, almost no other poll had asked exactly how much Australians trust in constitutional change. However, by resolving trust into a set of discrete public values, the polling and analysis in this work provide evidence that constitutional reform might only succeed when it expresses, at once, the values of both majoritarian and deliberative democracy

Self-stabilizing K-out-of-L exclusion on tree network

In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are $\ell$ units of a shared resource, and any process can request up to $\mathtt k$ units ($1\leq\mathtt k\leq\ell$). We propose the first deterministic self-stabilizing distributed K-out-of-L exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.Comment: 15 page