메뉴 건너뛰기




Volumn 5366 LNCS, Issue , 2008, Pages 749-753

Telecommunications feature subscription as a partial order constraint problem

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING (CP); CONSTRAINT SOLVERS; EXPERIMENTAL EVALUATIONS; INTEGER VALUES; PARTIAL ORDERS; BOOLEAN SATISFACTIONS; CONSTRAINT PROGRAMMING; EXPERIMENTAL EVALUATION; INTEGER LINEAR PROGRAMMING; PARTIAL ORDER; PROPOSITIONAL LOGIC; STATE OF THE ART;

EID: 58549120419     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89982-2_70     Document Type: Conference Paper
Times cited : (5)

References (5)
  • 1
    • 56449131494 scopus 로고    scopus 로고
    • Lesaint, D., Mehta, D., O'Sullivan, B., Quesada, L.O., Wilson, N.: Solving a tele-communications feature subscription configuration problem. In: Stuckey, P.J. (ed.) CP 2008. LNCS, 5202, pp. 67-81. Springer, Heidelberg (2008)
    • Lesaint, D., Mehta, D., O'Sullivan, B., Quesada, L.O., Wilson, N.: Solving a tele-communications feature subscription configuration problem. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 67-81. Springer, Heidelberg (2008)
  • 2
    • 58549101768 scopus 로고    scopus 로고
    • Codish, M., Lagoon, V., Stuckey, P.J.: Solving partial order constraints for LPO termination. Journal on Satisfiability, Boolean Modeling and Computation 5, 193-215 (2008), An earlier version appears In: Pfenning, F. (ed.) RTA 2006. LNCS, 4098, pp. 4-18. Springer, Heidelberg (2006)
    • Codish, M., Lagoon, V., Stuckey, P.J.: Solving partial order constraints for LPO termination. Journal on Satisfiability, Boolean Modeling and Computation 5, 193-215 (2008), An earlier version appears In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 4-18. Springer, Heidelberg (2006)
  • 4
    • 30344450270 scopus 로고    scopus 로고
    • Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, 2919, pp. 502-518. Springer, Heidelberg (2004)
    • Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
  • 5
    • 36849050713 scopus 로고    scopus 로고
    • Logic programming with satisfiability
    • Codish, M., Lagoon, V., Stuckey, P.J.: Logic programming with satisfiability. TPLP 8(1), 121-128 (2008)
    • (2008) TPLP , vol.8 , Issue.1 , pp. 121-128
    • Codish, M.1    Lagoon, V.2    Stuckey, P.J.3


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