Cyrus F. Nourani: Descriptive Definability: A Model Computing Perspective on the Tableaux CSIT 2000 : 146-152
By defining descriptive computing on generic diagrams we can correspond admissible sets to descriptive computing and prove certain admissible sets are descriptive computable. Since Beth definability is basic to proving the descriptive computing theorem its computational significance is further explored by connecting it to the Beth tableaux for automated deduction by a model-theoretic theorem. The techniques and the basics on computation with generic model diagrams are presented for applications to planning as goal satisfiablity examples. Generic Tableaux are presented with explicit definable diagrams. Applications to plan proof trees are outlined in brief.
Copyright © 2000 by the Institute for Contemporary Education "JurInfoR-MSU". Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the CSIT copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Institute for Contemporary Education JMSUICE. To copy otherwise, or to republish, requires a fee and/or special permission from the JMSUICE.
Heinz Schweppe and Yuri S. Kabalnov (Eds.): CSIT'2000, Proceedings of 2nd International Workshop on Computer Science and Information Technologies, September 18-23, 2000, Ufa, Russia. USATU Publishers & JurInfoR-MSU Publishing 2000, ISBN 5-86911-312-1