Resolve and Expand

نویسنده

  • Armin Biere
چکیده

We present a novel expansion based decision procedure for quantified boolean formulas (QBF) in conjunctive normal form (CNF). The basic idea is to resolve existentially quantified variables and eliminate universal variables by expansion. This process is continued until the formula becomes propositional and can be solved by any SAT solver. On structured problems our implementation quantor is competitive with state-of-the-art QBF solvers based on DPLL. It is orders of magnitude faster on certain hard to solve instances.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of First Order Transitions with Gravity Duals

A first order phase transition usually proceeds by nucleating bubbles of the new phase which then rapidly expand. In confining gauge theories with a gravity dual, the deconfined phase is often described by a black hole. If one starts in this phase and lowers the temperature, the usual description of how the phase transition proceeds violates the area theorem. We study the dynamics of this phase...

متن کامل

Integration of Multiple Segmentation Based Environment Models

An environment model that is constructed using a single image has the problem of a blurring effect caused by the fixed resolution, and the stretching effect of the 3D model caused when information that does not exist on the image occurs due to the occlusion. This paper introduces integration method using multiple images to resolve the above problem. This method can express parallex effect and e...

متن کامل

To Expand or Not to Expand: Automatically Verifying Software Specified With Complex Mathematical Definitions

An attractive strategy for writing human-readable modelbased software specifications is to hide complexity, normally including quantifiers, inside mathematical definitions. A mathematical function or predicate may be defined in one of two ways: explicitly, i.e., as direct shorthand for another expression; or implicitly, i.e., via properties (perhaps including inductive ones) that uniquely chara...

متن کامل

A New Framework for Sensor Interpretation: Planning to Resolve Sources of Uncertainty

Sensor interpretation involves the determination of high-level explanations of sensor data. Blackboard-based interpretation systems have usually been limited to incremental hypothesize and test strategies for resolving uncertainty. We have developed a new interpretation framework that supports the use of more sophisticated strategies like diierential diagnosis. The RESUN framework has two key c...

متن کامل

SVM-Based Biological Named Entity Recognition Using Minimum Edit-Distance Feature Boosted by Virtual Examples

In this paper, we propose two indepentent solutions to resolve the problems of many different spelling variants and of lack of annotated corpus for training, which are two main difficulties in SVM(Support-Vector Machine) and other machine-learning based biological named entity recognition. To resolve the problem of spelling variants, we propose a use of edit-distance as a feature for SVM. We al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004