Corpus ID: 13011372

GQR: A Fast Solver for Binary Qualitative Constraint Networks

@inproceedings{Westphal2009GQRAF,
  title={GQR: A Fast Solver for Binary Qualitative Constraint Networks},
  author={M. Westphal and S. W{\"o}lfl and Zeno Gantner},
  booktitle={AAAI Spring Symposium: Benchmarking of Qualitative Spatial and Temporal Reasoning Systems},
  year={2009}
}
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 in a qualitative calculus, GQR checks whether this information is consistent w.r.t. the calculus definition. GQR employs stateof-the-art… Expand
A Generalised Approach for Encoding and Reasoning with Qualitative Theories in Answer Set Programming
TLDR
Experimental results show that the proposed encodings outperform one of the two reasoners, but fall behind the other, an acceptable trade-off given the added benefits of handling any type of reasoning as well as the interpretability of logic programs. Expand
On Finding Approximate Solutions of Qualitative Constraint Networks
TLDR
This paper will exploit the algebraic structure of qualitative calculi as well as their conceptual neighbourhood graphs to develop approximate methods for consistency checking in QSTR and propose and empirically compare four independent methods to serve as tools for finding good approximate solutions for the given quantitative calculi. 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
SAT vs. Search for Qualitative Temporal Reasoning
TLDR
A SAT encoding of IA is presented that simulates the use of tractable subsets in native solvers and shows that the refutation of any inconsistent IA network can always be done by SAT (via the authors' new encoding) as efficiently as by native search. Expand
Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments
We study the translation of reasoning problems involving qualitative spatio-temporal calculi into answer set programming (ASP). We present various alternative transformations and provide aExpand
Reasoning About General TBoxes with Spatial and Temporal Constraints: Implementation and Optimizations
TLDR
This paper reports on a study in which this tableau method showed that for the description logic ALC(C) with ω-admissible constraint systems, concept satsifiability with respect to general TBoxes can be decided by a standard ALC tableau algorithm. 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
On A Semi-Automatic Method for Generating Composition Tables
TLDR
This paper introduces a semi-automatic method to compute the CT of a qualitative calculus by randomly gen- erating triples of elements and can be used to generate CTs for customised qualitative calculi defined on restricted domains. Expand
Spatial Symmetry Driven Pruning Strategies for Efficient Declarative Spatial Reasoning
TLDR
A new algorithm is presented, implemented within the declarative spatial reasoning system CLPQS, that drastically improves the performance of deciding the consistency of spatial constraint graphs over conventional polynomial encodings, and can be applied to problems that are otherwise unsolvable in practice. Expand
Revising Qualitative Constraint Networks: Definition and Implementation
  • J. Hué, M. Westphal
  • Computer Science
  • 2012 IEEE 24th International Conference on Tools with Artificial Intelligence
  • 2012
TLDR
This paper proposes to provide two revision operations for qualitative calculi, give algorithms for revision and analyze the computational complexity of these problems and presents an implementation of these algorithms based on a qualitative constraint solver. Expand
...
1
2
3
4
...

References

SHOWING 1-10 OF 13 REFERENCES
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
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
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
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
Eligible and Frozen Constraints for Solving Temporal Qualitative Constraint Networks
TLDR
This paper extends a search algorithm using the weak composition closure method as a local propagation method and a decomposition of the constraints into subrelations of a tractable set with the notion of eligibility and frozen constraints to solve the consistency problem for qualitative constraint networks. Expand
Qualitative Spatial Representation and Reasoning in the SparQ-Toolbox
TLDR
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. 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 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
SailAway: Formalizing Navigation Rules
TLDR
It is argued that an agent’s spatial representation can be modeled on a qualitative level in a natural way and that this also empowers sophisticated high-level agent control. Expand
Boosting Systematic Search by Weighting Constraints
TLDR
A dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (CSP) and which avoids some trashing by first instantiating variables involved in the constraints that have frequently participated in dead-end situations. Expand
...
1
2
...