Learn More
GQR (Generic Qualitative Reasoner) is a solver for binary qualitative constraint networks. GQR takes a calculus description and one or more constraint networks as input, and tries to solve the networks using the path consistency method and (heuristic) backtracking. In contrast to specialized rea-soners, it offers reasoning services for different qualitative(More)
In recent years combinations of tense and modality have moved into the focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only(More)
Qualitative constraint calculi are representation formalisms that allow for efficient reasoning about spatial and temporal information. Many of the cal-culi discussed in the field of Qualitative Spatial and Temporal Reasoning can be defined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to(More)
Qualitative calculi are constraint-based representation formalisms that allow for efficient reasoning about continuous aspects of the world with inherently infinite domains, such as time and space. GQR (Generic Qualitative Reasoner) is a tool that provides reasoning services for arbitrary binary qualitative calculi. Given qualitative information expressible(More)
To reason about geographical objects, it is not only necessary to have more or less complete information about where these objects are located in space, but also how they can change their position, shape, and size over time. In this paper we investigate how calculi discussed in the field of qualitative spatial reasoning (QSR) can be temporalized in order to(More)
Many formalisms discussed in the literature on qualitative spatial reasoning are designed for expressing static spatial constraints only. However, dynamic situations arise in virtually all applications of these formalisms, which makes it necessary to study variants and extensions dealing with change. This paper presents a study on the computational(More)
Frank's cardinal direction calculus is one of the most prominent spatial constraint formalisms, which allows one to represent , and reason with, the relative position of objects in the Euclidean plane. Typical application fields of this calculus include geographical information systems (GIS), route finding and description systems, and navigation of robots(More)
Qualitative Spatial and Temporal Reasoning (QSR) is concerned with constraint-based formalisms for representing, and reasoning with, spatial and temporal information over infinite domains. Within the QSR community it has been a widely accepted assumption that genuine qualitative reasoning methods outperform other reasoning methods that are applicable to(More)