Abstract: Every logical formalism gives rise to two fundamental problems: model checking and inference. Circumscription is one of the most important and well studied formalisms in the realm of ...
Abstract: We prove decidability of 'non local' propositional CTL*, where truth values of atoms may depend on the branch of evaluation. This result is then used to show decidability of the 'weak' ...
一部の結果でアクセス不可の可能性があるため、非表示になっています。
アクセス不可の結果を表示する