## Towards interoperable mechanized reasoning systems: the logic broker architecture (2000)

Venue: | AI*IA-TABOO Workshop `From Objects to Agents: Evolutionary Trends of Software Systems |

Citations: | 14 - 1 self |

### BibTeX

@INPROCEEDINGS{Armando00towardsinteroperable,

author = {Alessandro Armando},

title = {Towards interoperable mechanized reasoning systems: the logic broker architecture},

booktitle = {AI*IA-TABOO Workshop `From Objects to Agents: Evolutionary Trends of Software Systems},

year = {2000},

pages = {70--75}

}

### OpenURL

### Abstract

There is a growing interest in the integration of mechanized reasoning systems such as automated theorem provers, computer algebra systems, and model checkers. State-of-the-art reasoning systems are the result of many man-years of careful development and engineering, and usually they provide a high degree of sophistication in their respective domain. Yet they often perform poorly when applied outside the domain they have been designed for. The problem of integrating mechanized reasoning systems is therefore being perceived as an important issue in automated reasoning. In this paper we present the Logic Broker Architecture, a framework which provides the needed infrastructure for making mechanized reasoning systems interoperate. The architecture provides location transparency, a way to forward requests for logical services to appropriate reasoning systems via a simple registration/subscription mechanism, and a translation mechanism which ensures the transparent and provably sound exchange of logical services. 1

### Citations

424 | Software agents
- Genesereth, Ketchpel
- 1994
(Show Context)
Citation Context ...n most cases solutions and techniques available in mature or emerging areas such as Software Engineering or Artificial Intelligence (as, for instance, CORBA or the Agent-Oriented Programming paradigm =-=[13]-=-) have been neglected. In this paper we present the Logic Broker Architecture, a framework which provides the needed infrastructure for making mechanized reasoning systems interoperate. The architectu... |

317 |
Introduction to Mathematical Logic
- Mendelson
- 1987
(Show Context)
Citation Context ...bol � denoting set inclusion; � is such thats� « if and only if Ì �s�� « where �� denotes entailment in classical first order logic, and Ì is any suitable axiomatization for set theory (see, e.g., in =-=[20]-=-). Let us consider also a server reasoning system with consequence relation Ä×� �× where Ä× is a quantifier free first order language built out of an enumerable set of individual constants � �� � ����... |

100 | Simple consequence relations
- Avron
- 1991
(Show Context)
Citation Context ...h claiming the validity of invalid facts thereby compromising the soundness of the logical services it provides. We model the logic mechanized by a reasoning system by means of a consequence relation =-=[3]-=-, i.e. a pair of the form Ä� � where Ä is a set of sentences and �� È Ä ¢Ä 1 is a binary relation enjoying the following properties: 1. (Inclusion)if«s, thens� «; 2. (Monotonicity)ifs� «, thens� ¡ � «... |

50 | Theorems and algorithms: An interface between Isabelle and Maple
- Ballarin, Homann, et al.
- 1995
(Show Context)
Citation Context ...ere the correctness is of paramount importance as, e.g., in the formal verification of safety or security critical systems. In the last few years a number of prototype integrations have been proposed =-=[2, 4, 5, 6, 7, 11, 16, 17, 18]-=-. However all the existing attempts are ad-hoc solutions, geared to the characteristics of the specific systems considered. Moreover, in most cases solutions and techniques available in mature or emer... |

47 | An Overview of the Theorema Project
- Buchberger, Jebelean, et al.
- 1997
(Show Context)
Citation Context ...ere the correctness is of paramount importance as, e.g., in the formal verification of safety or security critical systems. In the last few years a number of prototype integrations have been proposed =-=[2, 4, 5, 6, 7, 11, 16, 17, 18]-=-. However all the existing attempts are ad-hoc solutions, geared to the characteristics of the specific systems considered. Moreover, in most cases solutions and techniques available in mature or emer... |

47 | Reasoning theories: Towards an architecture for open mechanized reasoning systems
- Giunchiglia, Pecchiari, et al.
(Show Context)
Citation Context ...tivity thanks to the use of CORBA. In the future work we plan to lift the Logic Broker Architecture to an agent-based architecture [14]. The Open Mechanized Reasoning Systems (OMRS for short) project =-=[15, 1]-=- aims at the definition of a specification framework for specifying logical services. Specifications play a fundamental rôle when automatic and/or provably sound integrations are at stake. The incorpo... |

42 | Integrating Computer Algebra Into Proof Planning
- Kerber, Kohlhase, et al.
- 1998
(Show Context)
Citation Context ...ere the correctness is of paramount importance as, e.g., in the formal verification of safety or security critical systems. In the last few years a number of prototype integrations have been proposed =-=[2, 4, 5, 6, 7, 11, 16, 17, 18]-=-. However all the existing attempts are ad-hoc solutions, geared to the characteristics of the specific systems considered. Moreover, in most cases solutions and techniques available in mature or emer... |

36 | System description: MathWeb, an agent-based communication layer for distributed automated theorem proving
- Franke, Kohlhase
- 1999
(Show Context)
Citation Context ...lems. ILF [8] is a framework for which supports the cooperation of provers. For the lack of space here we focus on the approach which is more related to ours, namely the MathWeb architecture. MathWeb =-=[12]-=- is a distributed network architecture for automated and interactive theorem proving aiming at supporting modularization, interoperability, robustness, and scalability of mathematical software systems... |

34 | An OpenMath 1.0 Implementation
- Dalmas, Gaëtano, et al.
- 1997
(Show Context)
Citation Context ...roduce the Logic Broker Architecture and illustrate its basic functionalities. In Section 4 we present our running prototype of the Logic Broker Architecture based on CORBA and the OPENMATH standard =-=[9]-=-. In Section 5 we discuss the related work. Finally in Section 6 we draw some concluding remarks. 2 Interfacing Mechanized Reasoning Systems By mechanized reasoning systems (reasoning systems for shor... |

33 | Extending the HOL theorem prover with a computer algebra system to reason about the reals
- Harrison, Théry
- 1993
(Show Context)
Citation Context |

23 |
A.: Integration of automated and interactive theorem proving in ILF
- Dahn, Gehne, et al.
- 1997
(Show Context)
Citation Context ...ing systems is available in the literature. TeamWork [10] is an approach for the knowledge-based distribution of search which has been successfully applied to solve equational deduction problems. ILF =-=[8]-=- is a framework for which supports the cooperation of provers. For the lack of space here we focus on the approach which is more related to ours, namely the MathWeb architecture. MathWeb [12] is a dis... |

20 | V.: Agent-oriented integration of distributed mathematical services
- Franke, Hess, et al.
- 1999
(Show Context)
Citation Context |

15 | Integrating Computer Algebra with Proof Planning
- Kerber, Kohlhase, et al.
(Show Context)
Citation Context |

11 |
Cooperating theorem provers
- Denzinger, Dahn
- 1998
(Show Context)
Citation Context ...h pair of private languages is needed. 5 Related Work A number of approaches aiming at the smooth and/or effective combination of mechanized reasoning systems is available in the literature. TeamWork =-=[10]-=- is an approach for the knowledge-based distribution of search which has been successfully applied to solve equational deduction problems. ILF [8] is a framework for which supports the cooperation of ... |

6 | From integrated reasoning specialists to “plug-andplay” reasoning components
- Armando, Ranise
- 1998
(Show Context)
Citation Context |

6 | Large-Sample Standard
- Fleiss, Cohen, et al.
- 1969
(Show Context)
Citation Context ...entation of OPENMATH object representing the formula �Ü��Ý�È Ü� Ý . “forall” and “exists” are OPENMATH Symbols defined in the Content Dictionary “quant1” while “x” and “y’ are OPENMATH variables. See =-=[21]-=- for the details. Figure 4. Example of OPENMATH Object Description: An nary commutative function plus. Commented Mathematical property (CMP):a +b=b+a Formal Mathematical property (FMP): forall [ a b ]... |

2 | The control component of open mechanized reasoning systems
- Armando, Coglio, et al.
- 1998
(Show Context)
Citation Context ...tivity thanks to the use of CORBA. In the future work we plan to lift the Logic Broker Architecture to an agent-based architecture [14]. The Open Mechanized Reasoning Systems (OMRS for short) project =-=[15, 1]-=- aims at the definition of a specification framework for specifying logical services. Specifications play a fundamental rôle when automatic and/or provably sound integrations are at stake. The incorpo... |

1 | Symbolic and algebraic computation (ISSAC-97) : international symposium - Küchlin, editor |