{"type":"ScholarlyArticle","title":"Proving Semantic Properties as First-Order Satisfiability (Extended Abstract)","authors":[{"name":"Salvador Lucas","slug":"salvador-lucas","given":"Salvador","family":"Lucas","affiliation":"Valencian Research Institute for Artificial Intelligence (VRAIN) Universitat Politècnica de València , Spain"}],"abstract":"The semantics of computational systems (e.g., relational and knowledge data bases, query-answering systems, programming languages, etc.) can often be expressed as (the specification of) a logical theory Th. Queries, goals, and claims about the behavior or features of the system can be expressed as formulas φ which should be checked with respect to the intended model of Th, which is often huge or even incomputable. In this paper we show how to prove such semantic properties φ of Th by just finding a model A of Th∪{φ}∪Zφ, where Zφ is an appropriate (possibly empty) theory depending on φ only. Applications to relational and deductive databases, rewriting-based systems, logic programming, and answer set programming are discussed.","doi":"10.24963/ijcai.2020/710","url":"https://ijcai.org/proceedings/2020/710","pdf":"https://ijcai.org/proceedings/2020/0710.pdf","markdown":"https://ijcai.org/proceedings/2020/710.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/710","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Journal track","track":"Journal track","number":710,"pages":{"first":5075,"last":5079},"keywords":["Knowledge Representation and Reasoning: Automated Reasoning; Tractable Languages and Knowledge compilation","Knowledge Representation and Reasoning: Logics for Knowledge Representation","Multidisciplinary Topics and Applications: Validation and Verification"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24569/file_24569.m3u8","length_sec":252,"provider":"hls"}],"references":[{"position":1,"raw":"[Clark, 1977] Keith L. Clark. Negation as failure. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, France, 1977, Advances in Data Base Theory, pages 293-322, New York, 1977. Ple- mum Press.","title":"Negation as failure","authors":"Keith L Clark","year":"1977","venue":"Logic and Data Bases, Symposium on Logic and Data Bases","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Clark, 1980] Keith L. Clark. Predicate logic as a computa- tional formalism. PhD thesis, Queen Mary University of London, UK, 1980.","title":"Predicate logic as a computational formalism","authors":"Keith L Clark","year":"1980","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Fitting, 1996] Melvin Fitting. First-Order Logic and Auto- mated Theorem Proving, Second Edition. Graduate Texts in Computer Science. Springer, 1996.","title":"First-Order Logic and Automated Theorem Proving","authors":"Melvin Fitting","year":"1996","venue":"Graduate Texts in Computer Science","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Goguen and Meseguer, 1987] Joseph A. Goguen and José Meseguer. Models and equality for logical programming. In Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi, and Ugo Montanari, editors, TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 2: Advanced Seminar on Foundations of Innova- tive Software Development II and Colloquium on Func- tional and Logic Programming and Specifications (CFLP), volume 250 of Lecture Notes in Computer Science, pages 1-22. Springer, 1987.","title":"Models and equality for logical programming","authors":"Joseph A Goguen, José Meseguer","year":"1987","venue":"Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Functional and Logic Programming and Specifications (CFLP)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Goubault-Larrecq, 2010] Jean Goubault-Larrecq. Finite models for formal security proofs. Journal of Computer Security, 18(6):1247-1299, 2010.","title":"Jean Goubault-Larrecq. Finite models for formal security proofs","authors":"Goubault-Larrecq","year":"2010","venue":"Journal of Computer Security","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Green and Raphael, 1968] C. Cordell Green and Bertram Raphael. The use of theorem-proving techniques in question-answering systems. In Proceedings of the 1968 23rd ACM National Conference, ACM '68, page 169-181, New York, NY, USA, 1968. Association for Computing Machinery.","title":"The use of theorem-proving techniques in question-answering systems","authors":"C, Cordell Green, Bertram Raphael","year":"1968","venue":"Proceedings of the 1968 23rd ACM National Conference, ACM '68","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gutiérrez and Lucas, 2019a] Raúl Gutiérrez and Salvador Lucas. Automatic generation of logical models with AGES. In Pascal Fontaine, editor, Automated Deduction -CADE 27 -27th International Conference on Automated Deduction, Natal, Brazil, August 27-30, 2019, Proceed- ings, volume 11716 of Lecture Notes in Computer Science, pages 287-299. Springer, 2019.","title":"Automatic generation of logical models with AGES","authors":"Lucas ; Gutiérrez, Raúl Gutiérrez, Salvador Lucas","year":"2019","venue":"Automated Deduction -CADE 27 -27th International Conference on Automated Deduction","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gutiérrez and Lucas, 2019b] Raúl Gutiérrez and Salvador Lucas. infChecker, a tool for Checking Infeasibility . In María Alpuente, Julia Sapiña, and Roberto Rodríguez- Echeverría, editors, Actas de las XIX Jornadas de Progra- mación y Lenguajes (PROLE 2019), page 12. SISTEDES, 2019.","title":"Raúl Gutiérrez and Salvador Lucas. infChecker, a tool for Checking Infeasibility","authors":"Lucas Gutiérrez","year":"2019","venue":"Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019)","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hodges, 1993] Wilfrid Hodges. Model theory, volume 42 of Encyclopedia of mathematics and its applications. Cam- bridge University Press, 1993.","title":"Wilfrid Hodges. Model theory, volume 42 of Encyclopedia of mathematics and its applications","authors":"Hodges","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Jürjens and Weber, 2009] Jan Jürjens and Tjark Weber. Fi- nite models in fol-based crypto-protocol verification. In Pierpaolo Degano and Luca Viganò, editors, Foundations and Applications of Security Analysis, Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009, York, UK, March 28-29, 2009, Revised Selected Papers, volume 5511 of Lecture Notes in Computer Science, pages 155- 172. Springer, 2009.","title":"Finite models in fol-based crypto-protocol verification","authors":"Weber ; Jürjens, Jan Jürjens, Tjark Weber","year":"2009","venue":"Foundations and Applications of Security Analysis, Joint Workshop on Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security, ARSPA-WITS 2009","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kapur and Musser, 1987] Deepak Kapur and David R. Musser. Proof by consistency. Artif. Intell., 31(2):125- 157, 1987.","title":"Proof by consistency","authors":"Deepak Kapur, David R Musser","year":"1987","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kim and Zhang, 1994] Sun Kim and Hantao Zhang. Mod- gen: Theorem proving by model generation. In Barbara Hayes-Roth and Richard E. Korf, editors, Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31 -August 4, 1994, Volume 1, pages 162-167. AAAI Press / The MIT Press, 1994.","title":"Modgen: Theorem proving by model generation","authors":"Zhang Kim, Sun Kim, Hantao Zhang","year":"1994","venue":"Proceedings of the 12th National Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lisitsa, 2013] Alexei Lisitsa. Finite reasons for safety -pa- rameterized verification by finite model finding. J. Autom. Reasoning, 51(4):431-451, 2013.","title":"Alexei Lisitsa. Finite reasons for safety -parameterized verification by finite model finding","authors":"Lisitsa","year":"2013","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lucas, 2019] Salvador Lucas. Proving semantic properties as first-order satisfiability. Artif. Intell., 277, 2019.","title":"Salvador Lucas. Proving semantic properties as first-order satisfiability","authors":"Lucas","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lucas, 2020] Salvador Lucas. Using well-founded relations for proving operational termination. J. Autom. Reasoning, 64(2):167-195, 2020.","title":"Salvador Lucas. Using well-founded relations for proving operational termination","authors":"Lucas","year":"2020","venue":"J. Autom. Reasoning","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"McCune, 2005 2010]","title":null,"authors":"Mccune","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"William McCune. Prover9 & Mace4. Technical report, 2005-2010.","title":"Prover9 & Mace4","authors":"William Mccune","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mendelson, 1997] Elliott Mendelson. Introduction to math- ematical logic (4. ed.). Chapman and Hall, 1997.","title":"Introduction to mathematical logic","authors":"Elliott Mendelson","year":"1997","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Meseguer, 1989] José Meseguer. General logics. In H.-D. Ebbinghaus, J. Fernandez-Prida, M. Garrido, D. Lascar, and M. Rodriquez Artalejo, editors, Logic Colloquium'87, volume 129 of Studies in Logic and the Foundations of Mathematics, pages 275 -329. Elsevier, 1989.","title":"General logics","authors":"José Meseguer","year":"1989","venue":"Studies in Logic and the Foundations of Mathematics","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Middeldorp et al., 2019] A. Middeldorp, J. Nagele, and K. Shintani. Confluence Competition 2019. In D. Beyer, M. Huisman, F. Kordon, and B. Steffen, editors, Proc. of Tools and Algorithms for the Construction and Analysis of Systems, TACAS'19, pages 25-40. Springer, 2019.","title":"Confluence Competition","authors":"A Middeldorp, J Nagele, K Shintani","year":"2019","venue":"Proc. of Tools and Algorithms for the Construction and Analysis of Systems, TACAS'19","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Nicolas and Gallaire, 1977] Jean-Marie Nicolas and Hervé Gallaire. Data base: Theory vs. interpretation. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et de recherches de Toulouse, France, 1977, Advances in Data Base Theory, pages 33-54, New York, 1977. Plemum Press.","title":"Data base: Theory vs. interpretation","authors":"Jean-Marie Nicolas, Hervé Gallaire","year":"1977","venue":"Logic and Data Bases, Symposium on Logic and Data Bases","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Reiter, 1977] Raymond Reiter. On closed world data bases. In Hervé Gallaire and Jack Minker, editors, Logic and Data Bases, Symposium on Logic and Data Bases, Cen- tre d'études et de recherches de Toulouse, France, 1977, Advances in Data Base Theory, pages 55-76, New York, 1977. Plemum Press.","title":"On closed world data bases","authors":"Raymond Reiter","year":"1977","venue":"Logic and Data Bases, Symposium on Logic and Data Bases, Centre d'études et","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Selinger, 2001] Peter Selinger. Models for an adversary- centric protocol logic. Electron. Notes Theor. Comput. Sci., 55(1):69-84, 2001.","title":"Models for an adversarycentric protocol logic","authors":"Peter Selinger","year":"2001","venue":"Electron. Notes Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[van Emden and Kowalski, 1976] Maarten H. van Emden and Robert A. Kowalski. The semantics of predicate logic as a programming language. J. ACM, 23(4):733-742, 1976.","title":"The semantics of predicate logic as a programming language","authors":"Van Emden, H Kowalski ; ] Maarten, Robert A Van Emden, Kowalski","year":"1976","venue":"J. ACM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}