We argue for the refactoring of the IP control plane to provide direct expressibility and support for network-wide goals relating to all fundamental functionality: reachability, performance, reliability and security. This refactoring is motivated by trends in operational practice and in networking technology. We put forward a design that decomposes functionality into information dissemination a...

We present the outline of a simple but powerful scheme for describing procedures that can be used by an automatic theorem prover. Our approach is to describe specialized procedures to a theorem prover by adding procedure description axioms to its set of facts, instead of building in these procedures by using attachments. Our work can be viewed as an extension of the hybrid reasoning techniques ...

This is the second of two related papers. In \Revising Z: Part I-logic and semantics" (this journal) we introduced a simple speciication logic Z C comprising a logic and a semantics (in ZF set theory). We then provided an interpretation for (a rational reconstruction of) the speciication language Z within Z C. As a result we obtained a sound logic for Z, including the basic schema calculus. In ...

Currently, i* is one of the most well founded organizational modelling techniques. Its main feature is the expressibility to represent intentional social relations among stakeholders. In i* models, each modeling component is described explicitly through text labels. However, the process of labeling model elements is usually an activity which is not rigorous and not well documented for designers...

This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design is to explore the expressibility/costability spectrum in resource-constrained systems, such as real-time embedded or control systems. It is unusual in being based on a combination of λ-calculus and finite state machi...

One of the most serious shortcomings of multidimensional languages is their inability to collaborate with conventional programming languages and systems. Multidimensional languages are used in order to define (potentially infinite) streams, grids, cubes, and so on, concepts which resemble in nature to the familiar imperative arrays. The main difference is that the former entities are lazy while...

Abstract Learning analytics (LA) is a field that examines data about learners and their context, for understanding optimizing learning the environments in which it occurs. Integration of multiple sources, an important dimension scalability, has potential to provide rich insights within LA. Using common standard such as Experience API (xAPI) describe activity across sources can alleviate obstacl...

Being able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables is crucially important for a satisfactory equational rendering of set theories along the lines proposed by Alfred Tarski and Steven Givant in their monograph of 1987. The main achievement of this paper is the proof that the ‘kernel’ set theory whose postulates are extensionalit...

In this paper, we prove lower bounds on the logical expressibility of optimization problems. There is a significant difference between the expressibilities of decision problems and optimization problems. This is similar to the difference in computation times for the two classes of problems; for example, a 2SAT Horn formula can be satisfied in polynomial time, whereas the optimization version in...

Conceptual Programming is a term meant to convey a similar idea to that of Logic Programming, but at a higher level of representation. Programming with concepts, as presented here, has all the advantages that many knowledge representation schemes have in dealing with declarative knowledge i.e. explicitness, naturalness, expressibility, and transparency. It also gives procedural knowledge these ...