Extending automatic theorem proving by planning

  • A general concept for combining planning with automatic theorem provingis introduced. From this a system architecture based on the notion of planningtrees, methods and sensors is developed. It is illustrated by examples taken fromthe domain of sorting algorithms.

Download full text files

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author:Inger Sonntag, Jörg Denzinger
URN:urn:nbn:de:hbz:386-kluedo-3149
Series (Serial Number):SEKI Report (93,2)
Document Type:Preprint
Language of publication:English
Year of Completion:1993
Year of first Publication:1993
Publishing Institution:Technische Universität Kaiserslautern
Date of the Publication (Server):1999/09/01
Faculties / Organisational entities:Kaiserslautern - Fachbereich Informatik
DDC-Cassification:0 Allgemeines, Informatik, Informationswissenschaft / 004 Informatik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011