Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electronics Engineering / 電子工程學研究所
  4. Unified Certification of Quantified Boolean Formula Evaluation
 
  • Details

Unified Certification of Quantified Boolean Formula Evaluation

Date Issued
2011
Date
2011
Author(s)
Balabanov, Valeriy
URI
http://ntur.lib.ntu.edu.tw//handle/246246/256772
Abstract
Quantified Boolean Formulas (QBFs) have been widely used in many practical applications, such as: model checking, automated planning, non-monotonic reasoning, scheduling, multi-agent scenarios, etc. Many effective state-of-the-art QBF tools have been developed. However only a few of the modern solvers can certify their answer. The importance of QBF certification is two-fold. First, it ensures the correctness of a solver. Second, perhaps more importantly, if the certificate is in an appropriate form (specifically, in Skolem/Herbrand functions), it enables certain synthesis tasks. The accepted types of certificates are cube resolution proofs and Skolem functions for true QBFs, and clause resolution proofs for false QBFs. The current understanding about QBF certification is incomplete in two aspects. First, the certificate of false QBFs has the missing Skolem-function counterpart. Second, the connection between resolution proofs and Skolem functions remains unclear. These two open questions are resolved in this thesis by bridging the connection between the syntactic (resolution) certificates and the semantic (Skolem-function) certificates, and by piecing out the missing Herbrand-function certificates for false QBFs. Essentially we derive Skolem models from cube resolution proofs and Herbrand countermodels from clause resolution proofs for true and false QBFs, respectively. Practical experience suggests that our approach in combination with some existing QBF solvers can generate many more Skolem models and Herbrand countermodels than prior methods. It enables applications, such as: relation determinization problems, maximum sequential diameter problems, and other. We hope, that this work will encourage QBF-based solving methods in modern logic-synthesis and verification problems.
Subjects
Quantified Boolean Formula
QBF evaluation
certificate
q-resolution
Skolem function
Herbrand function
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-100-R98943159-1.pdf

Size

23.32 KB

Format

Adobe PDF

Checksum

(MD5):d4f3b57968a66d0e4c701f316a6621b0

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science