Corpus ID: 833686

GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi

@inproceedings{Gantner2008GQRA,
  title={GQR – A Fast Reasoner for Binary Qualitative Constraint Calculi},
  author={Zeno Gantner and Matthias Westphal and Stefan W{\"o}lfl},
  year={2008}
}
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… Expand

Figures and Tables from this paper

GQR: A Fast Solver for Binary Qualitative Constraint Networks
TLDR
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. Expand
Confirming the QSR Promise
  • M. Westphal, S. Wölfl
  • Computer Science
  • AAAI Spring Symposium: Benchmarking of Qualitative Spatial and Temporal Reasoning Systems
  • 2009
TLDR
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. Expand
Bipath Consistency Revisited
In the field of qualitative spatial and temporal reasoning combinations of constraint calculi have attracted considerable research interest in recent years. Beside combinations of spatial andExpand
Dynamic Branching in Qualitative Constraint Networks via Counting Local Models
TLDR
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. Expand
Decomposition and tractability in qualitative spatial and temporal reasoning
TLDR
A sufficient condition under which consistency can be decided in polynomial time for networks of bounded treewidth in QSTR is identified, and this condition is satisfied by a range of calculi including the Interval Algebra, Rectangle Al algebra, Block Algebra), RCC8, and RCC5. Expand
An Automatic Decomposition Method for Qualitative Spatial and Temporal Reasoning
TLDR
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. Expand
Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction
TLDR
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. Expand
ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories
TLDR
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. Expand
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 ofExpand
Allen's Interval Algebra Makes the Difference
TLDR
This paper presents a novel encoding of Interval Algebra using answer-set programming (ASP) extended by difference constraints, i.e., the fragment abbreviated as ASP(DL), and suggests that analogous encodings can be devised for other point-based calculi, too. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 29 REFERENCES
Constraint Processing
  • R. Dechter
  • Computer Science
  • Lecture Notes in Computer Science
  • 1995
TLDR
Rina Dechter synthesizes three decades of researchers work on constraint processing in AI, databases and programming languages, operations research, management science, and applied mathematics to provide the first comprehensive examination of the theory that underlies constraint processing algorithms. Expand
Consistency in Networks of Relations
TLDR
The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms. Expand
Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
TLDR
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. Expand
Customizing Qualitative Spatial and Temporal Calculi
  • Jochen Renz, F. Schmid
  • Mathematics, Computer Science
  • Australian Conference on Artificial Intelligence
  • 2007
TLDR
Results from an empirical analysis shows that customizing a calculus can lead to a considerably better reasoning performance than using the non-customized calculus. Expand
A Generic Toolkit for n-ary Qualitative Temporal and Spatial Calculi
TLDR
The QAT (the qualitative algebra toolkit), a JAVA constraint programming library allowing to handle constraint networks based on those qualitative calculi by considering calculi based on basic relations of an arbitrary arity is described. Expand
Fast algebraic methods for interval constraint problems
  • P. Ladkin, A. Reinefeld
  • Mathematics, Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2004
TLDR
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. Expand
SparQ : A Toolbox for Qualitative Spatial Representation and Reasoning
A multitude of calculi for qualitative spatial reasoning (QSR) has been proposed during the last two decades. The number of practical applications that make use of QSR techniques is, however,Expand
A Relative Orientation Algebra with Adjustable Granularity
The granularity of spatial calculi and the resulting mathematical properties have always been a major question in solving spatial tasks qualitatively. In this paper we present the Oriented PointExpand
The design and experimental analysis of algorithms for temporal reasoning
TLDR
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. Expand
The Design and Experimental Analysis of Algorithms for Temporal Reasoning
TLDR
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 variable and value ordering heuristics that are shown empirically to dramatically improve the performance of the algorithm. Expand
...
1
2
3
...