• Corpus ID: 833686

GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi

  title={GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi},
  author={Zeno Gantner and Matthias Westphal and Stefan W{\"o}lfl},
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 reasoners, it offers reasoning services for different qualitative calculi, which means that these calculi are not hard-coded into the reasoner. Currently, GQR supports arbitrary binary constraint calculi… 

Figures and Tables from this paper

GQR: A Fast Solver for Binary Qualitative Constraint Networks

GQR (Generic Qualitative Reasoner) is a tool that provides reasoning services for arbitrary binary qualitative calculi and aims to provide a generic and extensible solver that preserves efficiency and scalability.

Confirming the QSR Promise

  • M. WestphalS. Wölfl
  • Computer Science
    AAAI Spring Symposium: Benchmarking of Qualitative Spatial and Temporal Reasoning Systems
  • 2009
Some empirical case studies in which the performance of a qualitative constraint solver is compared with different automated reasoning systems are compared, showing that first-order and description logic reasoners are far from being feasible for problem sizes that can easily be solved by a qualitative reasoner.

Bipath Consistency Revisited

This article compares the “bipath consistency”-based combination method to the standard method, which is to combine calculi by generating a new calculus and applying the standard path consistency method.

Dynamic Branching in Qualitative Constraint Networks via Counting Local Models

This paper proposes heuristics that dynamically associate a weight with a relation, based on the count of local models that the relation is involved with in a given QCN; these models are local in that they focus on triples of variables instead of the entire QCN.

Decomposition and tractability in qualitative spatial and temporal reasoning

An Automatic Decomposition Method for Qualitative Spatial and Temporal Reasoning

This paper presents a new framework that allows for decomposing composition tables into logically simpler parts, while preserving logical equivalence, e.g., the decomposition in start- and end-points for Allen's Interval Calculus.

Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction

A new algorithm, called PWC, is proposed for efficiently enforcing partial -consistency on qualitative constraint networks, that exploits the notion of abstraction for qualitative constraint Networks, utilizes certain properties of partial - Consistency, and adapts the functionalities of some state-of-theart algorithms to its design.

ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories

The results show that ASPMT(QS) is the only existing system that is capable of reasoning about indirect spatial effects, addressing the ramification problem, and integrating geometric and qualitative spatial information within a non-monotonic spatial reasoning context.

Qualitative calculi with heterogeneous universes

Qualitative representation and reasoning operate with non-numerical relations holding between objects of some universe. The general formalisms developed in this field are based on various kinds of



Consistency in Networks of Relations

Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class

It is proved that Ladkin and Reinefeld's algorithm is complete when using the ORD-Horn class, and evidence is given that combining search methods orthogonally can dramatically improve the performance of the backtracking algorithm.

Customizing Qualitative Spatial and Temporal Calculi

  • Jochen RenzF. Schmid
  • Computer Science, Mathematics
    Australian Conference on Artificial Intelligence
  • 2007
Results from an empirical analysis shows that customizing a calculus can lead to a considerably better reasoning performance than using the non-customized calculus.

Fast algebraic methods for interval constraint problems

An effective generic method for solving constraint problems, based on Tarski’s relation algebra, using path-consistency as a pruning technique is described, and evidence is presented that the ‘phase transition’ occurs in the range 6 ≤ n.

SparQ : A Toolbox for Qualitative Spatial Representation and Reasoning

The SparQ toolbox is presented, which aims to make common calculi and standard reasoning techniques accessible in a way that allows for easy integration into applications and encourage researchers to incorporate their calculi into SparZ.

A Relative Orientation Algebra with Adjustable Granularity

This paper presents the Oriented Point Relation Algebra (OPRAm), a new orientation calculus with adjustable granularity, which is a relation algebra in the sense of Tarski, fast standard inference methods can be applied.

The Design and Experimental Analysis of Algorithms for Temporal Reasoning

This paper discusses the design and empirical analysis of algorithms for a temporal reasoning system based on Allen's influential interval-based framework for representing temporal information, and develops techniques that can result in up to a ten-fold speedup over an already highly optimized implementation.

Qualitative Spatial Representation and Reasoning in the SparQ-Toolbox

The SparQ toolbox is presented, aimed at making common calculi and standard reasoning techniques accessible in a way that allows for easy integration into applications and to encourage researchers to incorporate their calculi into SparZ.

Qualitative Spatial Reasoning with Cardinal Directions

An algebraic method is used to formalize the meaning of cardinal directions and two examples of systems to determine and reason with cardinal directions are discussed in some detail and results from a prototype are given.

Spatial Reasoning with Propositional Logics