This paper presentes a novel resolution method, T-resolution, based on the first order temporal logic. The primary claim of this method is its soundness and completeness. For this purpose, we construct the correspondi...This paper presentes a novel resolution method, T-resolution, based on the first order temporal logic. The primary claim of this method is its soundness and completeness. For this purpose, we construct the corresponding semantic trees and extend Herbrand's Theorem.展开更多
The temporal logic given by Manna and Pnueli for concurrent program verification has been investigated, whose time structure is isomorphic to natural number set and the operators are □, ◇, ○, U. By analyzing the ma...The temporal logic given by Manna and Pnueli for concurrent program verification has been investigated, whose time structure is isomorphic to natural number set and the operators are □, ◇, ○, U. By analyzing the main methods of the temporal theorem proving, their disadvantages have been revealed, for which a sequent system of propositional temporal logic (PTL) has been established and its soundness and completeness has been proved.展开更多
文摘This paper presentes a novel resolution method, T-resolution, based on the first order temporal logic. The primary claim of this method is its soundness and completeness. For this purpose, we construct the corresponding semantic trees and extend Herbrand's Theorem.
基金Project supported in part by "863" High Tech Projects and by the National Natural Science Foundation of China.
文摘The temporal logic given by Manna and Pnueli for concurrent program verification has been investigated, whose time structure is isomorphic to natural number set and the operators are □, ◇, ○, U. By analyzing the main methods of the temporal theorem proving, their disadvantages have been revealed, for which a sequent system of propositional temporal logic (PTL) has been established and its soundness and completeness has been proved.
