We introduce a new class of succinct games, called weighted boolean formula games. Here, each player has a set of boolean formulas he wants to get satisfied. The boolean formulas...
Marios Mavronicolas, Burkhard Monien, Klaus W. Wag...
This paper defines the “ultimate” formal semantics for Alice and Bob notation, i.e., what actions the honest agents have to perform, in the presence of an arbitrary set of cry...
Abstract. The Helena approach allows to specify dynamically evolving ensembles of collaborating components. It is centered around the notion of roles which components can adopt in ...
This work studies the relationship between veriable and computable answers for reachability problems in rewrite theories with an underlying membership equational logic. These prob...
Abstract. This essay addresses the concerns of the foundations of mathematics of the early 20th century which led to the creation of formally axiomatized universes. These are confr...
A Structured Document Algebra (SDA) defines modules with variation points and how such modules compose. The basic operations are module addition and replacement. Repeated addition...
We develop a general, non-probabilistic model of prediction which is suitable for assessing the (un)predictability of individual physical events. We use this model to provide, for...
Alastair A. Abbott, Cristian S. Calude, Karl Svozi...
Abstract. Mobile devices are in roles where the integrity and confidentiality of their apps and data are of paramount importance. They usually contain a System-on-Chip (SoC), whic...
Abstract. Answer Set Programming is a widely known knowledge representation framework based on the logic programming paradigm that has been extensively studied in the past decades....