{"type":"ScholarlyArticle","title":"KSP: A Resolution-based Prover for Multimodal K, Abridged Report","authors":[{"name":"Cláudia Nalon","slug":"claudia-nalon","given":"Cláudia","family":"Nalon","affiliation":"Department of Computer Science University of Brasília"},{"name":"Ullrich Hustadt","slug":"ullrich-hustadt","given":"Ullrich","family":"Hustadt","affiliation":"Department of Computer Science University of Liverpool"},{"name":"Clare Dixon","slug":"clare-dixon","given":"Clare","family":"Dixon","affiliation":"Department of Computer Science University of Liverpool"}],"abstract":"In this paper, we briefly describe an implementation of a hyper-resolution-based calculus for the propositional basic multimodal logic, Kn. The prover, KSP,  is designed to support experimentation with different combinations of refinements for its basic calculus. The prover allows for both local and global reasoning. We present an experimental evaluation that compares KSP with a range of existing reasoners for Kn.","doi":"10.24963/ijcai.2017/694","url":"https://ijcai.org/proceedings/2017/694","pdf":"https://ijcai.org/proceedings/2017/0694.pdf","markdown":"https://ijcai.org/proceedings/2017/694.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/694","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":"Best Sister Conferences","track":"Best Sister Conferences","number":694,"pages":{"first":4919,"last":4923},"keywords":["Artificial Intelligence: knowledge representation and reasoning"],"videos":[],"references":[{"position":1,"raw":"[Areces et al., 1999] Carlos Areces, Hans de Nivelle, and Maarten de Rijke. Prefixed Resolution: A Resolution Method for Modal and Description Logics. In Proc. of CADE-16, volume 1632 of LNAI, pages 187-201. Springer, 1999.","title":"Prefixed Resolution: A Resolution Method for Modal and Description Logics","authors":"Carlos Areces, Hans De Nivelle, Maarten De Rijke","year":"1999","venue":"Proc. of CADE-16","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Areces et al., 2000] Carlos Areces, Rosella Gennari, Juan Heguiabehere, and Maarten de Rijke. Tree-based heuris- tics in modal theorem proving. In Proc. of ECAI 2000, pages 199-203. IOS Press, 2000.","title":"Tree-based heuristics in modal theorem proving","authors":"Carlos Areces, Rosella Gennari, Juan Heguiabehere, Maarten De Rijke","year":"2000","venue":"Proc. of ECAI 2000","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Balsiger et al., 2000] Peter Balsiger, Alain Heuerding, and Stefan Schwendimann. A benchmark method for the propositional modal logics K, KT, S4. Journal of Auto- mated Reasoning, 24(3):297-317, 2000.","title":"A benchmark method for the propositional modal logics K, KT, S4","authors":"Peter Balsiger, Alain Heuerding, Stefan Schwendimann","year":"2000","venue":"Journal of Automated Reasoning","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Goranko and Passy, 1992] Valentin Goranko and Solomon Passy. Using the universal modality: gains and questions. Journal of Logic and Computation, 2(1):5-30, 1992.","title":"Using the universal modality: gains and questions","authors":"Valentin Goranko, Solomon Passy","year":"1992","venue":"Journal of Logic and Computation","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Goré et al., 2014] Rajeev Goré, Kerry Olesen, and Jimmy Thomson. Implementing tableau calculi using BDDs: BD- DTab system description. In Proc. of IJCAR 2014, volume 8562 of LNCS, pages 337-343. Springer, 2014.","title":"Implementing tableau calculi using BDDs: BD-DTab system description","authors":"Rajeev Goré, Kerry Olesen, Jimmy Thomson","year":"2014","venue":"Proc. of IJCAR 2014","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Götzmann et al., 2010] Daniel Götzmann, Mark Kaminski, and Gert Smolka. Spartacus: A tableau prover for hybrid logic. ENTCS, 262:127-139, 2010.","title":"Spartacus: A tableau prover for hybrid logic","authors":"Mark Daniel Götzmann, Gert Kaminski, Smolka","year":"2010","venue":"ENTCS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Hailpern, 1982] Brent T. Hailpern. Verifying Concurrent Processes Using Temporal Logic, volume 129 of LNCS. Springer, 1982.","title":"Verifying Concurrent Processes Using Temporal Logic","authors":"T Brent, Hailpern","year":"1982","venue":"LNCS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Halpern and Moses, 1992] Joseph Y. Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319-379, April 1992.","title":"A guide to completeness and complexity for modal logics of knowledge and belief","authors":"Joseph Y Halpern, Yoram Moses","year":"1992","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Halpern et al., 1983] Joseph Y. Halpern, Zohar Manna, and Ben Moszkowski. A Hardware Semantics Based on Tem- poral Intervals. In Proc. of ICALP 1983, volume 154, pages 278-291, 1983.","title":"A Hardware Semantics Based on Temporal Intervals","authors":"Joseph Y Halpern, Zohar Manna, Ben Moszkowski","year":"1983","venue":"Proc. of ICALP 1983","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Halpern, 1987] Joseph Y. Halpern. Using Reasoning about Knowledge to Analyze Distributed Systems. Annual Re- view of Computer Science, 2, 1987.","title":"Using Reasoning about Knowledge to Analyze Distributed Systems","authors":"Y Joseph, Halpern","year":"1987","venue":"Annual Review of Computer Science","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Horrocks et al., 2006] Ian R. Horrocks, Ullrich Hustadt, Ul- rike Sattler, and Renate Schmidt. Computational modal logic. In Handbook of Modal Logic, pages 181-245. Else- vier, 2006.","title":"Computational modal logic","authors":"Ian R Horrocks, Ullrich Hustadt, Ulrike Sattler, Renate Schmidt","year":"2006","venue":"Handbook of Modal Logic","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kaminski and Tebbi, 2013] Mark Kaminski and Tobias Tebbi. InKreSAT: Modal reasoning via incremental reduc- tion to SAT. In Proc. of CADE-24, volume 7898 of LNAI, pages 436-442. Springer, 2013.","title":"InKreSAT: Modal reasoning via incremental reduction to SAT","authors":"Mark Kaminski, Tobias Tebbi","year":"2013","venue":"Proc. of CADE-24","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kovács and Voronkov, 2013] Laura Kovács and Andrei Voronkov. First-order theorem proving and Vampire. In Proc. of CAV 2013, volume 8044 of LNCS, pages 1-35. Springer, 2013.","title":"First-order theorem proving and Vampire","authors":"Laura Kovács, Andrei Voronkov","year":"2013","venue":"Proc. of CAV 2013","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Massacci and Donini, 2000] Fabio Massacci and Francesco M. Donini. Design and results of TANCS-2000 non-classical (modal) systems comparison. In Proc. of TABLEAUX 2000, volume 1847 of LNCS, pages 52-56. Springer, 2000.","title":"Design and results of TANCS-2000 non-classical (modal) systems comparison","authors":"Fabio Massacci, Francesco M Donini","year":"2000","venue":"Proc. of TABLEAUX 2000","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[McCune, 2007] William W. McCune. OTTER 3.0 reference manual and guide, May 07 2007.","title":"OTTER 3.0 reference manual and guide","authors":"William W Mccune","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Nalon et al., 2015] Cláudia Nalon, Ullrich Hustadt, and Clare Dixon. A modal-layered resolution calculus for K. In Proc. of TABLEAUX 2015, volume 9323 of LNCS, pages 185-200. Springer, 2015.","title":"A modal-layered resolution calculus for K","authors":"Cláudia Nalon, Ullrich Hustadt, Clare Dixon","year":"2015","venue":"Proc. of TABLEAUX 2015","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Nalon et al., 2016a] Cláudia Nalon, Ullrich Hustadt, and Clare Dixon. K S P: A resolution-based prover for multi- modal K. In Proc. of IJCAR 2016, volume 9706 of LNCS, pages 406-415. Springer, 2016.","title":"A resolution-based prover for multimodal K","authors":"Nalon","year":"2016","venue":"Proc. of IJCAR 2016","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Nalon et al., 2016b] Cláudia Nalon, Ullrich Hustadt, and Clare Dixon. K S P: sources and benchmarks. http: //www.cic.unb.br/ ˜nalon/#software, 2016.","title":"K S P: sources and benchmarks","authors":"Nalon","year":"2016","venue":null,"doi":null,"url":"http://www.cic.unb.br/˜nalon/#software,2016","internal_url":null},{"position":19,"raw":"[Patel-Schneider and Sebastiani, 2003] Peter F. Patel- Schneider and Roberto Sebastiani. A new general method to generate random modal formulae for testing decision procedures. Journal of Artificial Intelligence Research (JAIR), 18:351-389, 2003.","title":"A new general method to generate random modal formulae for testing decision procedures","authors":"F Peter, Roberto Patel-Schneider, Sebastiani","year":"2003","venue":"Journal of Artificial Intelligence Research (JAIR)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Pratt, 1980] Vaughan R. Pratt. Application of modal logic to programming. Studia Logica, 39(2/3):257-274, 1980.","title":"Application of modal logic to programming","authors":"R Vaughan, Pratt","year":"1980","venue":"Studia Logica","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Rao and Georgeff, 1991] Anand S. Rao and Michael P. Georgeff. Modeling Rational Agents within a BDI- Architecture. In Proc. of KR&R-91, pages 473-484, Cam- bridge, MA, USA, April 1991.","title":"Modeling Rational Agents within a BDI-Architecture","authors":"Anand S Rao, Michael P Georgeff","year":"1991","venue":"Proc. of KR&R-91","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Robinson, 1965] John A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, 12(1):23-41, January 1965.","title":"A Machine-Oriented Logic Based on the Resolution Principle","authors":"John A Robinson","year":"1965","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Schild, 1991] Klaus Schild. A Correspondence Theory for Terminological Logics. In Proc. of IJCAI'91, pages 466- 471. Springer, 1991.","title":"A Correspondence Theory for Terminological Logics","authors":"Klaus Schild, Schild","year":"1991","venue":"Proc. of IJCAI'91","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Schulz and Möhrmann, 2016] Stephan Schulz and Martin Möhrmann. Performance of clause selection heuristics for saturation-based theorem proving. In Proc. of IJCAR 2016, volume 9706 of LNCS, pages 330-345. Springer, 2016.","title":"Performance of clause selection heuristics for saturation-based theorem proving","authors":"Stephan Schulz, Martin Möhrmann","year":"2016","venue":"Proc. of IJCAR 2016","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Spaan, 1993] Edith Spaan. Complexity of Modal Logics. PhD thesis, University of Amsterdam, 1993.","title":"Complexity of Modal Logics","authors":"Spaan","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Tsarkov and Horrocks, 2006] Dmitry Tsarkov and Ian Hor- rocks. FaCT++ description logic reasoner: System de- scription. In Proc. of IJCAR 2006, volume 4130 of LNCS, pages 292-297. Springer, 2006.","title":"FaCT++ description logic reasoner: System description","authors":"Dmitry Tsarkov, Ian Horrocks","year":"2006","venue":"Proc. of IJCAR 2006","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Wos et al., 1965] Lawrence Wos, George A. Robinson, and Daniel F. Carson. Efficiency and Completeness of the Set of Support Strategy in Theorem Proving. Journal of the ACM, 12:536-541, 1965.","title":"Efficiency and Completeness of the Set of Support Strategy in Theorem Proving","authors":"Lawrence Wos, George A Robinson, Daniel F Carson","year":"1965","venue":"Journal of the ACM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}