G. Stalmarck. A note on the computational complexity of the pure classical implication calculus. Information Processing Letters, 31(6):277--278, 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....have been checked by means of the Stalmarck theorem prover. This tool can handle large Boolean formulas, by the application of smart algorithms for computations in classical logic. For information on innovative constructions that have been implemented in this theorem prover, see [6, 7]. In order to apply the Stalmarck theorem prover, we have used the Prolog interface NP Module [1] We have also tried to check the safety requirements in an improved BDD based theorem prover [3] but requirements which involve time, such as if a signal shows red for one second , turned out to be ....

G. Stalmarck. A note on the computational complexity of the pure classical implication calculus. Information Processing Letters, 31(6):277--278, 1989.

....have been checked by means of the Stalmarck theorem prover. This tool can handle large Boolean formulas, by the application of smart algorithms for computations in classical logic. For information on innovative constructions that have been implemented in this theorem prover, see [6, 7]. In order to apply the Stalmarck theorem prover, we have used the Prolog interface NP Module [1] We have also tried to check the safety requirements in an improved BDD based theorem prover [3] but requirements which involve time, such as if a signal shows red for one second , turned out to be ....

G. Stalmarck. A note on the computational complexity of the pure classical implication calculus. Information Processing Letters, 31(6):277--278, 1989.

....of desirable properties of VPI. Furthermore, they introduced the verification method described above for VPIs. Fokkink [2] formulated classes of safety criteria for VPIs, and verified instantiations of these classes for the railway yard at Hoorn Kersenboogerd, by means of the Stalmarck [9, 10] and HeerHugo [3] theorem provers. We note that such classes of safety criteria can be obtained from the control tables of a railway yard. Meertens [6] repeated the verification exercise for the larger railway yard at Heerhugowaard, and needed invariants to express that points are never both in ....

G. Stalmarck. A note on the computational complexity of the pure classical implication calculus, Information Processing Letters, 31:277--278, 1989.

....have been checked by means of the Stalmarck theorem prover. This tool can handle large Boolean formulas, by the application of smart algorithms for computations in classical logic. For information on innovative constructions that have been implemented in this theorem prover, see [5, 6]. In order to apply the Stalmarck theorem prover, we have used the Prolog interface NP Module [1] We have also tried to check the safety requirements in an improved BDD based theorem prover [3] but requirements which involve time, such as if a signal shows red for one second , turned out to be ....

Stalmarck, G. A note on the computational complexity of the pure classical implication calculus, Information Processing Letters, 1989, 31, 277--278.

....have been checked by means of the Stalmarck theorem prover. This tool can handle large Boolean formulas, by the application of smart algorithms for computations in classical logic. For information on innovative constructions that have been implemented in this theorem prover, see [6, 7]. In order to apply the Stalmarck theorem prover, we have used the Prolog interface NP Module [1] We have also tried to check the safety requirements in an improved BDD based theorem prover [3] but requirements which involve time, such as if a signal shows red for one second , turned out to be ....

G. Stalmarck. A note on the computational complexity of the pure classical implication calculus. Information Processing Letters, 31(6):277--278, 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC