You can manage bookmarks using lists, please log in to your user account for this.
Media type:
Doctoral Thesis;
Electronic Thesis;
E-Book
Title:
Efficient reasoning procedures for complex first-order theories ; Effizientes logisches Schließen für komplexe Theorien der Prädikatlogik erster Stufe
Contributor:
Wischnewski, Patrick
[Author]
Published:
Scientific publications of the Saarland University (UdS), 2012
Footnote:
Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
Description:
The complexity of a set of first-order formulas results from the size of the set and the complexity of the problem described by its formulas. Decision Procedures for Ontologies This thesis presents new superposition based decision procedures for large sets of formulas. The sets of formulas may contain expressive constructs like transitivity and equality. The procedures decide the consistency of knowledge bases, called ontologies, that consist of several million formulas and answer complex queries with respect to these ontologies. They are the first superposition based reasoning procedures for ontologies that are at the same time efficient, sound, and complete. The procedures are evaluated using the well-known ontologies YAGO, SUMO and CYC. The results of the experiments, which are presented in this thesis, show that these procedures decide the consistency of all three above-mentioned ontologies and usually answer queries within a few seconds. Reductions for General Automated Theorem Proving Sophisticated reductions are important in order to obtain efficient reasoning procedures for complex, particularly undecidable problems because they restrict the search space of theorem proving procedures. In this thesis, I have developed a new powerful reduction rule. This rule enables superposition based reasoning procedures to find proofs in sets of complex formulas. In addition, it increases the number of problems for which superposition is a decision procedure. ; Die Komplexität einer Formelmenge für einen automatischen Theorembeweiser in Prädikatenlogik 1. Stufe ergibt sich aus der Anzahl der zu betrachtenden Formeln und aus der Komplexität des durch die Formeln beschriebenen Problems. Entscheidungsprozeduren für Ontologien Diese Arbeit entwickelt effiziente auf Superposition basierende Beweisprozeduren für sehr große entscheidbare Formelmengen, die ausdrucksstarke Konstrukte, wie Transitivität und Gleichheit, enthalten. Die Prozeduren ermöglichen es Wissenssammlungen, sogenannte Ontologien, die aus mehreren Millionen ...