A path-consistent singleton modeling (CSM) algorithm for arc-constrained networks

DOI10.1023/A:1020095501462MaRDI QIDQ1863917zbMATH OpenFDO

Authors Debasis Mitra

Publication date 12 March 2003

Published in Applied Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1020095501462

zbMATH Keywords

arc-constraintsconstraint-satisfaction problemscontinuous-domain CSPglobal-consistency algorithm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• Temporal constraint networks
• scientific article; zbMATH DE number 2089861
• scientific article; zbMATH DE number 1107729
• On-line algorithms for networks of temporal constraints
• Experimental analysis of numeric and symbolic constraint satisfaction techniques for temporal reasoning

Cited in

(1)

• On-line algorithms for networks of temporal constraints

This page was built for publication: A path-consistent singleton modeling (CSM) algorithm for arc-constrained networks

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