Declarative theorem proving for operational semantics

iAbstract The aim of this Masters Thesis is to propose to SYSteam Nät AB, a local Internet Service Provider (ISP) in Uppsala, Sweden, how to implement IP telephony in their existing IT-infrastructure as a service to their customers. Thus the perspective of the thesis will be that of a local Internet Service Provider. Three general areas are covered in the thesis: Market and Business Model, Technology, and Economics. Important issues for SYSteam Nät AB as an established local broadband Internet Service Provider are to both retain present customers and to attract new customers. Some believe that offering value added services such as IP telephony could do this. Implementation of IP telephony can be done in different ways to fulfil SYSteam Nät’s requirements. The analysis leads to a proposal of how SYSteam Nät could implement IP telephony. This involves many multi-faceted business, technical, and financial issues; each aspect is examined in this thesis. ii Sammanfattnin

(Co-)Inductive semantics for Constraint Handling Rules

In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized by a greatest fixpoint. Then, in order to take advantage of both types of rules without losing fixpoint characterization, we present an operational semantics with persistent. We finally establish that this semantics can be characterized by two nested fixpoints, and we show the resulting language is an elegant framework to program using coinductive reasoning.Comment: 17 page

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