메뉴 건너뛰기




Volumn 1118, Issue , 1996, Pages 2-15

On confluence of constraint handling rules

Author keywords

Committed choice languages; Confluence and determinacy; Constraint reasoning; Semantics of programming languages

Indexed keywords


EID: 84957878613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_62     Document Type: Conference Paper
Times cited : (22)

References (16)
  • 3
    • 85034823126 scopus 로고
    • Confluence of conditional rewrite systems
    • LNCS
    • N. Dershowitz, N. Okada, and G. Sivakumar. Confluence of conditional rewrite systems. In 1st CTRS pages 31-44. LNCS 308, 1988.
    • (1988) 1St CTRS , vol.308 , pp. 31-44
    • Dershowitz, N.1    Okada, N.2    Sivakumar, G.3
  • 10
    • 0002342841 scopus 로고
    • Logic Semantics for a Class of Committed-Choice Programs
    • Melbourne, Australia
    • M. J. Maher. Logic Semantics for a Class of Committed-Choice Programs. In Fourth International Conference on Logic Programming, pages 858-876, Melbourne, Australia, May 1987.
    • (1987) Fourth International Conference on Logic Programming , pp. 858-876
    • Maher, M.J.1
  • 11
    • 84958056142 scopus 로고
    • A confluent calculus for concurrent constraint programming with guarded choice
    • Ugo Montanari Francesca Rossi, editor, Cassis, France, Berlin, Springer
    • K. Marriott and M. Odersky. A confluent calculus for concurrent constraint programming with guarded choice. In Ugo Montanari Francesca Rossi, editor, Principles and Practice of Constraint Programming, Proceedings First International Conference, CP'95, Cassis, France, pages 310-327, Berlin, September 1995. Springer.
    • (1995) Principles and Practice of Constraint Programming, Proceedings First International Conference, CP'95 , pp. 310-327
    • Marriott, K.1    Odersky, M.2
  • 12
    • 0011450112 scopus 로고
    • Equational reasoning and term rewriting systems
    • D. Gabbay, C. Hogger, J. A. Robinson, and J. Siekmann, editors, chapter 5, Oxford University Press, Oxford
    • David A. Plaisted. Equational reasoning and term rewriting systems. In D. Gabbay, C. Hogger, J. A. Robinson, and J. Siekmann, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, volume 1, chapter 5, pages 273-364. Oxford University Press, Oxford, 1993.
    • (1993) Handbook of Logic in Artificial Intelligence and Logic Programming , vol.1 , pp. 273-364
    • Plaisted, D.A.1
  • 14
    • 0024736239 scopus 로고
    • The family of concurrent logic programming languages
    • E. Shapiro. The family of concurrent logic programming languages. In A CM Computing Surveys, volume 21:3, pages 413-510, September 1989.
    • (1989) A CM Computing Surveys , vol.21 , Issue.3 , pp. 413-510
    • Shapiro, E.1


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