Dynamic branching in qualitative constraint-based reasoning via counting local models

DOI10.1016/j.ic.2021.104787OpenAlexW3185175570MaRDI QIDQ2051804

Diedrich Wolter, Michael Sioutis

Publication date: 25 November 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2021.104787

zbMATH Keywords

adaptive algorithmqualitative constraintsspatial and temporal reasoningcounting local modelsdynamic branching

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Proteus
• claspfolio 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Decomposition and tractability in qualitative spatial and temporal reasoning
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• On coarser interval temporal logics
• Collective singleton-based consistency for qualitative constraint networks: theory and practice
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
• A new modal logic for reasoning about space: spatial propositional neighborhood logic
• Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• Emergence of Scaling in Random Networks
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Weak Composition for Qualitative Spatial and Temporal Reasoning
• Reasoning about temporal relations

This page was built for publication: Dynamic branching in qualitative constraint-based reasoning via counting local models