Skip to main content
English
中文
Log In
Log in
Log in with ORCID
NTU Single Sign On
New user? Click here to register.
Have you forgotten your password?
Home
College of Electrical Engineering and Computer Science / 電機資訊學院
Computer Science and Information Engineering / 資訊工程學系
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.
Details
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.
Journal
J. ACM
Journal Volume
38
Journal Issue
3
Pages
559-587
Date Issued
1991
Author(s)
Hsiang, Jieh
Rusinowitch, Michaël
JIEH HSIANG
DOI
10.1145/116825.116833
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/488704
URL
https://doi.org/10.1145/116825.116833
Type
journal article
