메뉴 건너뛰기




Volumn 170, Issue 1, 2006, Pages 1-18

RCC8 binary constraint network can be consistently extended

Author keywords

Binary constraint network; Computational complexity; Extensionality; Path consistency; Qualitative spatial reasoning; Region connection calculus

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GEOGRAPHIC INFORMATION SYSTEMS;

EID: 27744608877     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2005.08.003     Document Type: Article
Times cited : (22)

References (25)
  • 1
    • 0020849266 scopus 로고
    • Maintaining knowledge about temporal intervals
    • J.F. Allen Maintaining knowledge about temporal intervals Comm. ACM 26 1983 832 843
    • (1983) Comm. ACM , vol.26 , pp. 832-843
    • Allen, J.F.1
  • 4
    • 85015276012 scopus 로고
    • Qualitative and topological relationships in spatial databases
    • D. Abel B.C. Doi, Advances in Spatial Databases, Springer Berlin
    • Z. Cui, A.G. Cohn, and D.A. Randell Qualitative and topological relationships in spatial databases D. Abel B.C. Doi Advances in Spatial Databases Lecture Notes in Computer Sciences vol. 692 1993 Springer Berlin 293 315
    • (1993) Lecture Notes in Computer Sciences , vol.692 , pp. 293-315
    • Cui, Z.1    Cohn, A.G.2    Randell, D.A.3
  • 6
    • 0034898728 scopus 로고    scopus 로고
    • A relation-algebraic approach to the Region Connection Calculus
    • I. Düntsch, H. Wang, and S. McCloskey A relation-algebraic approach to the Region Connection Calculus Theoret. Comput. Sci. 255 2001 63 83
    • (2001) Theoret. Comput. Sci. , vol.255 , pp. 63-83
    • Düntsch, I.1    Wang, H.2    McCloskey, S.3
  • 7
    • 27744600741 scopus 로고    scopus 로고
    • A representation theorem for Boolean contact algebras
    • in press
    • I. Düntsch, M. Winter, A representation theorem for Boolean contact algebras, Theoret. Comput. Sci. (B) (2005), in press
    • (2005) Theoret. Comput. Sci. (B)
    • Düntsch, I.1    Winter, M.2
  • 8
    • 85030846174 scopus 로고
    • Reasoning about binary topological relations
    • O. Günther H.J. Schek Springer New York
    • M.J. Egenhofer Reasoning about binary topological relations O. Günther H.J. Schek Advances in Spatial Databases 1991 Springer New York 143 160
    • (1991) Advances in Spatial Databases , pp. 143-160
    • Egenhofer, M.J.1
  • 9
    • 0011041087 scopus 로고    scopus 로고
    • An axiomatic approach to spatial information systems
    • School of Computer Studies, University of Leeds
    • N.M. Gotts, An axiomatic approach to spatial information systems, Research Report 96.25, School of Computer Studies, University of Leeds, 1996
    • (1996) Research Report , vol.96 , Issue.25
    • Gotts, N.M.1
  • 10
    • 0028430785 scopus 로고
    • On binary constraint problems
    • P. Ladkin, and R. Maddux On binary constraint problems J. ACM 41 3 1994 435 469
    • (1994) J. ACM , vol.41 , Issue.3 , pp. 435-469
    • Ladkin, P.1    Maddux, R.2
  • 12
    • 0141828978 scopus 로고    scopus 로고
    • Extensionality of the RCC8 composition table
    • S. Li, and M. Ying Extensionality of the RCC8 composition table Fundamenta Informaticae 55 3-4 2003 363 385
    • (2003) Fundamenta Informaticae , vol.55 , Issue.3-4 , pp. 363-385
    • Li, S.1    Ying, M.2
  • 13
    • 0037382408 scopus 로고    scopus 로고
    • Region Connection Calculus: Its models and composition table
    • S. Li, and M. Ying Region Connection Calculus: Its models and composition table Artificial Intelligence 145 1-2 2003 121 146
    • (2003) Artificial Intelligence , vol.145 , Issue.1-2 , pp. 121-146
    • Li, S.1    Ying, M.2
  • 14
    • 7544242367 scopus 로고    scopus 로고
    • Generalized Region Connection Calculus
    • S. Li, and M. Ying Generalized Region Connection Calculus Artificial Intelligence 160 1-2 2004 1 34
    • (2004) Artificial Intelligence , vol.160 , Issue.1-2 , pp. 1-34
    • Li, S.1    Ying, M.2
  • 16
    • 0029229419 scopus 로고
    • Reasoning about temporal relations: A maximal tractable subset of Allen's interval algebra
    • B. Nebel, and H.-J. Bürckert Reasoning about temporal relations: a maximal tractable subset of Allen's interval algebra J. ACM 42 1 1995 43 66
    • (1995) J. ACM , vol.42 , Issue.1 , pp. 43-66
    • Nebel, B.1    Bürckert, H.-J.2
  • 21
    • 0141501779 scopus 로고    scopus 로고
    • Qualitative Spatial Reasoning with Topological Information
    • Springer Berlin
    • J. Renz Qualitative Spatial Reasoning with Topological Information Lecture Notes in Artificial Intelligence vol. 2293 2002 Springer Berlin
    • (2002) Lecture Notes in Artificial Intelligence , vol.2293
    • Renz, J.1
  • 22
    • 0033620274 scopus 로고    scopus 로고
    • On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
    • J. Renz, and B. Nebel On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus Artificial Intelligence 108 1999 69 123
    • (1999) Artificial Intelligence , vol.108 , pp. 69-123
    • Renz, J.1    Nebel, B.2
  • 23
    • 0034270992 scopus 로고    scopus 로고
    • Boolean connection algebras: A new approach to the Region-Connection Calculus
    • J.G. Stell Boolean connection algebras: A new approach to the Region-Connection Calculus Artificial Intelligence 122 2000 111 136
    • (2000) Artificial Intelligence , vol.122 , pp. 111-136
    • Stell, J.G.1
  • 25
    • 85124157306 scopus 로고
    • Constraint propagation algorithms for temporal reasoning
    • Philadelphia, PA
    • M. Vilain, H. Kautz, Constraint propagation algorithms for temporal reasoning, in: Proceedings AAAI-86, Philadelphia, PA, 1986
    • (1986) Proceedings AAAI-86
    • Vilain, M.1    Kautz, H.2


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