scholarly journals Program Synthesis as Dependency Quantified Formula Modulo Theory

2021 ◽  
Author(s):  
Priyanka Golia ◽  
Subhajit Roy ◽  
Kuldeep S. Meel
Keyword(s):  
Program Synthesis ◽  
General Purpose ◽  
End User ◽  
Domain Specific ◽  
Synthesis Techniques ◽  
Background Theory ◽  
Quantified Boolean Formulas ◽  
Boolean Formulas ◽  
Representation Language ◽  
Specific Synthesis

Given a specification φ(X, Y ) over inputs X and output Y and defined over a background theory T, the problem of program synthesis is to design a program f such that Y = f (X), satisfies the specification φ. Over the past decade, syntax-guided synthesis (SyGuS) has emerged as a dominant approach to program synthesis where in addition to the specification φ, the end-user also specifies a grammar L to aid the underlying synthesis engine. This paper investigates the feasibility of synthesis techniques without grammar, a sub-class defined as T constrained synthesis. We show that T-constrained synthesis can be reduced to DQF(T),i.e., to the problem of finding a witness of a dependency quantified formula modulo theory. When the underlying theory is the theory of bitvectors, the corresponding DQF problem can be further reduced to Dependency Quantified Boolean Formulas (DQBF). We rely on the progress in DQBF solving to design DQBF-based synthesizers that outperform the domain-specific program synthesis techniques; thereby positioning DQBF as a core representation language for program synthesis. Our empirical analysis shows that T-constrained synthesis can achieve significantly better performance than syntax-guided approaches. Furthermore, the general-purpose DQBF solvers perform on par with domain-specific synthesis techniques.

Analysis of Incomplete Circuits Using Dependency Quantified Boolean Formulas

2017 ◽  
pp. 151-168 ◽  
Author(s):  
Ralf Wimmer ◽  
Karina Wimmer ◽  
Christoph Scholl ◽  
Bernd Becker
Keyword(s):  
Quantified Boolean Formulas ◽  
Boolean Formulas

scholarly journals Evaluating Word Similarity Measure of Embeddings Through Binary Classification

2019 ◽  
Vol 1 (3) ◽  
Author(s):  
A. Aziz Altowayan ◽  
Lixin Tao
Keyword(s):  
Similarity Measure ◽  
Binary Classification ◽  
General Purpose ◽  
Feature Representation ◽  
Entity Recognition ◽  
Language Models ◽  
Data Set ◽  
Word Similarity ◽  
Domain Specific ◽  
Retrieval Rate

We consider the following problem: given neural language models (embeddings) each of which is trained on an unknown data set, how can we determine which model would provide a better result when used for feature representation in a downstream task such as text classification or entity recognition? In this paper, we assess the word similarity measure through analyzing its impact on word embeddings learned from various datasets and how they perform in a simple classification task. Word representations were learned and assessed under the same conditions. For training word vectors, we used the implementation of Continuous Bag of Words described in [1]. To assess the quality of the vectors, we applied the analogy questions test for word similarity described in the same paper. Further, to measure the retrieval rate of an embedding model, we introduced a new metric (Average Retrieval Error) which measures the percentage of missing words in the model. We observe that scoring a high accuracy of syntactic and semantic similarities between word pairs is not an indicator of better classification results. This observation can be justified by the fact that a domain-specific corpus contributes to the performance better than a general-purpose corpus. For reproducibility, we release our experiments scripts and results.

scholarly journals Domain-specific Evaluation Dataset Generator for Multilingual Text Analysis

2019 ◽  
pp. 140-147
Author(s):  
Emrah Inan ◽  
Vahab Mostafapour ◽  
Fatif Tekbacak
Keyword(s):  
Text Analysis ◽  
General Purpose ◽  
Entity Linking ◽  
Named Entity ◽  
Domain Specific ◽  
Benchmark Datasets ◽  
Concise Information ◽  
Multilingual Text ◽  
The Given ◽  
Specific Evaluation

Web enables to retrieve concise information about specific entities including people, organizations, movies and their features. Additionally, large amount of Web resources generally lies on a unstructured form and it tackles to find critical information for specific entities. Text analysis approaches such as Named Entity Recognizer and Entity Linking aim to identify entities and link them to relevant entities in the given knowledge base. To evaluate these approaches, there are a vast amount of general purpose benchmark datasets. However, it is difficult to evaluate domain-specific approaches due to lack of evaluation datasets for specific domains. This study presents WeDGeM that is a multilingual evaluation set generator for specific domains exploiting Wikipedia category pages and DBpedia hierarchy. Also, Wikipedia disambiguation pages are used to adjust the ambiguity level of the generated texts. Based on this generated test data, a use case for well-known Entity Linking systems supporting Turkish texts are evaluated in the movie domain.

scholarly journals Bootstrap Domain-Specific Sentiment Classifiers from Unlabeled Corpora

2018 ◽  
Vol 6 ◽  
pp. 269-285 ◽  
Author(s):  
Andrius Mudinas ◽  
Dell Zhang ◽  
Mark Levene
Keyword(s):  
Supervised Learning ◽  
Learning Algorithms ◽  
General Purpose ◽  
Machine Learning Algorithms ◽  
Sentiment Classification ◽  
Two Phase ◽  
Transductive Learning ◽  
Domain Specific ◽  
Sentiment Lexicon ◽  
Supervised Learning Algorithms

There is often the need to perform sentiment classification in a particular domain where no labeled document is available. Although we could make use of a general-purpose off-the-shelf sentiment classifier or a pre-built one for a different domain, the effectiveness would be inferior. In this paper, we explore the possibility of building domain-specific sentiment classifiers with unlabeled documents only. Our investigation indicates that in the word embeddings learned from the unlabeled corpus of a given domain, the distributed word representations (vectors) for opposite sentiments form distinct clusters, though those clusters are not transferable across domains. Exploiting such a clustering structure, we are able to utilize machine learning algorithms to induce a quality domain-specific sentiment lexicon from just a few typical sentiment words (“seeds”). An important finding is that simple linear model based supervised learning algorithms (such as linear SVM) can actually work better than more sophisticated semi-supervised/transductive learning algorithms which represent the state-of-the-art technique for sentiment lexicon induction. The induced lexicon could be applied directly in a lexicon-based method for sentiment classification, but a higher performance could be achieved through a two-phase bootstrapping method which uses the induced lexicon to assign positive/negative sentiment scores to unlabeled documents first, a nd t hen u ses those documents found to have clear sentiment signals as pseudo-labeled examples to train a document sentiment classifier v ia supervised learning algorithms (such as LSTM). On several benchmark datasets for document sentiment classification, our end-to-end pipelined approach which is overall unsupervised (except for a tiny set of seed words) outperforms existing unsupervised approaches and achieves an accuracy comparable to that of fully supervised approaches.

scholarly journals Synthesizing Action Sequences for Modifying Model Decisions

2020 ◽  
Vol 34 (04) ◽  
pp. 5462-5469
Author(s):  
Goutham Ramakrishnan ◽  
Yun Chan Lee ◽  
Aws Albarghouthi
Keyword(s):  
Neural Networks ◽  
Deep Neural Networks ◽  
Program Synthesis ◽  
Test Time ◽  
Domain Specific ◽  
Action Sequences

When a model makes a consequential decision, e.g., denying someone a loan, it needs to additionally generate actionable, realistic feedback on what the person can do to favorably change the decision. We cast this problem through the lens of program synthesis, in which our goal is to synthesize an optimal (realistically cheapest or simplest) sequence of actions that if a person executes successfully can change their classification. We present a novel and general approach that combines search-based program synthesis and test-time adversarial attacks to construct action sequences over a domain-specific set of actions. We demonstrate the effectiveness of our approach on a number of deep neural networks.

Sign in / Sign up

Export Citation Format

Share Document