Zur Kurzanzeige

dc.contributor.authorSteen, Alexander
dc.date2020-03-01
dc.date.accessioned2021-04-23T09:30:28Z
dc.date.available2021-04-23T09:30:28Z
dc.date.issued2020
dc.identifier.issn1610-1987
dc.identifier.urihttp://dx.doi.org/10.1007/s13218-019-00628-8
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/36278
dc.description.abstractAutomation of classical higher-order logic faces various theoretical and practical challenges. On a theoretical level, powerful calculi for effective equality reasoning from first-order theorem proving cannot be lifted to the higher-order domain in a simple manner. Practically, implementations of higher-order reasoning systems have to incorporate procedures that often have high time complexity or are not decidable in general. In my dissertation, both the theoretical and the practical challenges of designing an effective higher-order reasoning system are studied. The resulting system, the automated theorem prover Leo-III, is one of the most effective and versatile systems, in terms of supported logical formalisms, to date.de
dc.publisherSpringer
dc.relation.ispartofKI - Künstliche Intelligenz: Vol. 34, No. 1
dc.relation.ispartofseriesKI - Künstliche Intelligenz
dc.subjectAutomated theorem proving
dc.subjectHenkin semantics
dc.subjectHigher-order logic
dc.subjectQuantified modal logics
dc.titleExtensional Paramodulation for Higher-Order Logic and Its Effective Implementation Leo-IIIde
dc.typeText/Journal Article
mci.reference.pages105-108
dc.identifier.doi10.1007/s13218-019-00628-8


Dateien zu dieser Ressource

DateienGrößeFormatAnzeige

Zu diesem Dokument gibt es keine Dateien.

Zur Kurzanzeige