메뉴 건너뛰기




Volumn , Issue , 2007, Pages 25-36

User-definable rule priorities for CHR

Author keywords

Constraint handling rules; Execution control; Rule priorities

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING LANGUAGES; SEMANTICS; SUPERVISORY AND EXECUTIVE PROGRAMS; USER INTERFACES;

EID: 34548062390     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273920.1273924     Document Type: Conference Paper
Times cited : (30)

References (34)
  • 1
    • 84948994483 scopus 로고    scopus 로고
    • Operational semantics and confluence of constraint propagation rules
    • 3rd Intl. Confi on Principles and Practice of Constraint Programming, of
    • S. Abdennadher. Operational semantics and confluence of constraint propagation rules. In 3rd Intl. Confi on Principles and Practice of Constraint Programming, volume 1330 of LNCS, pages 252-266, 1997.
    • (1997) LNCS , vol.1330 , pp. 252-266
    • Abdennadher, S.1
  • 2
    • 85030314129 scopus 로고
    • Term rewriting systems with priorities
    • 2nd Intl. Conf. on Rewriting Techniques and Applications, of
    • J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Term rewriting systems with priorities. In 2nd Intl. Conf. on Rewriting Techniques and Applications, volume 256 of LNCS, pages 83-94, 1987.
    • (1987) LNCS , vol.256 , pp. 83-94
    • Baeten, J.C.M.1    Bergstra, J.A.2    Klop, J.W.3
  • 3
    • 33646174284 scopus 로고    scopus 로고
    • A linear-logic semantics for constraint handling rules
    • 11th Intl. Conf. on Principles and Practice of Constraint Programming, of
    • H. Betz and T. W. Frühwirth. A linear-logic semantics for constraint handling rules. In 11th Intl. Conf. on Principles and Practice of Constraint Programming, volume 3709 of LNCS, pages 137-151, 2005.
    • (2005) LNCS , vol.3709 , pp. 137-151
    • Betz, H.1    Frühwirth, T.W.2
  • 4
    • 0033522718 scopus 로고    scopus 로고
    • Preferred answer sets for extended logic programs
    • G. Brewka and T. Eiter. Preferred answer sets for extended logic programs. Artif. Intell., 109(1-2):297-356, 1999.
    • (1999) Artif. Intell , vol.109 , Issue.1-2 , pp. 297-356
    • Brewka, G.1    Eiter, T.2
  • 7
    • 84923057783 scopus 로고    scopus 로고
    • An open-ended finite domain constraint solver
    • 9th Intl. Symp. on Programming Languages: Implementations, Logics, and Programs, of
    • M. Carlsson, G. Ottosson, and B. Carlson. An open-ended finite domain constraint solver. In 9th Intl. Symp. on Programming Languages: Implementations, Logics, and Programs, volume 1292 of LNCS, pages 191-206, 1997.
    • (1997) LNCS , vol.1292 , pp. 191-206
    • Carlsson, M.1    Ottosson, G.2    Carlson, B.3
  • 8
    • 34548067031 scopus 로고    scopus 로고
    • rp : Constraint Handling Rules with rule priorities. Technical Report 479, K.U.Leuven, Belgium, March 2007.
    • rp : Constraint Handling Rules with rule priorities. Technical Report 479, K.U.Leuven, Belgium, March 2007.
  • 9
  • 11
    • 0020177941 scopus 로고
    • Rete: A fast algorithm for the many pattern/many object pattern match problem
    • C. L. Forgy. Rete: A fast algorithm for the many pattern/many object pattern match problem. Artif. Intell., 19(1):17-37, 1982.
    • (1982) Artif. Intell , vol.19 , Issue.1 , pp. 17-37
    • Forgy, C.L.1
  • 13
    • 0032186691 scopus 로고    scopus 로고
    • Theory and practice of Constraint Handling Rules
    • T. W. Frühwirth.. Theory and practice of Constraint Handling Rules. J. Log. Program, 37(1-3):95-138, 1998.
    • (1998) J. Log. Program , vol.37 , Issue.1-3 , pp. 95-138
    • Frühwirth, T.W.1
  • 15
    • 84888243867 scopus 로고    scopus 로고
    • Logical algorithms
    • 18th Intl. Conf. on Logic Programming, of
    • H. Ganzinger and D. A. McAllester. Logical algorithms. In 18th Intl. Conf. on Logic Programming, volume 2401 of LNCS, pages 209-223, 2002.
    • (2002) LNCS , vol.2401 , pp. 209-223
    • Ganzinger, H.1    McAllester, D.A.2
  • 16
    • 2142657347 scopus 로고    scopus 로고
    • Defeasible logic programming: An argumentative approach
    • A. J. García and G. R. Simari. Defeasible logic programming: An argumentative approach. Theory Pract. Log. Program., 4(1-2):95-138, 2004.
    • (2004) Theory Pract. Log. Program , vol.4 , Issue.1-2 , pp. 95-138
    • García, A.J.1    Simari, G.R.2
  • 22
    • 34548105856 scopus 로고    scopus 로고
    • F. Morawietz. Chart parsing and constraint programming. In 18th Intl. Conf. on Computational Linguistics, pages 551-557. Morgan Kaufmann, 2000.
    • F. Morawietz. Chart parsing and constraint programming. In 18th Intl. Conf. on Computational Linguistics, pages 551-557. Morgan Kaufmann, 2000.
  • 23
    • 34548096611 scopus 로고    scopus 로고
    • M. Proctor, M. Neale, P. Lin, and M. Frandsen. Drools Documentation, Version 3.0.5, 2006
    • M. Proctor, M. Neale, P. Lin, and M. Frandsen. Drools Documentation, Version 3.0.5, 2006. http://www.jboss.com/products/rules.
  • 25
    • 34548098843 scopus 로고    scopus 로고
    • T. Schrijvers. Analyses, Optimizations and Extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Leuven, Belgium, Jun 2005.
    • T. Schrijvers. Analyses, Optimizations and Extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Leuven, Belgium, Jun 2005.
  • 26
    • 34548062240 scopus 로고    scopus 로고
    • T. Schrijvers and B. Demoen. The K.U.Leuven CHR system: Implementation and application. In First Workshop on Constraint Handling Rules: Selected Contributions, 2004-01 of Ulmer Informatik-Berichte, pages 1-5. Universität Ulm, 2004.
    • T. Schrijvers and B. Demoen. The K.U.Leuven CHR system: Implementation and application. In First Workshop on Constraint Handling Rules: Selected Contributions, volume 2004-01 of Ulmer Informatik-Berichte, pages 1-5. Universität Ulm, 2004.
  • 28
    • 31644450280 scopus 로고    scopus 로고
    • Optimal union-find in Constraint Handling Rules
    • T. Schrijvers and T. W. Frühwirth. Optimal union-find in Constraint Handling Rules. Theory Pract. Log. Program., 6(1-2):213-224, 2006.
    • (2006) Theory Pract. Log. Program , vol.6 , Issue.1-2 , pp. 213-224
    • Schrijvers, T.1    Frühwirth, T.W.2
  • 30
    • 33750358743 scopus 로고    scopus 로고
    • Speeding up constraint propagation
    • 10th Intl. Conf. on Principles and Practice of Constraint Programming, of
    • C. Schulte and P. J. Stuckey. Speeding up constraint propagation. In 10th Intl. Conf. on Principles and Practice of Constraint Programming, volume 3258 of LNCS, pages 619-633, 2004.
    • (2004) LNCS , vol.3258 , pp. 619-633
    • Schulte, C.1    Stuckey, P.J.2
  • 31
    • 34548072138 scopus 로고    scopus 로고
    • J. Sneyers, T. Schrijvers, and B. Demoen. The computational power and complexity of Constraint Handling Rules. In 2nd Workshop on Constraint Handling Rules, 421 of Reports CW, pages 3-17. Dept. of Computer Science, K.U.Leuven, Belgium, 2005.
    • J. Sneyers, T. Schrijvers, and B. Demoen. The computational power and complexity of Constraint Handling Rules. In 2nd Workshop on Constraint Handling Rules, volume 421 of Reports CW, pages 3-17. Dept. of Computer Science, K.U.Leuven, Belgium, 2005.
  • 32
    • 34548083910 scopus 로고    scopus 로고
    • P. Van Weert, T. Schrijvers, and B. Demoen. K.U.Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java. In 2nd Workshop on Constraint Handling Rules, 421 of Reports CW, pages 47-62. Dept. of Computer Science, K.U.Leuven, Belgium, 2005.
    • P. Van Weert, T. Schrijvers, and B. Demoen. K.U.Leuven JCHR: A user-friendly, flexible and efficient CHR system for Java. In 2nd Workshop on Constraint Handling Rules, volume 421 of Reports CW, pages 47-62. Dept. of Computer Science, K.U.Leuven, Belgium, 2005.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.