{"type":"ScholarlyArticle","title":"Efficiently Enforcing Path Consistency on Qualitative Constraint Networks by Use of Abstraction","authors":[{"name":"Michael Sioutis","slug":"michael-sioutis","given":"Michael","family":"Sioutis","affiliation":"Université d'Artois , CRIL-CNRS UMR 8188 , Lens , France"},{"name":"Jean-François Condotta","slug":"jean-francois-condotta","given":"Jean-François","family":"Condotta","affiliation":"Université d'Artois , CRIL-CNRS UMR 8188 , Lens , France"}],"abstract":"Partial closure under weak composition, or partial weak path-consistency for short, is essential for tackling fundamental reasoning problems associated with qualitative constraint networks, such as the satisfiability checking problem, and therefore it is crucial to be able to enforce it as fast as possible. To this end, we propose a new algorithm, called PWCα, for efficiently enforcing partial weak path-consistency on qualitative constraint networks, that exploits the notion of abstraction for qualitative constraint networks, utilizes certain properties of partial weak path-consistency,and adapts the functionalities of some state-of-the-art algorithms to its design. It is worth noting that, as opposed to a related approach in the recent literature, algorithm PWCα is complete for arbitrary qualitative constraint networks. The evaluation that we conducted with qualitative constraint networks of the Region Connection Calculus against a competing state-of-the-art generic algorithm for enforcing partial weak path-consistency, demonstrates the usefulness and efficiency of algorithm PWCα.","doi":"10.24963/ijcai.2017/175","url":"https://ijcai.org/proceedings/2017/175","pdf":"https://ijcai.org/proceedings/2017/0175.pdf","markdown":"https://ijcai.org/proceedings/2017/175.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/175","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":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":175,"pages":{"first":1262,"last":1268},"keywords":["Knowledge Representation, Reasoning, and Logic: Geometric, Spatial, and Temporal Reasoning","Knowledge Representation, Reasoning, and Logic: Qualitative Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Allen, 1983] James F. Allen. Maintaining Knowledge about Temporal Intervals. Commun. ACM, 26: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":"[Amaneddine et al., 2013] Nouhad Amaneddine, Jean- Franc ¸ois Condotta, and Michael Sioutis. Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints. In IJCAI, 2013.","title":"Nouhad Amaneddine, Jean-Franc ¸ois Condotta, and Michael Sioutis. Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints","authors":"Amaneddine","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Balbiani et al., 2002] Philippe Balbiani, Jean-Franc ¸ois Condotta, and Luis Fariñas del Cerro. Tractability Results in the Block Algebra. J. Log. Comput., 12:885-909, 2002.","title":"Tractability Results in the Block Algebra","authors":"Balbiani","year":"2002","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Barabasi and Albert, 1999] A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509-512, 1999.","title":"Emergence of scaling in random networks","authors":"A.-L Barabasi, R Albert","year":"1999","venue":"Science","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bhatt et al., 2011] Mehul Bhatt, Hans W. Guesgen, Stefan Wölfl, and Shyamanta Moni Hazarika. Qualitative Spatial and Temporal Reasoning: Emerging Applications, Trends, and Directions. Spatial Cognition & Computation, 11:1- 14, 2011.","title":"Qualitative Spatial and Temporal Reasoning: Emerging Applications, Trends, and Directions","authors":"Mehul Bhatt, Hans W Guesgen, Stefan Wölfl, Shyamanta Moni, Hazarika","year":"2011","venue":"Spatial Cognition & Computation","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chmeiss and Condotta, 2011] Assef Chmeiss and Jean- Francois Condotta. Consistency of Triangulated Temporal Qualitative Constraint Networks. In ICTAI, 2011.","title":"Consistency of Triangulated Temporal Qualitative Constraint Networks","authors":"Condotta Chmeiss","year":"2011","venue":"ICTAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Cousot and Cousot, 1992] Patrick Cousot and Radhia Cousot. Abstract Interpretation Frameworks. J. Log. Comput., 2:511-547, 1992.","title":"Abstract Interpretation Frameworks","authors":"Cousot Cousot, Patrick Cousot, Radhia Cousot","year":"1992","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dylla et al., 2013] Frank Dylla, Till Mossakowski, Thomas Schneider, and Diedrich Wolter. Algebraic Properties of Qualitative Spatio-Temporal Calculi. In COSIT, 2013.","title":"Algebraic Properties of Qualitative Spatio-Temporal Calculi","authors":"Frank Dylla, Till Mossakowski, Thomas Schneider, Diedrich Wolter","year":"2013","venue":"COSIT","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Frank, 1991] Andrew U. Frank. Qualitative Spatial Reason- ing with Cardinal Directions. In ÖGAI, 1991.","title":"Qualitative Spatial Reasoning with Cardinal Directions","authors":"Andrew U Frank","year":"1991","venue":"ÖGAI","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Gantner et al., 2008] Zeno Gantner, Matthias Westphal, and Stefan Wölfl. GQR-A Fast Reasoner for Binary Qualita- tive Constraint Calculi. In AAAI Workshop on Spatial and Temporal Reasoning, 2008.","title":"GQR-A Fast Reasoner for Binary Qualitative Constraint Calculi","authors":"Zeno Gantner, Matthias Westphal, Stefan Wölfl","year":"2008","venue":"AAAI Workshop on Spatial and Temporal Reasoning","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gerevini, 2005] Alfonso Gerevini. Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ord-horn class. Artif. Intell., 166(1-2):37-80, 2005.","title":"Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ord-horn class","authors":"Alfonso Gerevini","year":"2005","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Golumbic and Shamir, 1993] Martin Charles Golumbic and Ron Shamir. Complexity and Algorithms for Reason- ing about Time: A Graph-Theoretic Approach. J. ACM, 40:1108-1133, 1993.","title":"Complexity and Algorithms for Reasoning about Time: A Graph-Theoretic Approach","authors":"Shamir ; Golumbic, Charles Martin, Ron Golumbic, Shamir","year":"1993","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Huang, 2012] Jinbo Huang. Compactness and its implica- tions for qualitative spatial and temporal reasoning. In KR, 2012.","title":"Compactness and its implications for qualitative spatial and temporal reasoning","authors":"Jinbo Huang","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Li et al., 2015] Sanjiang Li, Zhiguo Long, Weiming Liu, Matt Duckham, and Alan Both. On redundant topologi- cal constraints. Artif. Intell., 225:51-76, 2015.","title":"On redundant topological constraints","authors":"Sanjiang Li, Zhiguo Long, Weiming Liu, Matt Duckham, Alan Both","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Ligozat and Renz, 2004] Gérard Ligozat and Jochen Renz. What Is a Qualitative Calculus? A General Framework. In PRICAI, 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":16,"raw":"[Ligozat, 1998] Gerard Ligozat. Reasoning about cardinal directions. J. Vis. Lang. Comput., 9:23-44, 1998.","title":"Reasoning about cardinal directions","authors":"Gerard Ligozat","year":"1998","venue":"J. Vis. Lang. Comput","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Long and Li, 2015] Zhiguo Long and Sanjiang Li. On Dis- tributive Subalgebras of Qualitative Spatial and Temporal Calculi. In COSIT, 2015.","title":"On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi","authors":"Li ; Long, Zhiguo Long, Sanjiang Li","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Long et al., 2016] Zhiguo Long, Michael Sioutis, and San- jiang Li. Efficient Path Consistency Algorithm for Large Qualitative Constraint Networks. In IJCAI, 2016.","title":"Efficient Path Consistency Algorithm for Large Qualitative Constraint Networks","authors":"Long","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/174"},{"position":19,"raw":"[Nebel, 1997] Bernhard Nebel. Solving Hard Qualitative Temporal Reasoning Problems: Evaluating the Efficiency of Using the ORD-Horn Class. Constraints, 1:175-190, 1997.","title":"Solving Hard Qualitative Temporal Reasoning Problems: Evaluating the Efficiency of Using the ORD-Horn Class","authors":"Bernhard Nebel","year":"1997","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Randell et al., 1992] David A. Randell, Zhan Cui, and An- thony Cohn. A Spatial Logic Based on Regions & Con- nection. In KR, 1992.","title":"A Spatial Logic Based on Regions & Connection","authors":"David A Randell, Zhan Cui, Anthony Cohn","year":"1992","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Renz and Ligozat, 2005] Jochen Renz and Gérard Ligozat. Weak Composition for Qualitative Spatial and Temporal Reasoning. In CP, 2005.","title":"Weak Composition for Qualitative Spatial and Temporal Reasoning","authors":"Ligozat Renz, Jochen Renz, Gérard Ligozat","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Renz and Nebel, 2001] Jochen Renz and Bernhard Nebel. Efficient Methods for Qualitative Spatial Reasoning. J. Artif. Intell. Res., 15:289-318, 2001.","title":"Efficient Methods for Qualitative Spatial Reasoning","authors":"Nebel Renz, Jochen Renz, Bernhard Nebel","year":"2001","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Renz and Nebel, 2007] Jochen Renz and Bernhard Nebel. Qualitative Spatial Reasoning Using Constraint Calculi. In Handbook of Spatial Logics, pages 161-215. 2007.","title":"Qualitative Spatial Reasoning Using Constraint Calculi","authors":"Nebel Renz, Jochen Renz, Bernhard Nebel","year":"2007","venue":"Handbook of Spatial Logics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Renz, 2002] Jochen Renz. A Canonical Model of the Re- gion Connection Calculus. J. Appl. Non-Classical Logics, 12:469-494, 2002.","title":"A Canonical Model of the Region Connection Calculus","authors":"Jochen Renz, Renz","year":"2002","venue":"J. Appl. Non-Classical Logics","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Sioutis et al., 2015] Michael Sioutis, Sanjiang Li, and Jean- Franc ¸ois Condotta. Efficiently Characterizing Non- Redundant Constraints in Large Real World Qualitative Spatial Networks. In IJCAI, 2015.","title":"Efficiently Characterizing Non-Redundant Constraints in Large Real World Qualitative Spatial Networks","authors":"Michael Sioutis, Sanjiang Li, Jean-Franc ¸ois Condotta","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/455"},{"position":26,"raw":"[Sioutis et al., 2016a] M. Sioutis, Z. Long, and S. Li. Ef- ficiently Reasoning about Qualitative Constraints through Variable Elimination. In SETN, 2016.","title":"Efficiently Reasoning about Qualitative Constraints through Variable Elimination","authors":"Sioutis","year":"2016","venue":"SETN","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Sioutis et al., 2016b] Michael Sioutis, Jean-Franc ¸ois Con- dotta, and Manolis Koubarakis. An Efficient Approach for Tackling Large Real World Qualitative Spatial Networks. Int. J. Artif. Intell. Tools, 25:1-33, 2016.","title":"An Efficient Approach for Tackling Large Real World Qualitative Spatial Networks","authors":"Sioutis","year":"2016","venue":"Int. J. Artif. Intell. Tools","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Sioutis et al., 2016c] Michael Sioutis, Yakoub Salhi, and Jean-Franc ¸ois Condotta. Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning. Knowl. Eng. Rev., 32:e4, 2016.","title":"Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning","authors":"Sioutis","year":"2016","venue":"Knowl. Eng. Rev","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Tarjan and Yannakakis, 1984] R. E. Tarjan and M. Yan- nakakis. Simple Linear-Time Algorithms to Test Chordal- ity of Graphs, Test Acyclicity of Hypergraphs, and Selec- tively Reduce Acyclic Hypergraphs. SIAM J. Comput., 13:566-579, 1984.","title":"Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs","authors":"R E Tarjan, M Yannakakis","year":"1984","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Tarski, 1941] Alfred Tarski. On the calculus of relations. J. Symb. Log., 6:73-89, 1941.","title":"Alfred Tarski. On the calculus of relations","authors":"Tarski","year":"1941","venue":"J. Symb. Log","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Vilain and Kautz, 1986] Marc B. Vilain and Henry A. Kautz. Constraint Propagation Algorithms for Temporal Reasoning. In AAAI, 1986.","title":"Constraint Propagation Algorithms for Temporal Reasoning","authors":"Marc B Vilain, Henry A Kautz","year":"1986","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Westphal et al., 2009] Matthias Westphal, Stefan Wölfl, and Zeno Gantner. GQR: A Fast Solver for Binary Qualita- tive Constraint Networks. In AAAI Spring Symposium on Benchmarking of QSTR Systems, 2009.","title":"GQR: A Fast Solver for Binary Qualitative Constraint Networks","authors":"Matthias Westphal, Stefan Wölfl, Zeno Gantner","year":"2009","venue":"AAAI Spring Symposium on Benchmarking of QSTR Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}