Automated reasoning with function evaluation for COCOLOG - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Automated reasoning with function evaluation for COCOLOG


We introduced a logic for the study of dynamical control systems which we called a Conditional Observer Logic for finite machines (Cocolog). In that paper the properties of consistency and completeness for each first order logical theory in the tree of such theories in a Cocolog were established. The efficacy of automatic theorem proving is a crucial issue in the implementation of Cocolog. In this paper, we present a function evaluation based resolution, called FE-resolution, for Cocolog. The unique model property of Cocolog is first proved via the complete axiomatization property and then the decidability property of any theory in a Cocolog is deduced. Finally, completeness and complexity reduction of FE-resolution is discussed in terms of relative truthfulness and validity.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1713.pdf (1.18 Mo) Télécharger le fichier

Dates and versions

inria-00076951 , version 1 (29-05-2006)


  • HAL Id : inria-00076951 , version 1


Suning Wang, Peter E. Caines. Automated reasoning with function evaluation for COCOLOG. [Research Report] RR-1713, INRIA. 1992. ⟨inria-00076951⟩
89 View
67 Download


Gmail Facebook Twitter LinkedIn More