Sciweavers

CSL
2003
Springer
13 years 10 months ago
Modular Semantics and Logics of Classes
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...
Bernhard Reus
CSL
2003
Springer
13 years 10 months ago
A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This
Alexandre Miquel
CSL
2003
Springer
13 years 10 months ago
A Logic for Probability in Quantum Systems
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
Ron van der Meyden, Manas Patra
CSL
2003
Springer
13 years 10 months ago
Automata on Lempel-ziv Compressed Strings
Using the Lempel-Ziv-78 compression algorithm to compress a string yields a dictionary of substrings, i.e. an edge-labelled tree with an order-compatible enumeration, here called a...
Hans Leiß, Michel de Rougemont
CSL
2003
Springer
13 years 10 months ago
The Arithmetical Complexity of Dimension and Randomness
Constructive dimension and constructive strong dimension are effectivizations of the Hausdorff and packing dimensions, respectively. Each infinite binary sequence A is assigned...
John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwij...
CSL
2003
Springer
13 years 10 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
CSL
2003
Springer
13 years 10 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artificial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
CSL
2003
Springer
13 years 10 months ago
Simple Stochastic Parity Games
Many verification, planning, and control problems can be modeled as games played on state-transition graphs by one or two players whose conflicting goals are to form a path in th...
Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A...
CSL
2003
Springer
13 years 10 months ago
Constraint Satisfaction with Countable Homogeneous Templates
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
Manuel Bodirsky, Jaroslav Nesetril