محبوبترین نویسندگان :
نویسندگان مقالات پربازدید :
مجله استدلال خودکار 2013
جزئیات رویداد
اینستاگرام تی پی بین
همایش ، رویداد ، ژورنال

  • generalising unit-refutation completeness and slur via nested input resolution

    نویسندگان :
    کلمات کلیدی :
    جزئیات بیشتر مقاله
    • تاریخ ارائه: 1392/07/24
    • تاریخ انتشار در تی پی بین: 1392/07/24
    • تعداد بازدید: 895
    • تعداد پرسش و پاسخ ها: 0
    • شماره تماس دبیرخانه رویداد: -
     the class slur (single lookahead unit resolution) was introduced in schlipf et al. (inf process lett 54:133–137, 1995) as an umbrella class for efficient (poly-time) sat solving, with linear-time sat decision, while the recognition problem was not considered. čepek et al. (2012) and balyo et al. (2012) extended this class in various ways to hierarchies covering all of cnf (all clause-sets). we introduce a hierarchy slurk which we argue is the natural “limit” of such approaches. the second source for our investigations is the class uc of unit-refutation complete clause-sets, introduced in del val (1994) as a target class for knowledge compilation. via the theory of “hardness” of clause-sets as developed in kullmann (1999), kullmann (ann math artif intell 40(3–4):303–352, 2004) and ansótegui et al. (2008) we obtain a natural generalisation uck, containing those clause-sets which are “unit-refutation complete of level k”, which is the same as having hardness at most k. utilising the strong connections to (tree-)resolution complexity and (nested) input resolution, we develop basic methods for the determination of hardness (the level k in uck). a fundamental insight now is that slurk=uck holds for all k. we can thus exploit both streams of intuitions and methods for the investigations of these hierarchies. as an application we can easily show that the hierarchies from čepek et al. (2012) and balyo et al. (2012) are strongly subsumed by slurk. finally we consider the problem of “irredundant” clause-sets in uck. for 2-cnf we show that strong minimisations are possible in polynomial time, while already for (very special) horn clause-sets minimisation is np-complete. we conclude with an extensive discussion of open problems and future directions. we envisage the concepts investigated here to be the starting point for a theory of good sat translations, which brings together the good sat-solving aspects from slur together with the knowledge-representation aspects from uc, and expands this combination via notions of “hardness”.

سوال خود را در مورد این مقاله مطرح نمایید :

با انتخاب دکمه ثبت پرسش، موافقت خود را با قوانین انتشار محتوا در وبسایت تی پی بین اعلام می کنم
مقالات جدیدترین رویدادها
مقالات جدیدترین ژورنال ها