On-Demand Bound Computation for Best-First Constraint Optimization
暂无分享,去创建一个
[1] Thomas Schiex,et al. Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison , 1999, Constraints.
[2] Georg Gottlob,et al. A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.
[3] Gerald J. Sussman,et al. Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.
[4] Unifying Tree-decomposition Schemes for Automated Reasoning Keywords : Automated Reasoning , 2022 .
[5] Rina Dechter,et al. A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..
[6] Rina Dechter,et al. A Scheme for Approximating Probabilistic Inference , 1997, UAI.
[7] G. Debreu. Topological Methods in Cardinal Utility Theory , 1959 .
[8] Francesca Rossi,et al. Semiring-based constraint solving and optimization , 1997 .
[9] Johan de Kleer. Focusing on Probable Diagnoses , 1991, AAAI.
[10] Rina Dechter,et al. Generalized best-first search strategies and the optimality of A* , 1985, JACM.
[11] Francesca Rossi,et al. Semiring-based constraint satisfaction and optimization , 1997, JACM.
[12] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[13] Javier Larrosa,et al. A General Scheme for Multiple Lower Bound Computation in Constraint Optimization , 2001, CP.
[14] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.
[15] Rina Dechter,et al. Tree Clustering for Constraint Networks , 1989, Artif. Intell..