Logics Modulo Theories: a logical framework for multi-agent systems

Logics Modulo Theories (LMT) is a methodology for putting together logics that takes numbers of logics, each working in their own locality (local logics) and allows them to communicate through a global system that has its own (global) logic. This makes it suitable for the study of multi-agent systems. The original motivation for LMT comes from a consideration of agents working in their own domains or localities and then communicating with one another at a higher level. At the base are local worlds each with their own logic. Above them is a logic that takes statements from the local worlds and combines them. The two layers are connected by rules for transferring between local and global logics—in both directions. It will be made clear that aside from LMT’s applicability to agent systems, it can be applied to the area of ontology reconciliation, combining logics and which can subsume Satisfaction Modulo Theories (SMT), a technique for solving constraint satisfaction problems. To illustrate the layered logic approach of LMT, we give a number of very different examples, ranging from standard classical logics to algebraic specifications, where we have agents in contexts with local ontologies. Although we only consider two layers in the present article, we see no reason why the approach should not be extended to any finite number of tiers. In practice, to mechanize our systems, instead of using first-order logic one might use PROLOG, or another logic programming language in a very straightforward way. The following are the theses of this article: (i) when used for combining logics for multi-agent systems, in comparison to other methods LMT produces a more elegant and simpler logical system; (ii) the ideal properties of its component logics, namely, soundness and completeness, readily transfer to the resulting logic (under certain common conditions); and (iii) the proofs for these results are very straightforward because LMT uses well-established

[1]  Luciano Serafini,et al.  On the Difference between Bridge Rules and Lifting Axioms , 2003, CONTEXT.

[2]  G. Sacks Degrees of unsolvability , 1965 .

[3]  Martin Wirsing,et al.  Proof Normalization of Structured Algebraic Specifications Is Convergent , 1998, WADT.

[4]  Maria Simi,et al.  Proofs in Context , 1994, KR.

[5]  John Newsome Crossley,et al.  LMT: A Lightweight Logical Framework for Multi-agent Systems , 2012, KES.

[6]  Karin Ackermann,et al.  Labelled Deductive Systems , 2016 .

[7]  Varol Akman,et al.  Steps Toward Formalizing Context , 1996, AI Mag..

[8]  Fausto Giunchiglia,et al.  Contextual Reasoning , 1998, ECAI.

[9]  Elliott Mendelson,et al.  Introduction to Mathematical Logic , 1979 .

[10]  Ian A. Mason,et al.  Propositional Logic of Context , 1993, AAAI.

[11]  Greg Nelson,et al.  Simplification by Cooperating Decision Procedures , 1979, TOPL.

[12]  Fausto Giunchiglia,et al.  A Local Models Semantics for Propositional Attitudes , 2000 .

[13]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[14]  Hannes Peterreins A natural-deduction-like calculus for structured specifications , 1996 .

[15]  Dov M. Gabbay,et al.  Labelled Deductive Systems: Volume 1 , 1996 .

[16]  Fausto Giunchiglia,et al.  Multilanguage hierarchical logics (or: how we can do without modal logics) , 1994, CNKBS.

[17]  John Newsome Crossley,et al.  Contextualizing Ontologies for Agents , 2010, KEOD.

[18]  Luciano Serafini,et al.  Distributed Description Logics: Assimilating Information from Peer Sources , 2003, J. Data Semant..

[19]  Ian A. Mason,et al.  Metamathematics of Contexts , 1995, Fundam. Informaticae.

[20]  Fausto Giunchiglia,et al.  Local Models Semantics, or Contextual Reasoning = Locality + Compatibility , 1998, KR.

[21]  John Newsome Crossley,et al.  Tiered Logic for Agents , 2009, ICAART.

[22]  J. Fahy Samsara , 2018, Debates do NER.

[23]  Cesare Tinelli,et al.  Combined Satisfiability Modulo Parametric Theories , 2007, TACAS.

[24]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[25]  Manuel Lerman,et al.  Degrees of Unsolvability: Local and Global Theory , 1983 .

[26]  Frank van Harmelen,et al.  Contextualizing ontologies , 2004, J. Web Semant..

[27]  Martin Wirsing,et al.  Extraction of Structured Programs from Specification Proofs , 1999, WADT.

[28]  Fausto Giunchiglia,et al.  A Foundation for Metareasoning Part II: The Model Theory , 2002, J. Log. Comput..

[29]  Iman Poernomo Adapting proofs-as-programs , 2005 .

[30]  Luciano Serafini,et al.  Comparing formal theories of context in AI , 2004, Artif. Intell..

[31]  Melvin Fitting,et al.  Modal proof theory , 2007, Handbook of Modal Logic.

[32]  José Meseguer,et al.  Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations , 1992, Theor. Comput. Sci..

[33]  Carsten Lutz,et al.  E-connections of Description Logics , 2003, Description Logics.

[34]  Peter D. Mosses,et al.  CASL: the Common Algebraic Specification Language , 2002, Theor. Comput. Sci..

[35]  Leon Henkin,et al.  The completeness of the first-order functional calculus , 1949, Journal of Symbolic Logic.

[36]  John McCarthy,et al.  Notes on Formalizing Context , 1993, IJCAI.

[37]  R. Guha Contexts: a formalization and some applications , 1992 .

[38]  Bernhard Reus,et al.  A Complete Temporal and Spatial Logic for Distributed Systems , 2005, FroCoS.

[39]  María Victoria Cengarle,et al.  Formal specifications with higher-order parameterization , 1995, Berichte aus der Informatik.

[40]  C. Caleiro,et al.  Fibring Logics∗ , 2009 .

[41]  John McCarthy,et al.  Generality in artificial intelligence , 1987, Resonance.

[42]  Fausto Giunchiglia,et al.  A Foundation for Metareasoning Part I: The Proof Theory , 2002, J. Log. Comput..

[43]  Cesare Tinelli,et al.  A New Correctness Proof of the {Nelson-Oppen} Combination Procedure , 1996, FroCoS.

[44]  Luciano Serafini,et al.  Distributed First Order Logic , 2015, Artif. Intell..

[45]  Max J. Cresswell,et al.  A New Introduction to Modal Logic , 1998 .