Expressive power of constraint handling rules extensions and fragments

被引：0
|
作者：
Mauro, Jacopo [1 ]
机构：
[1] University of Bologna / INRIA, Italy
来源：
Bulletin of the European Association for Theoretical Computer Science | 2013年 / 111卷
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：168 / 194
相关论文
共 50 条
  • [1] EXPRESSIVE POWER OF CONSTRAINT HANDLING RULES EXTENSIONS AND FRAGMENTS
    Mauro, Jacopo
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2013, (111): : 168 - 194
  • [2] The Computational Power and Complexity of Constraint Handling Rules
    Sneyers, Jon
    Schrijvers, Tom
    Demoen, Bart
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2009, 31 (02):
  • [3] Analyses, optimizations and extensions of constraint handling rules: Ph.D. summary
    Schrijvers, T
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 435 - 436
  • [4] Constraint solving with constraint handling rules
    Frühwirth, T
    INTENSIONAL PROGRAMMING II: BASED ON THE PAPERS AT ISLIP'99, 2000, : 14 - 30
  • [5] Aggregates in Constraint Handling Rules
    Sneyers, Jon
    Van Weert, Peter
    Schrijvers, Tom
    Demoen, Bart
    LOGIC PROGRAMMING, PROCEEDINGS, 2007, 4670 : 446 - 448
  • [6] Transactions in Constraint Handling Rules
    Schrijvers, Tom
    Sulzmann, Martin
    LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 516 - +
  • [7] Quantified Constraint Handling Rules
    Barichard, Vincent
    Stephan, Igor
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2019, (306): : 210 - 223
  • [8] On completion of constraint handling rules
    Abdennadher, S
    Frühwirth, T
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP98, 1998, 1520 : 25 - 39
  • [9] On the expressive power of XQuery fragments
    Hidders, J
    Marrara, S
    Paredaens, J
    Vercammen, R
    DATABASE PROGRAMMING LANGUAGES, 2005, 3774 : 154 - 168
  • [10] Soft constraint propagation and solving in constraint handling rules
    Bistarelli, S
    Frühwirth, T
    Marte, M
    Rossi, F
    COMPUTATIONAL INTELLIGENCE, 2004, 20 (02) : 287 - 307
12345