{"type":"ScholarlyArticle","title":"A Fast Algorithm for Consistency Checking Partially Ordered Time","authors":[{"name":"Leif Eriksson","slug":"leif-eriksson","given":"Leif","family":"Eriksson","affiliation":"Department of Computer and Information Science , Linköping University , Linköping , Sweden"},{"name":"Victor Lagerkvist","slug":"victor-lagerkvist","given":"Victor","family":"Lagerkvist","affiliation":"Department of Computer and Information Science , Linköping University , Linköping , Sweden"}],"abstract":"Partially ordered models of time occur naturally in applications where agents/processes cannot perfectly communicate with each other, and can be traced back to the seminal work of Lamport. In this paper we consider the problem of deciding if a (likely incomplete) description of a system of events is consistent, the network consistency problem for the point algebra of partially ordered time (POT). While the classical complexity of this problem has been fully settled, comparably little is known of the fine-grained complexity of POT except that it can\r\nbe solved in O*((0.368n)^n) time by enumerating ordered partitions. We construct a much faster algorithm with a run-time bounded by O*((0.26n)^n), which, e.g., is roughly 1000 times faster than the naive enumeration algorithm in a problem with 20 events. This is achieved by a sophisticated enumeration of structures similar to total orders, which are then greedily expanded toward a solution. While similar ideas have been explored earlier for related problems it turns out that the analysis for POT is non-trivial and requires significant new ideas.","doi":"10.24963/ijcai.2023/212","url":"https://ijcai.org/proceedings/2023/212","pdf":"https://ijcai.org/proceedings/2023/0212.pdf","markdown":"https://ijcai.org/proceedings/2023/212.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/212","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Constraint Satisfaction and Optimization","track":"Main Track","number":212,"pages":{"first":1911,"last":1918},"keywords":["Knowledge Representation and Reasoning: KRR: Qualitative, geometric, spatial, and temporal reasoning","Constraint Satisfaction and Optimization: CSO: Constraint satisfaction"],"videos":[],"references":[{"position":1,"raw":"[Allen et al., 2014] James F. Allen, Henry A. Kautz, Richard N. Pelavin, and Josh D. Tenenberg. Reasoning About Plans. Elsevier Science, 2014.","title":"Reasoning About Plans","authors":"James F Allen, Henry A Kautz, Richard N Pelavin, Josh D Tenenberg","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Allen, 1984] James F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23(2):123-154, 1984.","title":"Towards a general theory of action and time","authors":"James F Allen","year":"1984","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Allen, 1991] James F. Allen. Planning as temporal reason- ing. In James F. Allen, Richard Fikes, and Erik Sandewall, editors, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-1991). Cambridge, MA, USA, April 22-25, 1991, pages 3-14.","title":"Planning as temporal reasoning","authors":"James F Allen","year":"1991","venue":"Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-1991)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Morgan Kaufmann, 1991. [Anger et al., 1999]","title":null,"authors":"Morgan Kaufmann, ;","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Frank D. Anger, Debasis Mitra, and Rita V. Rodríguez. Satisfiability in nonlinear time: Al- gorithms and complexity. In Proceedings of the 12th In- ternational Florida Artificial Intelligence Research Society Conference (FLAIRS-1999), pages 406-411, 1999.","title":"Satisfiability in nonlinear time: Algorithms and complexity","authors":"D Frank, Debasis Anger, Rita V Mitra, Rodríguez","year":"1999","venue":"Proceedings of the 12th International Florida Artificial Intelligence Research Society Conference (FLAIRS-1999)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Anger, 1989] Frank D. Anger. On lamport's interprocessor communication model. ACM Transactions on Program- ming Languages and Systems, 11(3):404-417, 7 1989.","title":"On lamport's interprocessor communication model","authors":"D Frank, Anger","year":"1989","venue":"ACM Transactions on Programming Languages and Systems","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bodirsky and Jonsson, 2017] Manuel Bodirsky and Peter Jonsson. A model-theoretic view on qualitative constraint reasoning. Journal of Artificial Intelligence Research (JAIR), 58:339-385, 2017.","title":"Manuel Bodirsky and Peter Jonsson. A model-theoretic view on qualitative constraint reasoning","authors":"Jonsson Bodirsky","year":"2017","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Bodirsky, 2021] Manuel Bodirsky. Complexity of Infinite- Domain Constraint Satisfaction. Cambridge University Press, 2021. Preprint available from https://www.math.tu- dresden.de/∼bodirsky/Book.pdf.","title":"Complexity of Infinite-Domain Constraint Satisfaction","authors":"Manuel Bodirsky","year":"2021","venue":null,"doi":null,"url":"https://www.math.tu-dresden.de/∼bodirsky/Book.pdf","internal_url":null},{"position":9,"raw":"[Broxvall and Jonsson, 2003] Mathias Broxvall and Peter Jonsson. Point algebras for temporal reasoning: Algorithms and complexity. Artificial Intelligence, 149(2):179-220, 2003.","title":"Point algebras for temporal reasoning: Algorithms and complexity","authors":"Jonsson Broxvall, Mathias Broxvall, Peter Jonsson","year":"2003","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dabrowski et al., 2020] Konrad K. Dabrowski, Peter Jons- son, Sebastian Ordyniak, and George Osipov. Fine-grained complexity of temporal problems. In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR-2020), pages 284-293, 2020.","title":"Fine-grained complexity of temporal problems","authors":"Konrad K Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov","year":"2020","venue":"Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR-2020)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dylla et al., 2017] Frank Dylla, Jae H. Lee, Till Mossakowski, Thomas Schneider, André V. Delden, Jasper V. D. Ven, and Diedrich Wolter. A survey of qualitative spatial and temporal calculi: Algebraic and computational properties. ACM Computing Surveys (CSUR), 50(1):7:1-7:39, April 2017.","title":"A survey of qualitative spatial and temporal calculi: Algebraic and computational properties","authors":"Frank Dylla, Jae H Lee, Till Mossakowski, Thomas Schneider, André V Delden, V D Jasper, Diedrich Ven, Wolter","year":"2017","venue":"ACM Computing Surveys (CSUR)","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Eriksson and Lagerkvist, 2021] Leif Eriksson and Victor Lagerkvist. Improved algorithms for Allen's interval alge- bra: a dynamic programming approach. In Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-2021), pages 1873-1879, 2021.","title":"Improved algorithms for Allen's interval algebra: a dynamic programming approach","authors":"Lagerkvist Eriksson, Leif Eriksson, Victor Lagerkvist","year":"2021","venue":"Proceedings of the 30th International Joint Conference on Artificial Intelligence (IJCAI-2021)","doi":null,"url":null,"internal_url":"/proceedings/2021/258"},{"position":13,"raw":"[Eriksson and Lagerkvist, 2022] Leif Eriksson and Victor Lagerkvist. A multivariate complexity analysis of qualita- tive reasoning problems. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22, pages 1804-1810. International Joint Confer- ences on Artificial Intelligence Organization, 7 2022. Main Track.","title":"A multivariate complexity analysis of qualitative reasoning problems","authors":"Lagerkvist Eriksson, Leif Eriksson, Victor Lagerkvist","year":"2022","venue":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI-22","doi":null,"url":null,"internal_url":"/proceedings/2022/251"},{"position":14,"raw":"[Forbus, 2019] K.D. Forbus. Qualitative Representations: How People Reason and Learn about the Continuous World. MIT Press, 2019.","title":"Qualitative Representations: How People Reason and Learn about the Continuous World","authors":"K D Forbus","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jonsson and Lagerkvist, 2017] Peter Jonsson and Victor Lagerkvist. An initial study of time complexity in infinite- domain constraint satisfaction. Artificial Intelligence, 245:115-133, 2017.","title":"An initial study of time complexity in infinitedomain constraint satisfaction","authors":"Jonsson, Lagerkvist, Peter Jonsson, Victor Lagerkvist","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jonsson et al., 2021] Peter Jonsson, Victor Lagerkvist, and George Osipov. Acyclic orders, partition schemes and csps: Unified hardness proofs and improved algorithms. Artificial Intelligence, 296:103505, 2021.","title":"Acyclic orders, partition schemes and csps: Unified hardness proofs and improved algorithms","authors":"Jonsson","year":"2021","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Kompatscher and Pham, 2017] Michael Kompatscher and Van T. Pham. A complexity dichotomy for poset constraint satisfaction. In Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, (STACS-2017), volume 66 of LIPIcs, pages 47:1-47:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","title":"A complexity dichotomy for poset constraint satisfaction","authors":"Michael Kompatscher, T Van, Pham","year":"2017","venue":"Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Ladkin and Maddux, 1994] Peter B. Ladkin and Roger D. Maddux. On binary constraint problems. Journal of the ACM, 41(3):435-469, 1994.","title":"On binary constraint problems","authors":"Peter B Ladkin, Roger D Maddux","year":"1994","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lamport, 1986] Leslie Lamport. The mutual exclusion prob- lem: Part i-a theory of interprocess communication. J. ACM, 33(2):313-326, 4 1986.","title":"The mutual exclusion problem: Part i-a theory of interprocess communication","authors":"Leslie Lamport","year":"1986","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Nogueira et al., 1996] José Helano Matos Nogueira, Anto- nio L. Furtado, and José de Jesús Pérez Alcázar. A hybrid formal theory of plan recognition and its implementation. In Proceedings of the 13th Brazilian Symposium on Arti- ficial Intelligence, (SBIA-1996), volume 1159 of Lecture Notes in Computer Science, pages 31-40. Springer, 1996.","title":"José Helano Matos Nogueira, Antonio L. Furtado, and José de Jesús Pérez Alcázar. A hybrid formal theory of plan recognition and its implementation","authors":"Nogueira","year":"1996","venue":"Proceedings of the 13th Brazilian Symposium on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Song and Cohen, 1988] Fei Song and Robin Cohen. The interpretation of temporal relations in narrative. In Pro- ceedings of the 7th National Conference on Artificial Intel- ligence (AAAI-1998), pages 745-750, 01 1988.","title":"Fei Song and Robin Cohen. The interpretation of temporal relations in narrative","authors":"Cohen Song","year":"1988","venue":"Proceedings of the 7th National Conference on Artificial Intelligence (AAAI-1998)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Song and Cohen, 1996] Fei Song and Robin Cohen. A strengthened algorithm for temporal reasoning about plans. Computational Intelligence, 12:331-356, 1996.","title":"Fei Song and Robin Cohen. A strengthened algorithm for temporal reasoning about plans","authors":"Cohen Song","year":"1996","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}