Dynamic Branching in Qualitative Constraint Networks via Counting Local Models

DOI10.4230/LIPICS.TIME.2020.12OpenAlexW3089839703MaRDI QIDQ6060100FDOQ6060100

Authors: Michael Sioutis, Diedrich Wolter 

Publication date: 2 November 2023

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

zbMATH Keywords

qualitative constraintsadaptive algorithmspatial and temporal reasoningcounting local modelsdynamic branching

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Weak Composition for Qualitative Spatial and Temporal Reasoning
• Reasoning about temporal relations
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting-based search: branching heuristics for constraint satisfaction problems
• Title not available (Why is that?)
• 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

Cited In (1)

• Bounding, filtering and diversification in CP-based local branching

This page was built for publication: Dynamic Branching in Qualitative Constraint Networks via Counting Local Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6060100)