|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|376787||658313||2016||11 صفحه PDF||سفارش دهید||دانلود رایگان|
Propositional Satisfiability (SAT) solvers are routinely used for solving many function problems. A natural question that has seldom been addressed is: what is the number of calls to a SAT solver for solving some target function problem? This article improves upper bounds on the query complexity of solving several function problems defined on propositional formulas. These include computing the backbone of a formula and computing the set of independent variables of a formula. For the general case of monotone predicates, the article improves upper bounds on the query complexity of computing a minimal set when the number of minimal sets is constant. This applies for example to the computation of a minimal unsatisfiable subset (MUS) for CNF formulas, but also to the computation of prime implicants and implicates, with immediate application in a number of AI settings.
Journal: Artificial Intelligence - Volume 233, April 2016, Pages 73–83