Dagstuhl News January - December 2001

"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic

Dagstuhl News January - December 2000

"Dagstuhl News" is a publication edited especially for the members of the Foundation "Informatikzentrum Schloss Dagstuhl" to thank them for their support. The News give a summary of the scientific work being done in Dagstuhl. Each Dagstuhl Seminar is presented by a small abstract describing the contents and scientific highlights of the seminar as well as the perspectives or challenges of the research topic

Abstract State Machines 1988-1998: Commented ASM Bibliography

An annotated bibliography of papers which deal with or use Abstract State Machines (ASMs), as of January 1998.Comment: Also maintained as a BibTeX file at http://www.eecs.umich.edu/gasm

07212 Abstracts Collection -- Constraint Databases, Geometric Elimination ang Geographic Information Systems

From 20.05. to 25.05., the Dagstuhl Seminar 07212 ``Constraint Databases, Geometric Elimination and Geographic Information Systems\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

07181 Abstracts Collection -- Parallel Universes and Local Patterns

From 1 May 2007 to 4 May 2007 the Dagstuhl Seminar 07181 ``Parallel Universes and Local Patterns\u27\u27 was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

The Creeping Virtuality of Place

Places are inherently dynamic. They also mediate between entities and events of significance to us, and space. They reflect a network of associations, involving landmarks deemed salient for various reasons. These are all properties assigned to a place by a speaker, and may or may not correspond to the properties assigned to a place by any other speaker. As a result, places have a subjective quality. These properties of dynamicity and subjectivity present interesting challenges when producing mashups that align different data sources. I propose addressing this by assuming that entities, following Hornsby & Egenhofer (2000), have histories, namely sequences of time intervals when they are predicated to exist. Places are entities with spatial properties that include topological relationships to other places, represented in terms of RCC-8 or the 9-intersection calculus, as well as distance and orientation relations. This spatio-temporal integration can avail of existing annotation schemes for space and time in natural language, but it leaves some open issues related to the representation of subjectivity

Experiences with Some Benchmarks for Deductive Databases and Implementations of Bottom-Up Evaluation

OpenRuleBench is a large benchmark suite for rule engines, which includes deductive databases. We previously proposed a translation of Datalog to C++ based on a method that "pushes" derived tuples immediately to places where they are used. In this paper, we report performance results of various implementation variants of this method compared to XSB, YAP and DLV. We study only a fraction of the OpenRuleBench problems, but we give a quite detailed analysis of each such task and the factors which influence performance. The results not only show the potential of our method and implementation approach, but could be valuable for anybody implementing systems which should be able to execute tasks of the discussed types.Comment: In Proceedings WLP'15/'16/WFLP'16, arXiv:1701.0014