Reference : Capability Discovery for Automated Reasoning Systems
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/33701
Capability Discovery for Automated Reasoning Systems
English
Steen, Alexander [Freie Universität Berlin]
Wisniewski, Max [Freie Universität Berlin]
Schurr, Hans-Jörg [Freie Universität Berlin]
Benzmüller, Christoph mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)]
4-Jun-2017
IWIL Workshop and LPAR Short Presentations
EasyChair
Kalpa Publications in Computing
6
Yes
International
Maun, Botswana
IWIL Workshop
7 May 2017
Stephan Schulz (IWIL 2017) Josef Urban (IWIL 2017)
Maun, Botswana
[en] LEO Prover ; Higher Order Logic ; Polymorphism Automated Reasoning
[en] Automated reasoning systems such as theorem provers often employ interaction or cooperation with further reasoning software. Whereas in most cases the concrete choice of cooperating software is, to some extent, irrelevant, these systems are nevertheless often rigid in practice due to compatibility issues. In order to support more flexible cooperation schemes, a machine-readable description format for automated reasoning systems' capabilities is proposed. Additionally, a simple HTTP-based protocol for system and capability discovery is outlined. Both the format and the protocol are designed to be simple, extensible and easy to use with none to minor modifications for existing reasoning systems.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/33701
http://www.easychair.org/publications/paper/346850
1

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
Capability_Discovery_for_Automated_Reasoning_Systems.pdfPublisher postprint300.64 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.