A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Many experts argue that the future of artificial intelligence is limited by the field's ability to integrate symbolic logical reasoning into deep learning architectures. The recently proposed differentiable MAXSAT solver, SATNet, was a breakthrough in its capacity to integrate with a traditional neural network and solve visual reasoning problems. For instance, it can learn the rules of Sudoku purely from image examples. Despite its success, SATNet was shown to succumb to a key challenge inarXiv:2106.11072v1 fatcat:y4di2d4abjh4xhki6bb6mdqww4
more »... symbolic systems known as the Symbol Grounding Problem: the inability to map visual inputs to symbolic variables without explicit supervision ("label leakage"). In this work, we present a self-supervised pre-training pipeline that enables SATNet to overcome this limitation, thus broadening the class of problems that SATNet architectures can solve to include datasets where no intermediary labels are available at all. We demonstrate that our method allows SATNet to attain full accuracy even with a harder problem setup that prevents any label leakage. We additionally introduce a proofreading method that further improves the performance of SATNet architectures, beating the state-of-the-art on Visual Sudoku.
We propose a simple and effective bug finder, XCheck, which is a proof of concept bug-finder based on the so-called "micro-grammar".The key advantage of XCheck is its extreme simplicity and surprising effectiveness. It only consists of a few hundred lines of code but is capable of checking many complicated software systems like Linux, LLVM, OpenJDK, which are written in various different languages (e.g., C, C++, Java).arXiv:2112.08010v1 fatcat:faax6wmcrnhezifjm6buhhysgy
Lecture Notes in Computer Science
This paper aims to improve the efficiency of unsat coreguided MaxSAT solving on a sequence of similar problem instances. In particular, we consider the case when the sequence is constructed by adding new hard or soft clauses. Our approach is akin to the well-known idea of incremental SAT solving. However, we show that there are important differences between incremental SAT and incremental MaxSAT, where a straightforward implementation may lead to a sharp decrease in performance. We presentdoi:10.1007/978-3-319-44953-1_30 fatcat:ryzynklnyvdphi4jpbt7peinlm
more »... natives that enable to cope with such issues. The presented algorithm is implemented and evaluated on practical problems. It solves more instances and yields an average speedup of 1.8× on previously solvable instances.
Lecture Notes in Computer Science
A central challenge in software analysis concerns balancing different competing tradeoffs. To address this challenge, we propose an approach based on the Maximum Satisfiability (MaxSAT) problem, an optimization extension of the Boolean Satisfiability (SAT) problem. We demonstrate the approach on three diverse applications that advance the state-of-the-art in balancing tradeoffs in software analysis. Enabling these applications on real-world programs necessitates solving large MaxSAT instancesdoi:10.1007/978-3-319-63387-9_4 fatcat:5d7clvdjwzbi5ffgmbworrztni
more »... mprising over 10 30 clauses in a sound and optimal manner. We propose a general framework that scales to such instances by iteratively expanding a subset of clauses while providing soundness and optimality guarantees. We also present new techniques to instantiate and optimize the framework.
We propose prioritized unit propagation with periodic resetting, which is a simple but surprisingly effective algorithm for solving random SAT instances that are meant to be hard. In particular, an evaluation on the Random Track of the 2017 and 2018 SAT competitions shows that a basic prototype of this simple idea already ranks at second place in both years. We share this observation in the hope that it helps the SAT community better understand the hardness of random instances used inarXiv:1912.05906v1 fatcat:oi4i3id4cneitpmngevcqtmksy
more »... ns and inspire other interesting ideas on SAT solving.
Lecture Notes in Computer Science
Si, A. Naik-Both authors contributed equally to the paper. ...doi:10.1007/978-3-030-53291-8_9 fatcat:zwzve6xymvezrie4rdbv6uwj3u
For brevity, we only discuss accesses to fields request and controlSocket, which 57:4 Xin Zhang, Radu Grigore, Xujie Si, and Mayur Naik Input Relations: access(p, o) (program point p accesses some field ... Informally, an ILP instance is a set of inequalities and equalities, where variables and constants are constrained to be integers. 57:12 Xin Zhang, Radu Grigore, Xujie Si, and Mayur Naik Algorithm ...doi:10.1145/3133881 dblp:journals/pacmpl/ZhangGSN17 fatcat:zsar2gzvvrehri57dim3a6wwyq
Inductive generalization (IG) is the key to the efficiency of modern Symbolic Model Checkers (SMCs). In this paper, we introduce a data-driven method for inductive generalization, whose performance can be automatically improved through historical runs over similar instances. Our method is inspired by recent advances for the part-of-speech (PoS) tagging problem in natural language processing (NLP). Specifically, we use a hierarchical recurrent neural network augmented with syntactic and semanticdoi:10.34727/2021/isbn.978-3-85448-046-4_17 fatcat:22fq5ladezaufjftykytdegw7m
more »... information to predict essential parts of a proof obligation that could be generalized, instead of checking each part one by one. We develop a prototype called ROPEY by incorporating our method into SPACER -a state-of-the-art SMC, and perform evaluations on the KIND2's simulation benchmarks. ROPEY is evaluated in two settings: online learning -for a given instance, we run SPACER for a number of iterations and collect its trace on which ROPEY is trained, and then use ROPEY to guide SPACER to finish the remaining solving process; and transfer learning -ROPEY is trained over historical runs of SPACER in advance, and for future instances, ROPEY is used directly to guide SPACER from the very beginning. For non-trivial benchmarks, ROPEY perfectly answers 72% and 77% of the queries in the online and transfer learning settings, respectively. While the speed improvement is not the focus of the paper, our preliminary results are promising: for non-trivial instances, ROPEY's end-toend running time is 25% faster.
European Magazine and London Review
K, J liK LONDON REVIi:\V, AND LITF.n^RT JOURNAL, FOK SI'.PTFMHER ISOJ. ^viD iiT rvLcnivM, <^oiD Tvirt, q^uiD otili, <)^oid non. ... If was not called Si/yl'h'tun from .'siu j hiH. Jt was rlenominnted from the jx-rfon iwp.icif^ and called u''j Toil the Ulyjfedn pro¬ montory. ...
Měnové krachy bývají vážnějšími událostmi, když vlády explicitně nebo implicitně fi xují (nebo téměř fi xují) měnový kurz. ... Mnoho hráčů v globálním fi nančním systému si často vykope mnohem větší dluhovou past, než o jaké by mohli rozumně předpokládat, že se jim z ní podaří uniknout. ...doi:10.18267/j.polek.1027 fatcat:h76n6kwuvnc2dldk7qmdxejawe
of 7 Xujie Tong et al. Trapezoid-kinoform zone plate lens J. Synchrotron Rad. (2022). 29 J. Synchrotron Rad. (2022). 29 Xujie Tong et al. ... Trapezoid-kinoform zone plate lens 3 of 7 of 7 Xujie Tong et al. Trapezoid-kinoform zone plate lens J. Synchrotron Rad. (2022). 29 J. Synchrotron Rad. (2022). 29 Xujie Tong et al. ...doi:10.1107/s1600577522000893 pmid:35254301 pmcid:PMC8900836 fatcat:t36kcx7hibgcdlouakclcqgwr4
Yu, Jian She Yu, Jin Chang Yu, Jing Yuan Yu, Wen Guang Yu, Wen Huan Yu, Xujie Yu, Yuan Hong Wee sascccdecsce Yuan, Weiying Yuan, Xue Hai Yuan, Zian-Zhi Yue, Xi Ting Yuen, Kam C. ...... Yuferev, S. ... York, Bryant W. ............ a We A Sia si vec cenckcenecicas 58128,58136,58145,58166 Yorozu, Shinsuke Yoshida, Nakahiro Yoshida, Zensho Yoshise, Akiko Yotsutani, Shoji You, Yun Cheng Young, Kenneth .. ...
A 1000W Oriel solar simulator was used as a light source and the power of the light was calibrated to one sun light intensity by using a NREL-calibrated Si cell . ...doi:10.1039/c1dt11124h pmid:22042168 fatcat:a3kpdos62neeph2hze73xgyc6y
Besides, decreased apoptotic rate after knockdown of miRNA-19b-3p was elevated by transfection of si-PTEN (Figure 4(c)). ... HCM cells were cultured in H/R environment and transfected with miRNA-19b-3p inhibitor or miRNA-19b-3p inhibitor + si-PTEN. (b) Viability. (c) Apoptotic rate. ...doi:10.1155/2021/9956666 pmid:34956421 pmcid:PMC8702358 fatcat:ibe323ayzzcmbeq2kwaudbsdzu
Si (University of Pennsylvania -Philadelphia, US) Xujie Si Joint work of Xujie Si, Mukund Raghothaman, Kihong Heo, Mayur Naik Main reference Xujie Si, Mukund Raghothaman, Kihong Heo, Mayur Naik: "Synthesizing ... Ana Ozaki Joint work of Ricardo Duarte, Boris Konev, Carsten Lutz, Ana Ozaki, Frank Wolter Ana Ozaki (Free University of Bozen-Bolzano, IT) License Creative Commons BY 3.0 Unported license © Xujie ...doi:10.4230/dagrep.9.9.1 dblp:journals/dagstuhl-reports/BenediktKKN19 fatcat:rwjks5mydzhctlvedtel3vtzoy
« Previous Showing results 1 — 15 out of 131 results