메뉴 건너뛰기




Volumn 8, Issue 1-2, 2008, Pages 150-166

Tractable fragments of fuzzy qualitative algebra

Author keywords

Possibility theory; Qualitative algebras; Temporal reasoning

Indexed keywords

FUZZY ALGEBRA; FUZZY CSPS; GENERAL METHODOLOGIES; POSSIBILITY THEORY; TEMPORAL CONSTRAINTS; TEMPORAL REASONING; VAGUENESS AND UNCERTAINTY;

EID: 77951445860     PISSN: 13875868     EISSN: 15427633     Source Type: Journal    
DOI: 10.1080/13875860801944812     Document Type: Article
Times cited : (2)

References (19)
  • 1
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Com-munications of the ACM, 26(1), 832-843.
    • (1983) Com-munications of the ACM , vol.26 , Issue.1 , pp. 832-843
    • Allen, J.F.1
  • 4
    • 26944446394 scopus 로고    scopus 로고
    • Integrating quantitative and qualitative constraints in fuzzy temporal networks
    • Badaloni, S., Falda, M., & Giacomin, M. (2004). Integrating quantitative and qualitative constraints in fuzzy temporal networks. AI Communications, 17(4), 183-272.
    • (2004) AI Communications , vol.17 , Issue.4 , pp. 183-272
    • Badaloni, S.1    Falda, M.2    Giacomin, M.3
  • 6
    • 33646758577 scopus 로고    scopus 로고
    • The algebra IAfuz: A framework for qualitative fuzzy temporal reasoning
    • Badaloni, S., & Giacomin, M. (2006). The algebra IAfuz: A framework for qualitative fuzzy temporal reasoning. Artificial Intelligence, 170(10), 872-908.
    • (2006) Artificial Intelligence , vol.170 , Issue.10 , pp. 872-908
    • Badaloni, S.1    Giacomin, M.2
  • 8
    • 0030263061 scopus 로고    scopus 로고
    • Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty
    • Dubois, D., Fargier, H., & Prade, H. (1996). Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Ap-plied Intelligence, 6, 287-309.
    • (1996) Ap-plied Intelligence , vol.6 , pp. 287-309
    • Dubois, D.1    Fargier, H.2    Prade, H.3
  • 10
    • 0033522707 scopus 로고    scopus 로고
    • Computational complexity of relating time points with intervals
    • Jonsson, P., Drakengren, T., & Backström, C. (1999). Computational complexity of relating time points with intervals. Artificial Intelligence, 109, 273-295.
    • (1999) Artificial Intelligence , vol.109 , pp. 273-295
    • Jonsson, P.1    Drakengren, T.2    Backström, C.3
  • 11
    • 7544243078 scopus 로고    scopus 로고
    • Complexity classification in qualitative temporal constraint reasoning
    • Jonsson, P., & Krokhin, A. (2004). Complexity classification in qualitative temporal constraint reasoning. Artificial Intelligence, 160, 35-51.
    • (2004) Artificial Intelligence , vol.160 , pp. 35-51
    • Jonsson, P.1    Krokhin, A.2
  • 13
    • 0030288617 scopus 로고    scopus 로고
    • Combining qualitative and quantitative constraints in temporal reasoning
    • Meiri, I. (1996). Combining qualitative and quantitative constraints in temporal reasoning. Artificial Intelligence, 87, 343-385.
    • (1996) Artificial Intelligence , vol.87 , pp. 343-385
    • Meiri, I.1
  • 14
    • 0029229419 scopus 로고
    • Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra
    • Nebel, B., & Bürckert, H. J. (1995). Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Journal of the ACM, 42(1), 43-66.
    • (1995) Journal of the ACM , vol.42 , Issue.1 , pp. 43-66
    • Nebel, B.1    Bürckert, H.J.2
  • 16
    • 0033620274 scopus 로고    scopus 로고
    • Maximal tractable fragments of the region connection calculus: A complete analysis
    • Renz, J. (1999). Maximal tractable fragments of the region connection calculus: A complete analysis. Artificial Intelligence, 108, 69-123.
    • (1999) Artificial Intelligence , vol.108 , pp. 69-123
    • Renz, J.1
  • 17
    • 84990586467 scopus 로고
    • Exact and approximate reasoning about temporal relations
    • van Beek, P., & Cohen, R. (1990). Exact and approximate reasoning about temporal relations. Computational Intelligence, 6, 132-144.
    • (1990) Computational Intelligence , vol.6 , pp. 132-144
    • van Beek, P.1    Cohen, R.2
  • 18
    • 84944058286 scopus 로고
    • Constraint propagation algorithms for temporal reasoning: A revised report
    • In J. de Kleer and D. S. Weld (Eds.), San Mateo, CA: Morgan Kaufmann
    • Vilain, M., Kautz, H., & van Beek, P. (1989). Constraint propagation algorithms for temporal reasoning: A revised report. In J. de Kleer and D. S. Weld (Eds.), Readings in qualitative reasoning about physical systems (pp. 373-381). San Mateo, CA: Morgan Kaufmann.
    • (1989) Readings in qualitative reasoning about physical systems , pp. 373-381
    • Vilain, M.1    Kautz, H.2    van Beek, P.3


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