Semiring-based CSPs and valued CSPs: Basic properties and comparison

被引：0
|
作者：
Bistarelli, Stefano
Fargier, Helene
Montanari, Ugo
Rossi, Francesca
Schiex, Thomas
Verfaillie, Gerard
机构：
来源：
Lecture Notes in Computer Science | / 1106卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison
    Bistarelli S.
    Montanari U.
    Rossi F.
    Schiex T.
    Verfaillie G.
    Fargier H.
    Constraints, 1999, 4 (3) : 199 - 240
  • [2] Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison
    Bistarelli, S.
    Montanari, U.
    Rossi, F.
    Schiex, T.
    Verfaillie, G.
    Fargier, H.
    Constraints, 4 (03): : 199 - 240
  • [3] Constraint Hierarchies as Semiring-Based CSPs
    Hosobe, Hiroshi
    ICTAI: 2009 21ST INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE, 2009, : 176 - 183
  • [4] On planar valued CSPs
    Fulla, Peter
    Zivny, Stanislav
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2017, 87 : 104 - 118
  • [5] SKEW BISUBMODULARITY AND VALUED CSPs
    Huber, Anna
    Krokhin, Andrei
    Powell, Robert
    SIAM JOURNAL ON COMPUTING, 2014, 43 (03) : 1064 - 1084
  • [6] The Complexity of Conservative Valued CSPs
    Kolmogorov, Vladimir
    Zivny, Stanislav
    JOURNAL OF THE ACM, 2013, 60 (02)
  • [7] The Complexity of Finite -Valued CSPs
    Thappert, Johan
    Zivny, Stanislav
    STOC'13: PROCEEDINGS OF THE 2013 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2013, : 695 - 704
  • [8] Skew Bisubmodularity and Valued CSPs
    Huber, Anna
    Krokhin, Andrei
    Powell, Robert
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1296 - 1305
  • [9] A submodular-based decomposition strategy for valued CSPs
    Helaoui, Maher
    Naanaa, Wady
    PROCEEDINGS OF THE SIXTH STARTING AI RESEARCHERS' SYMPOSIUM (STAIRS 2012), 2012, 241 : 149 - +
  • [10] The Power of Linear Programming for Valued CSPs
    Thapper, Johan
    Zivny, Stanislav
    2012 IEEE 53RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2012, : 669 - 678
12345