NDLI: Efficient extraction of Skolem functions from QRAT proofs

Content Provider	IEEE Xplore Digital Library
Author	Heule, M.J.H. Seidl, M. Biere, A.
Copyright Year	2014
Description	Author affiliation: Univ. of Texas at Austin, Austin, TX, USA (Heule, M.J.H.) \|\| Johannes Kepler Univ., Linz, Austria (Seidl, M.; Biere, A.)
Abstract	Many synthesis problems can be solved by formulating them as a quantified Boolean formula (QBF). For such problems, a mere true/false answer is often not enough. Instead, expressing the answer in terms of Skolem functions reflecting the quantifier dependencies of the variables is required. Several approaches have been presented to extract such functions from term-resolution proofs. However, not all solvers and preprocessors are able to produce term-resolution proofs, especially when universal expansion is involved. In previous work, we developed the QRAT proof system consisting of three simple rules which allowed us to overcome this issue and to equip modern expansion-based tools like the preprocessor bloqqer with proof tracing. In this paper, we show how to extract Skolem functions from QRAT proofs. We present a general extraction tool and compare its performance to similar resolution-based tools. We show that the Skolem functions extracted from QRAT proofs are smaller than those produced by alternative approaches making our method in particular useful for synthesis applications.
Starting Page	107
Ending Page	114
File Size	927907
Page Count	8
File Format	PDF
ISBN	9780983567844
DOI	10.1109/FMCAD.2014.6987602
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-10-21
Publisher Place	Switzerland
Access Restriction	Subscribed
Rights Holder	FMCAD and the authors
Subject Keyword	Context Boolean functions Redundancy Games Educational institutions Encoding Arrays
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A.: Efficient Extraction of Skolem Functions from QRAT Proofs (2014)

Complementary arrays — New directions

Encoding multi-valued functions for symmetry

Boolean decomposition of programmable logic arrays

DCCA-Secure Public-Key Encryptions from Hybrid Paradigms

Fault tolerant circuits and probabilistically checkable proofs

Efficient signatures with linear space complexity for detecting Boolean function equivalence

Detecting Engagement in HRI: An Exploration of Social and Task-Based Context

A Formal Study of Boolean Games with Random Formulas as Payoff Functions

Efficient extraction of Skolem functions from QRAT proofs

Similar Documents

A.: Efficient Extraction of Skolem Functions from QRAT Proofs (2014)

Complementary arrays — New directions

Encoding multi-valued functions for symmetry

Boolean decomposition of programmable logic arrays

DCCA-Secure Public-Key Encryptions from Hybrid Paradigms

Fault tolerant circuits and probabilistically checkable proofs

Efficient signatures with linear space complexity for detecting Boolean function equivalence

Detecting Engagement in HRI: An Exploration of Social and Task-Based Context

A Formal Study of Boolean Games with Random Formulas as Payoff Functions

Efficient extraction of Skolem functions from QRAT proofs