Connectionist modal logic: Representing modalities in neural networks

Modal logics are amongst the most successful applied logical systems. Neural networks were proved to be effective learning systems. In this paper, we propose to combine the strengths of modal logics and neural networks by introducing Connectionist Modal Logics (CML). CML belongs to the domain of neural-symbolic integration, which concerns the application of problem-specific symbolic knowledge within the neurocomputing paradigm. In CML, one may represent, reason or learn modal logics using a neural network. This is achieved by a Modalities Algorithm that translates modal logic programs into neural network ensembles. We show that the translation is sound, i.e. the network ensemble computes a fixed-point meaning of the original modal program, acting as a distributed computational model for modal logic. We also show that the fixed-point computation terminates whenever the modal program is well-behaved. Finally, we validate CML as a computational model for integrated knowledge representation and learning by applying it to a well-known testbed for distributed knowledge representation. This paves the way for a range of applications on integrated knowledge representation and learning, from practical reasoning to evolving multi-agent systems.

[1]  Johann Eder,et al.  Logic and Databases , 1992, Advanced Topics in Artificial Intelligence.

[2]  Sebastian Thrun,et al.  The MONK''s Problems-A Performance Comparison of Different Learning Algorithms, CMU-CS-91-197, Sch , 1991 .

[3]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[4]  Vipin Kumar,et al.  Rule-based reasoning in connectionist networks , 1997 .

[5]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[6]  Valentin Goranko,et al.  Logic in Computer Science: Modelling and Reasoning About Systems , 2007, J. Log. Lang. Inf..

[7]  Laura Giordano,et al.  A Modal Extension of Logic Programming: Modularity, Beliefs and Hypothetical Reasoning , 1998, J. Log. Comput..

[8]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[9]  Artur S. d'Avila Garcez,et al.  Reasoning about Time and Knowledge in Neural Symbolic Learning Systems , 2003, NIPS.

[10]  C. Lewis,et al.  A Survey Of Symbolic Logic , 1920 .

[11]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[12]  Artur S. d'Avila Garcez,et al.  Neural-Symbolic Systems and the Case for Non-Classical Reasoning , 2005, We Will Show Them!.

[13]  Krysia Broda,et al.  Compiled Labelled Deductive Systems: A Uniform Presentation of Non-Classical Logics , 2004 .

[14]  Zhi-Hua Zhou,et al.  Extracting symbolic rules from trained neural network ensembles , 2003, AI Commun..

[15]  Frédéric Alexandre,et al.  Connectionist-Symbolic Integration: From Unified to Hybrid Approaches , 1996 .

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

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

[18]  Thomas Eiter,et al.  Preferred Answer Sets for Extended Logic Programs , 1999, Artif. Intell..

[19]  C. Micchelli,et al.  Approximation by superposition of sigmoidal and radial basis functions , 1992 .

[20]  Yasubumi Sakakibara Programming in Modal Logic: An Extension of PROLOG based on Modal Logic , 1986, LP.

[21]  Jacek M. Zurada,et al.  Knowledge-based neurocomputing , 2000 .

[22]  George Cybenko,et al.  Approximation by superpositions of a sigmoidal function , 1992, Math. Control. Signals Syst..

[23]  A.S. d'Avila Garcez,et al.  Extended theory refinement in knowledge-based neural networks , 2002, Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290).

[24]  Artur S. d'Avila Garcez,et al.  We Will Show Them! Essays in Honour of Dov Gabbay, Volume One , 2005, We Will Show Them!.

[25]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[26]  Simon Haykin,et al.  Neural Networks: A Comprehensive Foundation , 1998 .

[27]  Artur S. d'Avila Garcez,et al.  Fewer Epistemological Challenges for Connectionism , 2005, CiE.

[28]  Krysia Broda,et al.  Symbolic knowledge extraction from trained neural networks: A sound approach , 2001, Artif. Intell..

[29]  Jude W. Shavlik,et al.  Knowledge-Based Artificial Neural Networks , 1994, Artif. Intell..

[30]  Geoffrey E. Hinton,et al.  Learning internal representations by error propagation , 1986 .

[31]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[32]  Wanli Ma,et al.  An Overview of Temporal and Modal Logic Programming , 1994, ICTL.

[33]  N. K. Bose,et al.  Neural Network Fundamentals with Graphs, Algorithms and Applications , 1995 .

[34]  Artur S. d'Avila Garcez,et al.  The Connectionist Inductive Learning and Logic Programming System , 1999, Applied Intelligence.

[35]  Steffen Hölldobler,et al.  Towards a New Massively Parallel Computational Model for Logic Programming , 1994 .

[36]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[37]  Lokendra Shastri,et al.  Advances in SHRUTI—A Neurally Motivated Model of Relational Knowledge Representation and Rapid Inference Using Temporal Synchrony , 1999, Applied Intelligence.

[38]  Melvin Fitting,et al.  Metric Methods Three Examples and a Theorem , 1994, J. Log. Program..

[39]  Ron Sun,et al.  Robust Reasoning: Integrating Rule-Based and Similarity-Based Reasoning , 1995, Artif. Intell..

[40]  Thomas G. Dietterich What is machine learning? , 2020, Archives of Disease in Childhood.

[41]  Moshe Y. Vardi Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[42]  Dov M. Gabbay,et al.  Chapter 13 – Labelled Deductive Systems , 2003 .

[43]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[44]  M. Fitting Proof Methods for Modal and Intuitionistic Logics , 1983 .

[45]  Krysia Broda,et al.  Neural-symbolic learning systems - foundations and applications , 2012, Perspectives in neural computing.

[46]  Leslie G. Valiant,et al.  Three problems in computer science , 2003, JACM.

[47]  Dov M. Gabbay,et al.  Handbook of Philosophical Logic , 2002 .

[48]  Luis Fariñas del Cerro,et al.  Modal Tableaux with Propagation Rules and Structural Rules , 1997, Fundam. Informaticae.

[49]  Krysia Broda,et al.  Labelled Natural Deduction for Conditional Logics of Normality , 2002, Log. J. IGPL.

[50]  R. Labrecque The Correspondence Theory , 1978 .

[51]  Philipp Slusallek,et al.  Introduction to real-time ray tracing , 2005, SIGGRAPH Courses.

[52]  Bernhard Beckert,et al.  Dynamic Logic , 2007, The KeY Approach.