Scholarlink

<p>The circumscription is an elegant non-monotonic logic. However, computing circumscription remains challenging due to its computational complexity. This paper presents a weighted partial Maximum Satisfiability (MaxSAT) encoding approach that addresses circumscription, allowing us to leverage state-of-the-art MaxSAT solvers for efficient computation. This approach introduces a linear-time encoding scheme that captures both parallel and prioritized circumscription without requiring fresh predicates. Furthermore, we develop a systematic model enumeration strategy using blocking clauses, which enables the complete and efficient enumeration of circumscription models while avoiding redundancy. Extensive experiments have been conducted on benchmarks such as model-based circuit diagnostics, random and industrial SAT problems, and extended stable marriage problems. The results indicate that our MaxSAT-based implementation, <Emphasis FontCategory="NonProportional">circ-maxsat</Emphasis>, achieves comparable performance with state-of-the-art methods such as <Emphasis FontCategory="NonProportional">circ2dlp</Emphasis> and <Emphasis FontCategory="NonProportional">aspino</Emphasis>. Notably, <Emphasis FontCategory="NonProportional">circ-maxsat</Emphasis> outperforms other solvers on the (extended) stable marriage problem in terms of computational efficiency. This study advances the computation of circumscription and introduces new applications of MaxSAT in non-monotonic reasoning.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A MaxSAT-based framework for computing circumscription

  • 期刊论文

  • 发表日期：

    2026年1月5日

查看全文
  • Zhongtao Xie,
  • Yisong Wang,
  • Lei Yang,
  • Hongbo Hu

摘要

The circumscription is an elegant non-monotonic logic. However, computing circumscription remains challenging due to its computational complexity. This paper presents a weighted partial Maximum Satisfiability (MaxSAT) encoding approach that addresses circumscription, allowing us to leverage state-of-the-art MaxSAT solvers for efficient computation. This approach introduces a linear-time encoding scheme that captures both parallel and prioritized circumscription without requiring fresh predicates. Furthermore, we develop a systematic model enumeration strategy using blocking clauses, which enables the complete and efficient enumeration of circumscription models while avoiding redundancy. Extensive experiments have been conducted on benchmarks such as model-based circuit diagnostics, random and industrial SAT problems, and extended stable marriage problems. The results indicate that our MaxSAT-based implementation, circ-maxsat, achieves comparable performance with state-of-the-art methods such as circ2dlp and aspino. Notably, circ-maxsat outperforms other solvers on the (extended) stable marriage problem in terms of computational efficiency. This study advances the computation of circumscription and introduces new applications of MaxSAT in non-monotonic reasoning.