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.

Export metadata

  • Export Bibtex
  • Export RIS

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Inger Sonntag, Jörg Denzinger
URN (permanent link):urn:nbn:de:hbz:386-kluedo-3149
Serie (Series number):SEKI Report (93,2)
Document Type:Preprint
Language of publication:English
Year of Completion:1993
Year of Publication:1993
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):1999/09/01
Faculties / Organisational entities:Fachbereich Informatik
DDC-Cassification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581 $