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

DOI10.1016/J.IC.2021.104787MaRDI QIDQ2051804zbMATH OpenOpenAlexFDO

Authors Michael Sioutis, Diedrich Wolter

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 algorithmcounting local modelsdynamic branchingqualitative constraintsspatial and temporal reasoning

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Learning qualitative constraint networks
• Decomposition and tractability in qualitative spatial and temporal reasoning
• scientific article; zbMATH DE number 2089861
• Counting-based search: branching heuristics for constraint satisfaction problems
• On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning

Cites work

• claspfolio2: Advances in Algorithm Selection for Answer Set Programming
• A new modal logic for reasoning about space: spatial propositional neighborhood logic
• Collective singleton-based consistency for qualitative constraint networks: theory and practice
• Counting-based search: branching heuristics for constraint satisfaction problems
• Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
• Decomposition and tractability in qualitative spatial and temporal reasoning
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 5953014 (Why is no real title available?)
• scientific article; zbMATH DE number 1149417 (Why is no real title available?)
• scientific article; zbMATH DE number 1753151 (Why is no real title available?)
• scientific article; zbMATH DE number 2243382 (Why is no real title available?)
• Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class
• Maintaining knowledge about temporal intervals
• On coarser interval temporal logics
• Reasoning about temporal relations
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
• The fast downward planning system
• Weak Composition for Qualitative Spatial and Temporal Reasoning

Cited in

(3)

• Learning qualitative constraint networks
• Bounding, filtering and diversification in CP-based local branching
• A reinforcement learning approach for resolving inconsistencies in qualitative constraint networks

Describes a project that uses

Uses Software

• Proteus
• claspfolio 2

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

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