Dynamic Branching in Qualitative Constraint Networks via Counting Local Models

DOI10.4230/lipics.time.2020.12OpenAlexW3089839703MaRDI QIDQ6060100

Michael Sioutis, Diedrich Wolter

Publication date: 2 November 2023

Full work available at URL: https://hal.science/hal-04290640

zbMATH Keywords

adaptive algorithmqualitative constraintsspatial and temporal reasoningcounting local modelsdynamic branching

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• On coarser interval temporal logics
• Collective singleton-based consistency for qualitative constraint networks: theory and practice
• A new modal logic for reasoning about space: spatial propositional neighborhood logic
• Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems
• 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 Networks via Counting Local Models