메뉴 건너뛰기




Volumn , Issue , 2003, Pages 367-374

Basic components for constraint solver cooperations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; DATA FLOW ANALYSIS;

EID: 0038336949     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/952603.952606     Document Type: Conference Paper
Times cited : (10)

References (22)
  • 1
    • 0001751689 scopus 로고    scopus 로고
    • The essence of constraint propagation
    • K. R. Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1-2):179-210, 1999. Available via http://arXiv.org/archive/cs/.
    • (1999) Theoretical Computer Science , vol.221 , Issue.1-2 , pp. 179-210
    • Apt, K.R.1
  • 2
    • 0013398527 scopus 로고    scopus 로고
    • The role of commutativity in constraint propagation algorithms
    • K. R. Apt. The Role of Commutativity in Constraint Propagation Algorithms. ACM Trans. on Programming Languages and Systems, 22(6):1002-1036, 2000.
    • (2000) ACM Trans. on Programming Languages and Systems , vol.22 , Issue.6 , pp. 1002-1036
    • Apt, K.R.1
  • 3
    • 84958773067 scopus 로고    scopus 로고
    • The IWIM model for coordination of concurrent activities
    • P. Ciancarini and C. Hankin, editors, Proc. of the International Conference Coordination Languages and Models. Springer-Verlag
    • F. Arbab. The IWIM model for coordination of concurrent activities. In P. Ciancarini and C. Hankin, editors, Proc. of the International Conference Coordination Languages and Models, volume 1061 of LNCS, pages 34-56. Springer-Verlag, 1996.
    • (1996) LNCS , vol.1061 , pp. 34-56
    • Arbab, F.1
  • 5
    • 0037649077 scopus 로고    scopus 로고
    • Coordination of heterogeneous distributed cooperative constraint solving
    • F. Arbab and E. Monfroy. Coordination of Heterogeneous Distributed Cooperative Constraint Solving. ACM SIGAPP Applied Computing Review, 6(2):4-17, 1998.
    • (1998) ACM SIGAPP Applied Computing Review , vol.6 , Issue.2 , pp. 4-17
    • Arbab, F.1    Monfroy, E.2
  • 6
    • 84984725845 scopus 로고
    • Combinatorial problem solving in constraint logic programming with cooperative solvers
    • Studies in Computer Science and A.I. Elsevier
    • H. Beringer and B. De Backer. Combinatorial problem solving in constraint logic programming with cooperative solvers. In Logic programming: formal methods and practical applications, Studies in Computer Science and A.I. Elsevier, 1995.
    • (1995) Logic Programming: Formal Methods and Practical Applications
    • Beringer, H.1    De Backer, B.2
  • 8
    • 84943259826 scopus 로고    scopus 로고
    • A control language for designing constraint solvers
    • Proc. of the 3rd Int. Conf. Perspective of System Informatics, PSI'99, Novosibirsk, Akademgorodok, Russia
    • C. Castro and E. Monfroy. A Control Language for Designing Constraint Solvers. In Proc. of the 3rd Int. Conf. Perspective of System Informatics, PSI'99, volume 1755 of LNCS, pages 402-415, Novosibirsk, Akademgorodok, Russia, 2000.
    • (2000) LNCS , vol.1755 , pp. 402-415
    • Castro, C.1    Monfroy, E.2
  • 9
    • 84974708329 scopus 로고    scopus 로고
    • Basic operators for solving constraints via collaboration of solvers
    • J. A. Campbell and E. Roanes-Lozano, editors, Proc. of the 5th Int. Conf. on Artificial Intelligence and Symbolic Computation (AISC'2000), Madrid, Spain. Springer
    • C. Castro and E. Monfroy. Basic Operators for Solving Constraints via Collaboration of Solvers. In J. A. Campbell and E. Roanes-Lozano, editors, Proc. of the 5th Int. Conf. on Artificial Intelligence and Symbolic Computation (AISC'2000), volume 1930 of LNCS, pages 142-146, Madrid, Spain, 2001. Springer.
    • (2001) LNCS , vol.1930 , pp. 142-146
    • Castro, C.1    Monfroy, E.2
  • 10
    • 0032186691 scopus 로고    scopus 로고
    • Theory and practice of constraint handling rules
    • October
    • T. Frühwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37(1-3):95-138, October 1998.
    • (1998) Journal of Logic Programming , vol.37 , Issue.1-3 , pp. 95-138
    • Frühwirth, T.1
  • 13
    • 84867816796 scopus 로고    scopus 로고
    • Better communication for tighter cooperation
    • Proceedings of Computational Logic, London, UK. Springer-Verlag
    • P. Hofstedt. Better communication for tighter cooperation. In Proceedings of Computational Logic, London, UK, volume 1861 of Lecture Notes in Artificial Intelligence, pages 342-357. Springer-Verlag, 2000.
    • (2000) Lecture Notes in Artificial Intelligence , vol.1861 , pp. 342-357
    • Hofstedt, P.1
  • 14
  • 16
    • 0000959937 scopus 로고
    • Constraint satisfaction
    • Stuart C. Shapiro, editor. Addison-Wesley. 2nd Edition
    • A. K. Mackworth. Constraint Satisfaction. In Stuart C. Shapiro, editor, Encyclopedia of A.I., volume 1. Addison-Wesley, 1992. 2nd Edition.
    • (1992) Encyclopedia of A.I. , vol.1
    • Mackworth, A.K.1
  • 17
    • 0037986840 scopus 로고    scopus 로고
    • Control-driven coordination programming in shared dataspace
    • Proc. of the 4th Int. Conf. on Parallel Computing Technologies (PaCT-97), Yaroslavl, Russia. Springer-Verlag
    • G. A. Papadopoulos and F. Arbab. Control-Driven Coordination Programming in Shared Dataspace. In Proc. of the 4th Int. Conf. on Parallel Computing Technologies (PaCT-97), volume 1277 of LNCS, pages 247-261, Yaroslavl, Russia, 1997. Springer-Verlag.
    • (1997) LNCS , vol.1277 , pp. 247-261
    • Papadopoulos, G.A.1    Arbab, F.2
  • 20
    • 0011087823 scopus 로고    scopus 로고
    • Cooperation of decision procedures for the satisfiability problem
    • F. Baader and K. Schulz, editors, Applied Logic. Kluwer Academic Publishers
    • C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. Schulz, editors, Frontiers of Combining Systems (FroCoS'96), Applied Logic, pages 121-140. Kluwer Academic Publishers, 1996.
    • (1996) Frontiers of Combining Systems (FroCoS'96) , pp. 121-140
    • Ringeissen, C.1


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