{"type":"ScholarlyArticle","title":"On Redundant Topological Constraints (Extended Abstract)","authors":[{"name":"Sanjiang Li","slug":"sanjiang-li","given":"Sanjiang","family":"Li","affiliation":"a Centre for Quantum Software & Information , FEIT , University of Technology Sydney , Australia; b UTS-AMSS Joint Research Laboratory , AMSS , Chinese Academy of Sciences , China"},{"name":"Zhiguo Long","slug":"zhiguo-long","given":"Zhiguo","family":"Long","affiliation":"a Centre for Quantum Software & Information , FEIT , University of Technology Sydney , Australia"},{"name":"Weiming Liu","slug":"weiming-liu","given":"Weiming","family":"Liu","affiliation":"a Centre for Quantum Software & Information , FEIT , University of Technology Sydney , Australia"},{"name":"Matt Duckham","slug":"matt-duckham","given":"Matt","family":"Duckham","affiliation":"c School of Science , RMIT University , Australia"},{"name":"Alan Both","slug":"alan-both","given":"Alan","family":"Both","affiliation":"c School of Science , RMIT University , Australia"}],"abstract":"Redundancy checking is an important task in AI subfields such as knowledge representation and constraint solving. This paper considers redundant topological constraints, defined in the region connection calculus RCC8.  We say a constraint in  a set C of RCC8 constraints  is redundant if it is entailed by the rest of C. A prime subnetwork of C is a subset of C which contains no redundant constraints and has the same solution set as C. It is natural to ask how to compute such a prime subnetwork, and when it is unique. While this problem is in general intractable, we show that, if S is a subalgebra of RCC8 in which weak composition distributes over nonempty intersections, then C has a unique prime subnetwork, which can be obtained in cubic time by removing all redundant constraints simultaneously  from C. As a by-product, we show that any path-consistent network over such a distributive subalgebra is minimal.","doi":"10.24963/ijcai.2017/714","url":"https://ijcai.org/proceedings/2017/714","pdf":"https://ijcai.org/proceedings/2017/0714.pdf","markdown":"https://ijcai.org/proceedings/2017/714.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/714","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Journal track","track":"Journal track","number":714,"pages":{"first":5020,"last":5024},"keywords":["Knowledge Representation, Reasoning, and Logic: Geometric, Spatial, and Temporal Reasoning","Knowledge Representation, Reasoning, and Logic: Qualitative Reasoning","Knowledge Representation, Reasoning, and Logic: Common-Sense Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Allen, 1983] James F. Allen. Maintaining knowledge about temporal intervals. Commun. ACM, 26(11):832-843, 1983.","title":"Maintaining knowledge about temporal intervals","authors":"James F Allen","year":"1983","venue":"Commun. ACM","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Belov et al., 2012] Anton Belov, Mikolás Janota, Inês Lynce, and João Marques-Silva. On computing minimal equivalent subformulas. In Milano [2012], pages 158-174.","title":"On computing minimal equivalent subformulas","authors":"Anton Belov, Mikolás Janota, Inês Lynce, João Marques-Silva","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bliek and Sam-Haroud, 1999] Christian Bliek and Djamila Sam-Haroud. Path consistency on triangulated constraint graphs. In IJCAI, pages 456-461, 1999.","title":"Christian Bliek and Djamila Sam-Haroud. Path consistency on triangulated constraint graphs","authors":"Sam-Haroud Bliek","year":"1999","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chandra and Pujari, 2005] Priti Chandra and Arun K. Pu- jari. Minimality and convexity properties in spatial CSPs. In ICTAI, pages 589-593. IEEE Computer Society, 2005.","title":"Minimality and convexity properties in spatial CSPs","authors":"Priti Chandra, Arun K Pujari","year":"2005","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dechter et al., 1991] Rina Dechter, Itay Meiri, and Judea Pearl. Temporal constraint networks. Artif. Intell., 49(1- 3):61-95, 1991.","title":"Temporal constraint networks","authors":"Rina Dechter, Itay Meiri, Judea Pearl","year":"1991","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Düntsch et al., 2001] Ivo Düntsch, Hui Wang, and Stephen McCloskey. A relation -algebraic approach to the region connection calculus. Theor. Comput. Sci., 255(1-2):63-83, 2001.","title":"A relation -algebraic approach to the region connection calculus","authors":"Ivo Düntsch, Hui Wang, Stephen Mccloskey","year":"2001","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Jonsson and Drakengren, 1997] Peter Jonsson and Thomas Drakengren. A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research, 6, 1997.","title":"A complete classification of tractability in RCC-5","authors":"Jonsson, Drakengren, Peter Jonsson, Thomas Drakengren","year":"1997","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Lee et al., 2016] Jae Hee Lee, Sanjiang Li, Zhiguo Long, and Michael Sioutis. On redundancy in simple temporal networks. In ECAI 2016 -22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands -Including Prestigious Applica- tions of Artificial Intelligence (PAIS 2016), pages 828- 836, 2016.","title":"On redundancy in simple temporal networks","authors":"Jae Hee, Lee, Sanjiang Li, Zhiguo Long, Michael Sioutis","year":"2016","venue":"The Netherlands -Including Prestigious Applications of Artificial Intelligence (PAIS 2016)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Li and Ying, 2003] Sanjiang Li and Mingsheng Ying. Re- gion connection calculus: Its models and composition ta- ble. Artif. Intell., 145(1-2):121-146, 2003.","title":"Region connection calculus: Its models and composition table","authors":"Ying ; ] Sanjiang Li, Mingsheng Li, Ying","year":"2003","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Liberatore, 2005] Paolo Liberatore. Redundancy in logic I: CNF propositional formulae. Artif. Intell., 163(2):203- 232, 2005.","title":"Redundancy in logic I: CNF propositional formulae","authors":"Paolo Liberatore","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Ligozat and Renz, 2004] Gérard Ligozat and Jochen Renz. What is a qualitative calculus? A general framework. In Chengqi Zhang, Hans W. Guesgen, and Wai-Kiang Yeap, editors, PRICAI, volume 3157 of Lecture Notes in Com- puter Science, pages 53-64. Springer, 2004.","title":"What is a qualitative calculus? A general framework","authors":"Renz Ligozat, Gérard Ligozat, Jochen Renz","year":"2004","venue":"PRICAI","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Liu and Li, 2012] Weiming Liu and Sanjiang Li. Solving minimal constraint networks in qualitative spatial and tem- poral reasoning. In Milano [2012], pages 464-479.","title":"Solving minimal constraint networks in qualitative spatial and temporal reasoning","authors":"Li ; ] Weiming Liu, Sanjiang Liu, Li","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Long and Li, 2015] Zhiguo Long and Sanjiang Li. On dis- tributive subalgebras of qualitative spatial and temporal calculi. In Spatial Information Theory -12th International Conference, COSIT 2015, Santa Fe, NM, USA, October 12-16, 2015, Proceedings, pages 354-374, 2015.","title":"On distributive subalgebras of qualitative spatial and temporal calculi","authors":"Li ; Long, Zhiguo Long, Sanjiang Li","year":"2015","venue":"Spatial Information Theory -12th International Conference, COSIT 2015","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Michela Milano, editor. Principles and Prac- tice of Constraint Programming -18th International Con- ference, CP 2012, Québec City, QC, Canada, October 8- 12, 2012. Proceedings, volume 7514 of Lecture Notes in Computer Science. Springer, 2012.","title":"Principles and Practice of Constraint Programming -18th International Conference, CP 2012","authors":null,"year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Randell et al., 1992] David A. Randell, Zhan Cui, and An- thony G. Cohn. A spatial logic based on regions and con- nection. In Bernhard Nebel, Charles Rich, and William R. Swartout, editors, KR, pages 165-176.","title":"A spatial logic based on regions and connection","authors":"David A Randell, Zhan Cui, Anthony G Cohn","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Morgan Kaufmann, 1992.","title":null,"authors":"Morgan Kaufmann","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Renz and Nebel, 1997] Jochen Renz and Bernhard Nebel. On the complexity of qualitative spatial reasoning: A max- imal tractable fragment of the region connection calculus. In IJCAI (1), pages 522-527.","title":"On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus","authors":"Nebel Renz, Jochen Renz, Bernhard Nebel","year":"1997","venue":"IJCAI (1)","doi":null,"url":null,"internal_url":"/proceedings/1997/77"},{"position":18,"raw":"Morgan Kaufmann, 1997.","title":null,"authors":"Morgan Kaufmann","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Renz, 1999] Jochen Renz. Maximal tractable fragments of the region connection calculus: A complete analysis. In Thomas Dean, editor, IJCAI, pages 448-455.","title":"Maximal tractable fragments of the region connection calculus: A complete analysis","authors":"Jochen Renz, Renz","year":"1999","venue":null,"doi":null,"url":null,"internal_url":"/proceedings/1999/65"},{"position":20,"raw":"Morgan Kaufmann, 1999.","title":null,"authors":"Morgan Kaufmann","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Sioutis et al., 2015] Michael Sioutis, Sanjiang Li, and Jean- François Condotta. Efficiently characterizing non- redundant constraints in large real world qualitative spa- tial networks. In Proceedings of the Twenty-Fourth Inter- national Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 3229-3235, 2015.","title":"Efficiently characterizing nonredundant constraints in large real world qualitative spatial networks","authors":"Michael Sioutis, Sanjiang Li, Jean-François Condotta","year":"2015","venue":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Wallgrün, 2012] Jan Oliver Wallgrün. Exploiting qualita- tive spatial reasoning for topological adjustment of spatial data. In Isabel F. Cruz, Craig A. Knoblock, Peer Kröger, Egemen Tanin, and Peter Widmayer, editors, SIGSPA- TIAL/GIS, pages 229-238. ACM, 2012.","title":"Exploiting qualitative spatial reasoning for topological adjustment of spatial data","authors":"Jan Oliver, Wallgrün","year":"2012","venue":"SIGSPA-TIAL/GIS","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}