{"type":"ScholarlyArticle","title":"Modal Theorem Proving: An Equational Viewpoint","authors":[{"name":"Yves Auffray","slug":"yves-auffray","given":"Yves","family":"Auffray","affiliation":"Societe des avions M. Dassault 78 quai Marcel Dassault 92210 Saint-Cloud - France"},{"name":"Patrice Enjalbert","slug":"patrice-enjalbert","given":"Patrice","family":"Enjalbert","affiliation":""}],"abstract":"We propose a new method for automated theorem proving in first order modal logic. Essentially, the method consists in a translation of modal logic into a specially designed typed first order logic cal led Path Logic, such that classical modal systems (first order Q, T, 04, S4, SS) can be characterized by sets of equations. The question of modal theorem proving then amounts to classical theorem proving in some equational theories. Different methods can be . investigated and in this paper we consider Resolution. We may use Resolution with Paramodulation, or a combination of Resolution and Rewriting techniques. In both cases, known results provide \"free of charge\" a framework immediately applicable to Path Logic, with completeness theorems. Considering efficiency, the R~writing method seems better and we present here in details its application to Path Logic. In particular we show how it is possible to define a special kind of skolemisation and design a unification algorithm which insures that two clauses will always have a finite set of resolvents.","doi":null,"url":"https://ijcai.org/proceedings/1989/71","pdf":"https://ijcai.org/proceedings/1989/0071.pdf","markdown":"https://ijcai.org/proceedings/1989/71.md","bibtex":"https://ijcai.org/proceedings/1989/bibtex/71","volume":{"slug":"1989","title":"Proceedings of the Eleventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1989","url":"https://ijcai.org/proceedings/1989/","year":1989,"location":"Detroit, Michigan, USA","dates":"August 20-25 1989","editors":"N. S. Sridharan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Deduction","track":"Automated Deduction","number":71,"pages":{"first":441,"last":444},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Manna 86","title":"Manna","authors":null,"year":null,"venue":"Manna","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"M. ~badi, Z. Manna. Modal theo- rem proving, Proc. 8t Internat. Conf. on Automa- ted Deduction : 1986, 172-189","title":"Modal theorem proving","authors":"M ~badi, Z Manna","year":"1986","venue":"Proc. 8t Internat. Conf. on Automated Deduction","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Y. Auffray : Resolution Modale et Logique des Chemins, these de 1 1 Universite de Caen, 1989","title":"Resolution Modale et Logique des Chemins, these de 1","authors":"Y Auffray","year":"1989","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Auffray, Enjalbert 88","title":"Enjalbert","authors":"Auffray","year":null,"venue":"Enjalbert","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Y. Auffray, P. Enjalbert Modal theorem proving using equational methods : technical Report n° 88~11, Laboratoire d'Informa- tique, Universite de Caen, 1988","title":"Enjalbert Modal theorem proving using equational methods","authors":"Y Auffray, P","year":"1988","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Cialdea","title":null,"authors":"Cialdea","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"M. Cialdea : Une methode de deduction automatique en logique modale, These de 1 1 Univer- site P. Sabatier, Toulouse, France, 1986.","title":"Une methode de deduction automatique en logique modale","authors":"M Cialdea","year":"1986","venue":"These de 1 1 Universite P","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Fages, Huet 86","title":null,"authors":"Huet Fages","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"F. Fages, G. Huet : Complete sets of unifiers and matchers in equational theories, Theor. Comput. Scie. : 43, 1986, 189-200","title":"Complete sets of unifiers and matchers in equational theories","authors":"F Fages, G Huet","year":"1986","venue":"Theor. Comput. Scie","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"F. Fages : Formes canoniques dans les algebres booleennes •etapplicationa•lil demortstra- tion •automatique •en • logique•du •premier •ordre. The- se de 3eme cycle, Paris 7, France, 1983.","title":"Formes canoniques dans les algebres booleennes •etapplicationa•lil demortstration •automatique •en • logique•du •premier •ordre. These de 3eme cycle","authors":"F Fages","year":"1983","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"Farinas, Herzig 88","title":"Herzig","authors":"Farinas","year":null,"venue":"Herzig","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"L. Farinas, A. Herzig : Quantified modal logic and unification theory, :.i Rapport technique LSI n° 293, Universite P. Saba- tier, Toulouse, France, 1988.","title":"Quantified modal logic and unification theory","authors":"L Farinas, A Herzig","year":"1988","venue":"Rapport technique LSI n° 293","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"M, Fay : Firsfhorder .unification in equational theories, 4 workshop •on automated deduction, Austin, Texas, 1979.","title":"Firsfhorder .unification in equational theories, 4 workshop •on automated deduction","authors":"M, Fay","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"raw":"Hsiang, Dershowitz 83","title":"Dershowitz","authors":"Hsiang","year":null,"venue":"Dershowitz","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"J. Hsiang, N. Dershowitz, Rewrite methods for clausal and non-clausal theo- rem proving, Int. Conf. on AutOmata; Languages and Programming 1983.","title":"Rewrite methods for clausal and non-clausal theorem proving","authors":"J Hsiang, N Dershowitz","year":"1983","venue":"Int. Conf. on AutOmata; Languages and Programming","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"Huet, Oppen 80","title":null,"authors":"Huet","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"G. Huet, D. Oppen : Equations and Rewrite Rules : a survey, in : •Formal langua- ges, perspectives and open problems, Book R. ed., Academic Press 1980.","title":"Equations and Rewrite Rules : a survey","authors":"G Huet, D Oppen","year":"1980","venue":"Formal languages, perspectives and open problems","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"K. Konolidge : A deduction model of belief, Research Notes in Art1f1c1al Intelli- gence, Pitman Pub. Lted, 1986,","title":"A deduction model of belief","authors":"K Konolidge","year":"1986","venue":"Research Notes in Art1f1c1al Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"R.C. Moore : Reasorting •about knowledge and action, PhD Thesis, MIT, Cambridge, Massa- chussets, 1980.","title":"Reasorting •about knowledge and action","authors":"R C Moore","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"H.J. Ohlbach : A resolution calculus for modal logics, 9th Conf. on Automated Deduction Springer Lecture Notes in Comput. Scie. 310, 1988, 500-516.","title":"A resolution calculus for modal logics","authors":"H J Ohlbach","year":"1988","venue":"9th Conf. on Automated Deduction Springer Lecture Notes in Comput. Scie","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"J.P. Pecuchet : Solutions principa- les et rang d'un systeme d'equations avec constan- tes dans le monoide libre, Discrete •Mathematics : 48, 1984, 253-274.","title":"Solutions principales et rang d'un systeme d'equations avec constantes dans le monoide libre","authors":"J P Pecuchet","year":"1984","venue":"Discrete •Mathematics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"G. Plotkin : Building in equational theories, Machine Intelligence 7, 1972, 73-90","title":"Building in equational theories","authors":"G Plotkin","year":"1972","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"Walther","title":null,"authors":"Walther","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"c. Walther : A marty~sorted calculus based on resolution and param6dulation Research notes in Artificial Intelligence, Pitman, London, 1987.","title":"A marty~sorted calculus based on resolution and param6dulation Research notes in Artificial Intelligence","authors":"Walther","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}