메뉴 건너뛰기




Volumn 31, Issue , 2008, Pages 113-155

CTL model update for system modifications

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; COMPUTER SOFTWARE; TREES (MATHEMATICS);

EID: 44449088491     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2420     Document Type: Article
Times cited : (44)

References (31)
  • 2
    • 16244392772 scopus 로고    scopus 로고
    • Knowledge updates: Semantics and complexity issues
    • Baral, C., & Zhang, Y. (2005). Knowledge updates: semantics and complexity issues. Artificial Intelligence, 164, 209-243.
    • (2005) Artificial Intelligence , vol.164 , pp. 209-243
    • Baral, C.1    Zhang, Y.2
  • 9
    • 4243189286 scopus 로고    scopus 로고
    • Counterexample-guided abstraction refinement for symbolic model checking
    • Clarke, E., Grumberg, O., Jha, S., Liu, Y., & Veith, H. (2003). Counterexample-guided abstraction refinement for symbolic model checking. Journal of ACM, 50, 752-794.
    • (2003) Journal of ACM , vol.50 , pp. 752-794
    • Clarke, E.1    Grumberg, O.2    Jha, S.3    Liu, Y.4    Veith, H.5
  • 15
    • 0026940077 scopus 로고
    • On the complexity of propositional knowledge base revision, updates, and counterfactuals
    • Eiter, T., & Gottlob, G. (1992). On the complexity of propositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence, 57, 227-270.
    • (1992) Artificial Intelligence , vol.57 , pp. 227-270
    • Eiter, T.1    Gottlob, G.2
  • 21
    • 0033356350 scopus 로고    scopus 로고
    • Propositional belief base update and minimal change
    • Herzig, A., & Rifi, O. (1999). Propositional belief base update and minimal change. Artificial Intelligence, 115, 107-138.
    • (1999) Artificial Intelligence , vol.115 , pp. 107-138
    • Herzig, A.1    Rifi, O.2
  • 25
    • 44449164952 scopus 로고    scopus 로고
    • A logic of implicit and explicit belief
    • Cadence Berkeley Labs, Cadence Design Systems
    • McMillan, K., & Amla, N. (2002). A logic of implicit and explicit belief. In Automatic Abstraction without Counterexamples. Cadence Berkeley Labs, Cadence Design Systems.
    • (2002) Automatic Abstraction without Counterexamples
    • McMillan, K.1    Amla, N.2
  • 26
    • 0002621234 scopus 로고    scopus 로고
    • An optimal minimum spanning tree algorithm
    • Pettie, S., & Ramachandran, V. (2002). An optimal minimum spanning tree algorithm. Journal of ACM, 49, 16-34.
    • (2002) Journal of ACM , vol.49 , pp. 16-34
    • Pettie, S.1    Ramachandran, V.2
  • 27
  • 30
    • 85156267281 scopus 로고
    • Reasoning about action using a possible models approach
    • Winslett, M. (1988). Reasoning about action using a possible models approach. In Proceedings of AAAI-88, pp. 89-93.
    • (1988) Proceedings of AAAI-88 , pp. 89-93
    • Winslett, M.1


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