Compositional verification of knowledge-based task models and problem-solving methods

摘要: In this paper a compositional verification method for task models and problem-solving methods knowledge-based systems is introduced. Required properties of system are formally verified by deriving them from assumptions that themselves sub-components, which in their turn may be derived on sub-sub-components, so on. The based formalized terms temporal semantics; both static dynamic covered. imposes structure the process. Because possibility focusing at one level abstraction (information process hiding), provides transparency limits complexity per level. Since proofs structured manner, they can reused event reuse or modification an existing system. illustrated generic model diagnostic reasoning.