601 results on '"Conjunctive normal form"'
Search Results
2. An Algorithm to Belief Revision and to Verify Consistency of a Knowledge Base
- Author
-
Guillermo De Ita Luna and Pedro Bello López
- Subjects
Theoretical computer science ,General Computer Science ,Computer science ,business.industry ,String (computer science) ,Inference ,Consistency (knowledge bases) ,Belief revision ,Knowledge-based systems ,Knowledge base ,Electrical and Electronic Engineering ,Conjunctive normal form ,Boolean satisfiability problem ,business - Abstract
The belief revision process involves several problems considered hard. One of the crucial problems is how to represent to the knowledge base K to consider, as well as how to represent and to add new information , which may even be contradictory to the knowledge base. In this work, both the knowledge base and the new information are in conjunctive normal form. Each clause of a conjunctive normal form is encoded by a string consisting of: 0, 1, *, representing the falsifying assignments of the clause. To use the falsifying assignments of the clauses allows to perform efficiently different logical operators among conjunctive forms. Our belief revision process (K * ) between conjunctive forms is based on solving first the propositional inference, i.e. K = . Based on to count falsifying assignments represented by tertiary chains, an algorithmic proposal is made that allows to determine in a practical way, when (K E ( K * )) is inconsistent. Finally, the time-complexity analysis of our algorithmic proposal is carried out.
- Published
- 2021
3. QuantifyML: How Good is my Machine Learning Model?
- Author
-
Corina S. Păsăreanu, Muhammad Usman, and Divya Gopinath
- Subjects
FOS: Computer and information sciences ,Model checking ,Computer Science - Machine Learning ,Ground truth ,Artificial neural network ,Computer Science - Artificial Intelligence ,Learnability ,Computer science ,business.industry ,Machine learning ,computer.software_genre ,Machine Learning (cs.LG) ,Software Engineering (cs.SE) ,Computer Science - Software Engineering ,Artificial Intelligence (cs.AI) ,Robustness (computer science) ,Artificial intelligence ,Conjunctive normal form ,business ,computer ,Test data - Abstract
The efficacy of machine learning models is typically determined by computing their accuracy on test data sets. However, this may often be misleading, since the test data may not be representative of the problem that is being studied. With QuantifyML we aim to precisely quantify the extent to which machine learning models have learned and generalized from the given data. Given a trained model, QuantifyML translates it into a C program and feeds it to the CBMC model checker to produce a formula in Conjunctive Normal Form (CNF). The formula is analyzed with off-the-shelf model counters to obtain precise counts with respect to different model behavior. QuantifyML enables i) evaluating learnability by comparing the counts for the outputs to ground truth, expressed as logical predicates, ii) comparing the performance of models built with different machine learning algorithms (decision-trees vs. neural networks), and iii) quantifying the safety and robustness of models., In Proceedings FMAS 2021, arXiv:2110.11527
- Published
- 2021
4. Constraint Solving for Synthesis and Verification of Threshold Logic Circuits
- Author
-
Nian-Ze Lee and Jie-Hong R. Jiang
- Subjects
Computer science ,Formal equivalence checking ,Computer Graphics and Computer-Aided Design ,Multiplexer ,Logic synthesis ,Logic gate ,Subset sum problem ,Electrical and Electronic Engineering ,Conjunctive normal form ,Boolean function ,Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION ,Algorithm ,Software ,Logic programming - Abstract
Threshold logic (TL) circuits gain increasing attention due to their feasible realization with emerging technologies and strong bind to neural network applications. In this work, we devise techniques for automatic synthesis and verification of TL circuits based on constraint solving. For synthesis, we formulate a fundamental operation to collapse TL functions, and derive a necessary and sufficient condition of collapsibility for linear combination of two TL functions. An approach based on solving the subset sum problem is proposed for fast circuit transformation. For verification, we propose a procedure to convert a TL function to a multiplexer (MUX) tree and to pseudo-Boolean (PB) constraints for formal Boolean and PB reasoning, respectively. Experiments on synthesis show that the collapse operation further reduces gate counts of synthesized TL circuits by an average of 18%. Experiments on verification demonstrate good scalability of the MUX-based method for equivalence checking of synthesized TL circuits, and efficiency of PB constraint conversion in cases where the conjunctive normal form (CNF) formula conversion and MUX tree conversion suffer from memory explosion.
- Published
- 2021
5. Inference Approach Based on Petri Nets
- Author
-
MengChu Zhou, Huai Ju Luo, Kai Cheng Tan, and Ji Liang Luo
- Subjects
Information Systems and Management ,Theoretical computer science ,Computational complexity theory ,Computer science ,05 social sciences ,050301 education ,Inference ,02 engineering and technology ,Petri net ,computer.software_genre ,Propositional calculus ,Computer Science Applications ,Theoretical Computer Science ,Constraint (information theory) ,Intelligent agent ,Artificial Intelligence ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Conjunctive normal form ,0503 education ,computer ,Boolean data type ,Software - Abstract
An inference approach is proposed by formulating reasoning processes as particular evolutions of Petri nets. It can be used to design an intelligent agent that executes tasks in a given environment. First, a symbol Petri net is defined to represent a Boolean variable describing a distinct aspect of an environment. Second, a propositional logic sentence in a conjunctive normal form, which may express some background knowledge or a sequence of percepts made by an agent, is formulated as a linear constraint, called as a semantic constraint. Third, an algorithm is constructed to design monitor places enforcing semantic constraints on symbol Petri nets, and its resultant net is called a knowledge Petri net representing relevant knowledge. Fourth, a reasoning algorithm is presented based on a newly defined transition-firing rule of the knowledge Petri net, and can be used to infer or reveal hidden facts. The proposed inference algorithm is efficient since its time computational complexity is proven to be polynomial with respect to the number of Boolean variables. The wumpus world problem is taken as an example to illustrate and verify it.
- Published
- 2021
6. Reasoning and learning with context logic
- Author
-
Hedda R. Schmidtke
- Subjects
Theoretical computer science ,Renewable Energy, Sustainability and the Environment ,Computer Networks and Communications ,Computer science ,010401 analytical chemistry ,Probabilistic logic ,020206 networking & telecommunications ,02 engineering and technology ,Semantic reasoner ,Disjunctive normal form ,Propositional calculus ,01 natural sciences ,0104 chemical sciences ,Computer Science Applications ,Decidability ,Symbol grounding ,Description logic ,Artificial Intelligence ,0202 electrical engineering, electronic engineering, information engineering ,Conjunctive normal form - Abstract
Context logic (CL), a logical language similar in style to description logics but with a more cognitive motivation as a logical language of cognition, was developed since 2007 to provide a new approach to the symbol grounding problem, a key problem for reliable intelligent environments and other intelligent sensory systems. CL is a three-layered integrated hierarchy of languages: a relational base layer with the expressiveness of propositional logic (CLA), a quantifier-free decidable language (CL0), and an expressive language with full quantification (CL1). As was shown in 2018, the core CLA reasoning can be implemented on a variant of Kanerva’s Vector Symbolic Architecture, the activation bit vector machine (ABVM), shedding new light on the fundamental cognitive faculties of symbol grounding and imagery, but the system raised two questions: first, the core reasoning algorithm was a classical EXPTIME reasoner; second, fundamental aspects for a learning algorithm were sketched but not presented with a full algorithm. This paper addresses those two questions. We present a probabilistic linear time algorithm for reasoning over conjunctive normal form (CNF) CLA formulae together with a dual probabilistic linear time algorithm for learning CLA statements by collecting experienced snapshots in a disjunctive normal form (DNF).
- Published
- 2021
7. An Anonymous Credential System with Constant-Size Attribute Proofs for CNF Formulas with Negations
- Author
-
Toru Nakanishi and Ryo Okishima
- Subjects
Authentication ,Theoretical computer science ,Computer science ,Applied Mathematics ,Mathematical proof ,Certificate ,Computer Graphics and Computer-Aided Design ,Credential ,Accumulator (cryptography) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Constant (computer programming) ,Negation ,Signal Processing ,Electrical and Electronic Engineering ,Conjunctive normal form - Abstract
To enhance the user’s privacy in electronic ID, anonymous credential systems have been researched. In the anonymous credential system, a trusted issuing organization first issues a certificate certifying the user’s attributes to a user. Then, in addition to the possession of the certificate, the user can anonymously prove only the necessary attributes. Previously, an anonymous credential system was proposed, where CNF (Conjunctive Normal Form) formulas on attributes can be proved. The advantage is that the attribute proof in the authentication has the constant size for the number of attributes that the user owns and the size of the proved formula. Thus, various expressive logical relations on attributes can be efficiently verified. However, the previous system has a limitation: the proved CNF formulas cannot include any negation. Therefore, in this paper, we propose an anonymous credential system with constant-size attribute proofs such that the user can prove CNF formulas with negations. For the proposed system, we extend the previous accumulator for the limited CNF formulas to verify CNF formulas with negations.
- Published
- 2020
8. Speeding Up Functional Timing Analysis by Concise Formulation of Timed Characteristic Functions
- Author
-
Aaron C.-W. Liang, Charles H.-P. Wen, and Denny C.-Y. Wu
- Subjects
Speedup ,Computer science ,Computation ,Static timing analysis ,02 engineering and technology ,Function (mathematics) ,Computer Graphics and Computer-Aided Design ,Satisfiability ,020202 computer hardware & architecture ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Logic gate ,0202 electrical engineering, electronic engineering, information engineering ,Redundancy (engineering) ,Electrical and Electronic Engineering ,Conjunctive normal form ,Algorithm ,Software - Abstract
Functional timing analysis (FTA) is a renowned method of finding the true critical delay for the design under interest. By constructing conjunctive normal form (CNF) clauses based on temporal and function constraints, false paths can be identified through the satisfiability (SAT) solving. As a result, the critical delay estimated by FTA is more accurate than that by conventional static timing analysis (STA). However, FTA suffers from the extremely long formulation and computation time, as the number of the clauses in CNF grows exponentially with the increasing size of the design. Due to the reconvergent effect, thousands of clauses can be redundantly formulated for one pin. Even worse, most of them are found useless but seriously lengthen the computation time. Therefore, to avoid ineffective computation in FTA, three novel techniques are proposed: 1) encoding duplication removal (EDR) for removing duplicated functional literals; 2) redundant state propagation (RSP) for propagating temporal states to identify redundant clauses; and 3) temporal footprint identification (TFI) for combining clauses that represent constraints with the same behavior. The experiments show that under a given timing constraint, 94% clauses and 95% literals can be pruned averagely (99% clauses and 99% literals under the best case), resulting in $15.3 \times $ speedup ( $72.99 \times $ under the best case) for formulation and SAT solving. As a result, the proposed techniques (EDR, RSP, and TFI) are proven effective to reduce useless computation and improve the overall performance of FTA.
- Published
- 2020
9. Constrained Pseudo-Propositional Logic
- Author
-
Ahmad-Saher Azizi-Sultan
- Subjects
Discrete mathematics ,Soundness ,Logic ,Computer science ,Applied Mathematics ,010102 general mathematics ,Natural number ,06 humanities and the arts ,0603 philosophy, ethics and religion ,Propositional calculus ,01 natural sciences ,Set (abstract data type) ,Constraint (information theory) ,Range (mathematics) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Computer Science::Logic in Computer Science ,Completeness (logic) ,060302 philosophy ,0101 mathematics ,Conjunctive normal form - Abstract
Propositional logic, with the aid of SAT solvers, has become capable of solving a range of important and complicated problems. Expanding this range, to contain additional varieties of problems, is subject to the complexity resulting from encoding counting constraints in conjunctive normal form (CNF). Due to the limitation of the expressive power of propositional logic, generally, such an encoding increases the numbers of variables and clauses excessively. This work eliminates the indicated drawback by interpolating constraint symbols and the set of natural numbers $${\mathbb {N}}$$ into the alphabet of propositional logic and adjusting the underlying language accordingly. In the extended logic counting constraints are naturally formulated, while many important aspects, such as Boolean nature and the soundness and completeness theorems, are kept preserved.
- Published
- 2020
10. Dynamic programming algorithms for computing power indices in weighted multi-tier games
- Author
-
Ingo Wilms
- Subjects
Sociology and Political Science ,Binary decision diagram ,Computer science ,05 social sciences ,ComputingMilieux_PERSONALCOMPUTING ,General Social Sciences ,Type (model theory) ,Power (physics) ,Set (abstract data type) ,Dynamic programming ,0502 economics and business ,050206 economic theory ,Statistics, Probability and Uncertainty ,Multi tier ,Conjunctive normal form ,Algorithm ,General Psychology ,050205 econometrics - Abstract
In weighted games each voter has a weight assigned and “yes”-voters win if the sum of each weight is greater than or equal to the quota. In weighted multi-tier games, we have several weighted games (tiers) over the same set of voters. In this article, algorithms for calculating Banzhaf and Shapley–Shubik indices for three different type of games are proposed: weighted AND-games, weighted OR-games and games where the tiers have conjunctive normal form. The presented algorithms are generalizations of known computational methods using dynamic programming technique. Finally, some applications and experiments are carried out and these algorithms are compared to a fairly new method based on binary decision diagrams.
- Published
- 2020
11. Efficient Model-Based Diagnosis of Sequential Circuits
- Author
-
Franza Wotawa, Ingo Pill, Ion Matei, Johan de Kleer, and Alexander Feldman
- Subjects
Theoretical computer science ,Cardinality ,Sequential logic ,Computer science ,Sorting network ,General Medicine ,Software system ,Conjunctive normal form ,Satisfiability ,TRACE (psycholinguistics) - Abstract
In Model-Based Diagnosis (MBD), we concern ourselves with the health and safety of physical and software systems. Although we often use different knowledge representations and algorithms, some tools like satisfiability (SAT) solvers and temporal logics, are used in both domains. In this paper we introduce Finite Trace Next Logic (FTNL) models of sequential circuits and propose an enhanced algorithm for computing minimal-cardinality diagnoses. Existing state-of-the-art satisfiability algorithms for minimal diagnosis use Sorting Networks (SNs) for constraining the cardinality of the diagnostic candidates. In our approach we exploit Multi-Operand Adders (MOAs). Based on extensive tests with ISCAS-89 circuits, we found that MOAs enable Conjunctive Normal Form (CNF) encodings that are significantly more compact. These encodings lead to 19.7 to 67.6 times fewer variables and 18.4 to 62 times fewer clauses. For converting an FTNL model to CNF, we could achieve a speed-up ranging from 6.2 to 22.2. Using SNs fosters 3.4 to 5.5 times faster on-line satisfiability checking though. This makes MOAs preferable for applications where RAM and off-line time are more limited than on-line CPU time.
- Published
- 2020
12. Verifying Diagnosability of Discrete Event System with Logical Formula
- Author
-
Cheng Han, Xuena Geng, and Dantong Ouyang
- Subjects
Finite-state machine ,Computer science ,Applied Mathematics ,020206 networking & telecommunications ,Observable ,02 engineering and technology ,Resolution (logic) ,Fault (power engineering) ,Field (computer science) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Electrical and Electronic Engineering ,Conjunctive normal form ,Finite set ,Algorithm ,Event (probability theory) - Abstract
Diagnosability is an important property in the field of fault diagnosis. In this paper, a novel approach based on logical formula is proposed to verify diagnosability of Discrete event systems(DESs). CNFFSM is defined to represent a new model for DES. Each transition in DES can be described as a clause. According to CNF-FSM, we construct a CNF-diagnoser. Based on the resolution principle and CNF-diagnoser, an algorithm is presented to test whether the failure events can be detected or not in a finite number of observable events. Our algorithm can be applied in both off-line diagnosis and on-line diagnosis. Experimental results show that our algorithm can solve the diagnosability problem efficiently.
- Published
- 2020
13. The Overhead from Combating Side-Channels in Cloud Systems Using VM-Scheduling
- Author
-
Khalid Zaman Bijon, Nahid Juma, Mahesh V. Tripunitara, and Jonathan Shahen
- Subjects
021110 strategic, defence & security studies ,Mathematical optimization ,Computer science ,0211 other engineering and technologies ,02 engineering and technology ,Solver ,Scheduling (computing) ,Information leakage ,Side channel attack ,Electrical and Electronic Engineering ,Conjunctive normal form ,Boolean satisfiability problem ,Greedy algorithm ,Integer programming - Abstract
Recent work suggests that scheduling, with security as a consideration, can be effective in minimizing information leakage, via side-channels, that can exist when virtual machines (VMs) co-reside in clouds. We analyze the overhead that is incurred by such an approach. We first pose and answer a fundamental question: is the problem tractable? We show that the seemingly simpler sub-cases of initial placement and migration across only two equal-capacity servers are both intractable ( $\mathbf {NP}\text{-hard}$ NP -hard ). However, a decision version of the general problem to which the optimization version is related polynomially is in $\mathbf {NP}$ NP . With these results as the basis, we make several other contributions. We revisit recent work that proposes a greedy algorithm for this problem, called Nomad. We establish that if $\mathbf {P} \not= \mathbf {NP}$ P ≠ NP , then there exist infinitely many classes of input, each with an infinite number of inputs, for which a decrease in information leakage is possible, but Nomad provides none, let alone minimize it. We establish also that a mapping to Integer Linear Programming (ILP) in prior work is deficient in that the mapping can be inefficient (exponential-time), and therefore does not accurately convey the overhead of such an approach that, unlike Nomad, actually decreases information leakage. We present our efficient reductions to ILP and boolean satisfiability in conjunctive normal form (CNF-SAT). We have implemented these approaches and conducted an empirical assessment using the same ILP solver as prior work, and a SAT solver. Our analytical and empirical results more accurately convey the overhead that is incurred by an approach that actually provides security (decrease in information leakage).
- Published
- 2020
14. Structural Controller for Logical Expression of Linear Constraints on Petri Nets
- Author
-
MengChu Zhou, Jiliang Luo, Weimin Wu, Hongye Su, Kenzo Nonami, and Hui Shao
- Subjects
0209 industrial biotechnology ,Computer science ,02 engineering and technology ,State (functional analysis) ,Petri net ,Composition (combinatorics) ,Computer Science Applications ,020901 industrial engineering & automation ,Control and Systems Engineering ,Control theory ,Bounded function ,Electrical and Electronic Engineering ,Conjunctive normal form ,Event (probability theory) - Abstract
Based on the P-type composition of Petri nets (PNs) defined in this paper, a framework for a structural control of discrete event systems (DESs) is constructed such that a closed-loop PN is obtained by composing a plant PN and a controller. As for a disjunction or conjunctive normal form (CNF) of linear constraints, a new approach is proposed to design a structural controller in this framework. First, a switching-net is defined for a disjunction of constraints, and an extended plant is obtained through the P-type composition of a plant PN and switching-net. Second, the disjunction of bounded constraints is transformed into a conjunction of switching-constraints on the extended plant. Third, a controller is synthesized by designing monitors for conjunctive switching-constraints according to a supervision-based-on-place-invariant method. Fourth, in a similar manner, a controller is also designed for a CNF of bounded constraints. The resulting controller is maximally permissive if each disjunction of constraints meets the jump-free condition, and its size grows polynomially with the number of constraints. Another advantage is that the closed-loop system is still a PN for many real DES since a CNF can describe not only convex but also nonconvex state regions.
- Published
- 2020
15. Boosting Intelligent Data Analysis in Smart Sensors by Integrating Knowledge and Machine Learning
- Author
-
Jacek Kucharski, Piotr Łuczak, Izabela Perenc, Przemysław Kucharski, Krzysztof Ślot, and Tomasz Jaworski
- Subjects
AI-enabled sensors ,Data Analysis ,Boosting (machine learning) ,Computer science ,TP1-1185 ,Machine learning ,computer.software_genre ,Biochemistry ,Article ,Analytical Chemistry ,Machine Learning ,Electrical and Electronic Engineering ,Architecture ,Conjunctive normal form ,Instrumentation ,Structure (mathematical logic) ,Neurons ,Artificial neural network ,business.industry ,Chemical technology ,knowledge embedding ,Recognition, Psychology ,hybrid systems ,feedforward neural networks ,Atomic and Molecular Physics, and Optics ,Backpropagation ,Hybrid system ,Feedforward neural network ,Artificial intelligence ,Neural Networks, Computer ,business ,computer - Abstract
The presented paper proposes a hybrid neural architecture that enables intelligent data analysis efficacy to be boosted in smart sensor devices, which are typically resource-constrained and application-specific. The postulated concept integrates prior knowledge with learning from examples, thus allowing sensor devices to be used for the successful execution of machine learning even when the volume of training data is highly limited, using compact underlying hardware. The proposed architecture comprises two interacting functional modules arranged in a homogeneous, multiple-layer architecture. The first module, referred to as the knowledge sub-network, implements knowledge in the Conjunctive Normal Form through a three-layer structure composed of novel types of learnable units, called L-neurons. In contrast, the second module is a fully-connected conventional three-layer, feed-forward neural network, and it is referred to as a conventional neural sub-network. We show that the proposed hybrid structure successfully combines knowledge and learning, providing high recognition performance even for very limited training datasets, while also benefiting from an abundance of data, as it occurs for purely neural structures. In addition, since the proposed L-neurons can learn (through classical backpropagation), we show that the architecture is also capable of repairing its knowledge.
- Published
- 2021
16. Learning-based extraction of first-order logic representations of API directives
- Author
-
Xuefang Bai, Andrian Marcus, Mingwei Liu, Xiaoxin Zhang, Xin Peng, Jiazhan Xie, Gang Lyu, and Christoph Treude
- Subjects
Class (computer programming) ,Parsing ,Code review ,Application programming interface ,Programming language ,Computer science ,Conjunctive normal form ,computer.software_genre ,Directive ,computer ,Sentence ,First-order logic - Abstract
Developers often rely on API documentation to learn API directives, i.e., constraints and guidelines related to API usage. Failing to follow API directives may cause defects or improper implementations. Since there are no industry-wide standards on how to document API directives, they take many forms and are often hard to understand by developers or challenging to parse with tools. In this paper, we propose a learning based approach for extracting first-order logic representations of API directives (FOL directives for short). The approach, called LEADFOL, uses a joint learning method to extract atomic formulas by identifying the predicates and arguments involved in directive sentences, and recognizes the logical relations between atomic formulas, by parsing the sentence structures. It then parses the arguments and uses a learning based method to link API references to their corresponding API elements. Finally, it groups the formulas of the same class or method together and transforms them into conjunctive normal form. Our evaluation shows that LEADFOL can accurately extract more FOL directives than a state-of-the-art approach and that the extracted FOL directives are useful in supporting code reviews.
- Published
- 2021
17. AlloyMax: bringing maximum satisfaction to relational specifications
- Author
-
David Garlan, Pedro Orvalho, Changjian Zhang, Ryan Wagner, Vasco M. Manquinho, Eunsuk Kang, and Ruben Martins
- Subjects
Theoretical computer science ,Computer science ,True quantified Boolean formula ,Modeling language ,Scalability ,Maximum satisfiability problem ,Solver ,Conjunctive normal form ,Satisfiability ,Language construct - Abstract
Alloy is a declarative modeling language based on a first-order relational logic. Its constraint-based analysis has enabled a wide range of applications in software engineering, including configuration synthesis, bug finding, test-case generation, and security analysis. Certain types of analysis tasks in these domains involve finding an optimal solution. For example, in a network configuration problem, instead of finding any valid configuration, it may be desirable to find one that is most permissive (i.e., it permits a maximum number of packets). Due to its dependence on SAT, however, Alloy cannot be used to specify and analyze these types of problems. We propose AlloyMax, an extension of Alloy with a capability to express and analyze problems with optimal solutions. AlloyMax introduces (1) a small addition of language constructs that can be used to specify a wide range of problems that involve optimality and (2) a new analysis engine that leverages a Maximum Satisfiability (MaxSAT) solver to generate optimal solutions. To enable this new type of analysis, we show how a specification in a first-order relational logic can be translated into an input format of MaxSAT solvers—namely, a Boolean formula in weighted conjunctive normal form (WCNF). We demonstrate the applicability and scalability of AlloyMax on a benchmark of problems. To our knowledge, AlloyMax is the first approach to enable analysis with optimality in a relational modeling language, and we believe that AlloyMax has the potential to bring a wide range of new applications to Alloy.
- Published
- 2021
18. Optimal Conjunctive Normal Form Encoding for Symbolic Execution
- Author
-
Weiyu Pan
- Subjects
Computer science ,Encoding (memory) ,Conjunctive normal form ,Arithmetic ,Symbolic execution - Published
- 2021
19. BDD and DNF Based Algorithms for Constructing All Testability Functions of Combinational Circuit
- Author
-
Olga Golubeva
- Subjects
Combinational logic ,Binary decision diagram ,Computer science ,Hardware_PERFORMANCEANDRELIABILITY ,Observability ,Conjunctive normal form ,Disjunctive normal form ,Boolean function ,Boolean satisfiability problem ,Algorithm ,Testability ,Hardware_LOGICDESIGN - Abstract
Constructing testability functions of a combinational circuit line, such as: the controllability, observability and stuck-at fault detection functions, as well as the complement of the observability function is considered. Methods and algorithms for constructing testability functions based on Binary Decision Diagram (BDD) and Disjunctive Normal Form (DNF), as well as methods for constructing Conjunctive Normal Form (CNF) and obtaining testability functions using a SAT solver are proposed. Methods and algorithms for constructing testability functions for all and a subset of lines of a circuit are also proposed. Proposed methods and algorithms make it possible to significantly reduce the computational costs for constructing testability functions of a combinational circuit.
- Published
- 2021
20. Complementary Knowledge Compilation Using the Hyper Extension Rule
- Author
-
Shuai Lyu, Yue Xu, Lei Liu, and Dangdang Niu
- Subjects
Algebra ,Computer science ,Applied Mathematics ,Diagram ,Knowledge compilation ,Compiler ,Extension (predicate logic) ,Electrical and Electronic Engineering ,Conjunctive normal form ,Conjunctive normal form formula ,computer.software_genre ,computer - Abstract
We introduce the concept of Complementary formula (COMF), which is a new and non-equivalent way for Knowledge compilation (KC). Based on the Hyper extension rule (HER) which is an expansion of Extension rule (ER), we design a compilation algorithm which can formula compile each Conjunctive normal form (CNF) formula to complementary Fully complementary connected diagram (c-FCCD), named as C2C (CNF formula to cFCCD). Theoretically, c-FCCD is a kind of complementary formulae of the input formulae and can support all queries and partial transformations in KC map. Experimentally, C2C is competitive with the EPCCL compilers KCER, C2E, UKCHER, DKCHER and IKCHER.
- Published
- 2019
21. N-level Modulo-Based CNF encodings of Pseudo-Boolean constraints for MaxSAT
- Author
-
Miyuki Koshimura, Hiroshi Fujita, and Aolong Zha
- Subjects
Discrete mathematics ,050101 languages & linguistics ,Correctness ,Modular arithmetic ,Computer science ,Modulo ,05 social sciences ,02 engineering and technology ,Computer Science::Computational Complexity ,Satisfiability ,Computational Theory and Mathematics ,Artificial Intelligence ,Maximum satisfiability problem ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Conjunctive normal form ,Boolean satisfiability problem ,Heuristics ,Software - Abstract
Many combinatorial problems in various fields can be translated to Maximum Satisfiability (MaxSAT) problems. Although the general problem is $\mathcal {N}\mathcal {P}$ -hard, more and more practical problems may be solved due to the significant effort which has been devoted to the development of efficient solvers. The art of constraints encoding is as important as the art of devising algorithms for MaxSAT. In this paper, we present several encoding methods of pseudo-Boolean constraints into Boolean satisfiability problems in Conjunctive Normal Form (CNF) formula, which are based on the idea of modular arithmetic and only generate auxiliary variables for each unique combination of weights. These techniques are efficient in encoding and solving MaxSAT problems. In particular, our solvers won the partial MaxSAT industrial category from 2010 through 2012 and ranked second in the 2017 main weighted track of the MaxSAT evaluation. We prove the correctness and the pseudo-polynomial space complexity of our encodings and also give a heuristics of the base selection for modular arithmetic. Our experimental results show that our encoding compactly encodes the constraints, and the obtained clauses are efficiently handled by a state-of-the-art SAT solver.
- Published
- 2019
22. Wombit: A Portfolio Bit-Vector Solver Using Word-Level Propagation
- Author
-
Harald Søndergaard, Wenxi Wang, and Peter J. Stuckey
- Subjects
Theoretical computer science ,Computer science ,Contrast (statistics) ,020207 software engineering ,0102 computer and information sciences ,02 engineering and technology ,Bit array ,Solver ,01 natural sciences ,Constant (computer programming) ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,Artificial Intelligence ,0202 electrical engineering, electronic engineering, information engineering ,Local consistency ,Portfolio ,Conjunctive normal form ,Software ,Word (computer architecture) - Abstract
We develop an idea originally proposed by Michel and Van Hentenryck of how to perform bit-vector constraint propagation on the word level. Most operations are propagated in constant time, assuming the bit-vector fits in a machine word. In contrast, bit-vector SMT solvers usually solve bit-vector problems by (ultimately) bit-blasting, that is, mapping the resulting operations to conjunctive normal form clauses, and using SAT technology to solve them. Bit-blasting generates intermediate variables which can be an advantage, as these can be searched on and learnt about. As each approach has advantages, it makes sense to try to combine them. In this paper, we describe an approach to bit-vector solving using word-level propagation with learning. We have designed alternative word-level propagators to Michel and Van Hentenryck’s, and evaluated different variants of the approach. We have also experimented with different approaches to learning and back-jumping in the solver. Based on the insights gained, we have built a portfolio solver, Wombit, which essentially extends the STP bit-vector solver. Using machine learning techniques, the solver makes a judicious up-front decision about whether to use word-level propagation or fall back on bit-blasting.
- Published
- 2018
23. A Cognitive SAT to SAT-Hard Clause Translation-based Logic Obfuscation
- Author
-
Rakibul Hassan, Houman Homayoun, Gaurav Kohle, Sai Manoj Pudukotai Dinakarrao, and Setareh Rafatirad
- Subjects
Obfuscation (software) ,Reverse engineering ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Theoretical computer science ,Artificial neural network ,Computer science ,Conjunctive normal form ,Boolean satisfiability problem ,Base (topology) ,computer.software_genre ,computer ,Block (data storage) ,Generator (mathematics) - Abstract
Logic obfuscation is introduced as a pivotal defense mechanism against emerging hardware threats on Integrated Circuits (ICs) such as reverse engineering (RE) and intellectual property (IP) theft. The effectiveness of logic obfuscation is challenged by recently introduced Boolean satisfiability (SAT) attack and it's variants. A plethora of counter measures have been proposed to thwart the SAT attacks. Irrespective of the implemented defenses, large power, performance and area (PPA) overheads are seen to be indispensable. In contrast, we propose a neural network-based cognitive SAT to SAT-hard clause translator under the constraints of minimal PPA overheads while preserving the original functionality with impenetrable security. Our proposed method is incubated with a SAT-hard clause generator that translates the existing conjunctive normal form (CNF) through minimal perturbations such as inclusion of pair of inverters or buffers or adding new lightweight SAT-hard block depending on the provided CNF. For efficient SAT-hard clause generation, the proposed method is equipped with a multi-layer neural network that first learns the dependencies of features (literals and clauses), followed by a long-short-term-memory (LSTM) network to validate and backpropagate the SAT-hardness for better learning and translation. For a fair comparison with the state-of-the-art, we evaluate our proposed technique on ISCAS'85 benchmarks. It is seen to successfully defend against multiple state-of-the-art SAT attacks devised for hardware RE. In addition, we also evaluate our proposed technique's empirical performance against MiniSAT, Lingeling and Glucose SAT solvers that form the base for numerous existing deobfuscation SAT attacks.
- Published
- 2021
24. CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
- Author
-
Qiong Chang, Itsuki Noda, Rongxuan Gao, Aolong Zha, and Miyuki Koshimura
- Subjects
021103 operations research ,Correctness ,Computer science ,Maximum satisfiability problem ,0211 other engineering and technologies ,0202 electrical engineering, electronic engineering, information engineering ,Benchmark (computing) ,020201 artificial intelligence & image processing ,02 engineering and technology ,Conjunctive normal form ,Solver ,Integer programming ,Algorithm - Abstract
In this study, we consider the multiple traveling salesmen problem (mTSP) with the min-max objective of minimizing the longest tour length. We begin by reviewing an existing integer programming (IP) formulation of this problem. Then, we present several novel conjunctive normal form (CNF) encodings and an approach based on modifying a maximum satisfiability (MaxSAT) algorithm for the min-max mTSP. The correctness and the space complexity of each encoding are analyzed. In our experiments, we compare the performance of solving the TSP benchmark instances using an existing encoding and our new encodings comparing the results achieved using an implemented group MaxSAT solver to those achieved using the IP method. The results show that for the same problem, the new encodings significantly reduce the number of generated clauses over the existing CNF encoding. Although the proposals are still not competitive compared to the IP method, one of them may be more effective on relatively large-scale problems, and it has an advantage over the IP method in solving an instance with a small ratio of the number of cities to the number of salesmen.
- Published
- 2020
25. Properties of the satisfiability threshold of the strictly d-regular random (3,2s)-SAT problem
- Author
-
Yongping Wang and Daoyun Xu
- Subjects
Conjecture ,General Computer Science ,Computer science ,Literal (mathematical logic) ,Structure (category theory) ,020207 software engineering ,02 engineering and technology ,Type (model theory) ,Satisfiability ,Theoretical Computer Science ,Combinatorics ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Conjunctive normal form ,Real number ,Variable (mathematics) - Abstract
A k-CNF (conjunctive normal form) formula is a regular (k, s)-CNF one if every variable occurs s times in the formula, where k ⩾ 2 and s > 0 are integers. Regular (3, s)-CNF formulas have some good structural properties, so carrying out a probability analysis of the structure for random formulas of this type is easier than conducting such an analysis for random 3-CNF formulas. Some subclasses of the regular (3, s)-CNF formula have also characteristics of intractability that differ from random 3-CNF formulas. For this purpose, we propose strictly d-regular (k, 2s)-CNF formula, which is a regular (k, 2s)-CNF formula for which d ⩾ 0 is an even number and each literal occurs $$s - {d \over 2}$$ or $$s + {d \over 2}$$ times (the literals from a variable x are x and ¬x, where x is positive and ¬x is negative). In this paper, we present a new model to generate strictly d-regular random (k, 2s)-CNF formulas, and focus on the strictly d-regular random (3, 2s)-CNF formulas. Let F be a strictly d-regular random (3, 2s)-CNF formula such that 2s > d. We show that there exists a real number s0 such that the formula F is unsatisfiable with high probability when s > s0, and present a numerical solution for the real number s0. The result is supported by simulated experiments, and is consistent with the existing conclusion for the case of d = 0. Furthermore, we have a conjecture: for a given d, the strictly d-regular random (3, 2s)-SAT problem has an SAT-UNSAT (satisfiable-unsatisfiable) phase transition. Our experiments support this conjecture. Finally, our experiments also show that the parameter d is correlated with the intractability of the 3-SAT problem. Therefore, our research maybe helpful for generating random hard instances of the 3-CNF formula.
- Published
- 2020
26. Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints
- Author
-
Zhendong Lei, Chuan Luo, and Shaowei Cai
- Subjects
Combinatorics ,Efficient algorithm ,Computer science ,Cardinality (SQL statements) ,Conjunctive normal form - Abstract
Satisfiability (SAT) and Maximum Satisfiability (MaxSAT) are two basic and important constraint problems with many important applications. SAT and MaxSAT are expressed in CNF, which is difficult to deal with cardinality constraints. In this paper, we introduce Extended Conjunctive Normal Form (ECNF), which expresses cardinality constraints straightforward and does not need auxiliary variables or clauses. Then, we develop a simple and efficient local search solver LS-ECNF with a well designed scoring function under ECNF. We also develop a generalized Unit Propagation (UP) based algorithm to generate the initial solution for local search. We encode instances from Nurse Rostering and Discrete Tomography Problems into CNF with three different cardinality constraint encodings and ECNF respectively. Experimental results show that LS-ECNF has much better performance than state of the art MaxSAT, SAT, Pseudo-Boolean and ILP solvers, which indicates solving cardinality constraints with ECNF is promising.
- Published
- 2020
27. Generating difficult CNF instances in unexplored constrainedness regions
- Author
-
Guillaume Escamocher, Barry O'Sullivan, and Steven Prestwich
- Subjects
050101 languages & linguistics ,Instance generator ,Theoretical computer science ,Computer science ,Constrainedness region ,05 social sciences ,02 engineering and technology ,Constraint satisfaction ,Arity ,Satisfiability ,Theoretical Computer Science ,Development (topology) ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,0202 electrical engineering, electronic engineering, information engineering ,Graph (abstract data type) ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Cluster coefficient ,Conjunctive normal form ,Instance difficulty ,Generator (mathematics) - Abstract
When creating benchmarks for satisfiability (SAT) solvers, we need Conjunctive Normal Form (CNF) instances that are easy to build but hard to solve. A recent development in the search for such methods has led to the Balanced SAT algorithm, which can create k -CNF instances with m clauses of high difficulty, for arbitrary k and m . In this article, we introduce the No-Triangle CNF algorithm, a CNF instance generator based on the cluster coefficient graph statistic. We empirically compare the two algorithms by fixing the arity and the number of variables, but varying the number of clauses. We find that the hardest instances produced by each method belong to different constrainedness regions. In the 3-CNF case, for example, hard No-Triangle CNF instances reside in the highly-constrained region (many clauses), while Balanced SAT instances obtained from the same parameters are easy to solve. This allows us to generate difficult instances where existing algorithms fail to do so.
- Published
- 2020
28. SATConda: SAT to SAT-Hard Clause Translator
- Author
-
Sai Manoj Pudukotai Dinakarrao, Setareh Rafatirad, Rakibul Hassan, Houman Homayoun, and Gaurav Kolhe
- Subjects
Reverse engineering ,Theoretical computer science ,Artificial neural network ,business.industry ,Computer science ,02 engineering and technology ,Integrated circuit ,Encryption ,computer.software_genre ,020202 computer hardware & architecture ,law.invention ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,law ,0202 electrical engineering, electronic engineering, information engineering ,Bipartite graph ,Netlist ,020201 artificial intelligence & image processing ,Conjunctive normal form ,business ,Boolean satisfiability problem ,computer ,Hardware_LOGICDESIGN - Abstract
Logic obfuscation emerged as an efficient solution to strengthen the security of integrated circuits (ICs) from multiple threats including reverse engineering and intellectual property (IP) theft. Emergence of Boolean Satisfiability (SAT) attacks and its variants have shown to circumvent the security mechanisms such as obfuscation and a plethora of its variants. A plethora of advanced security defenses to thwart the SAT attacks are introduced. Despite the effectiveness, the imposed overheads in terms of area and power are unacceptably high. In contrast, our current work focuses on devising an iterative, dynamic and intelligent SAT-hard clause generator for a given SAT-prone problem, termed as SATConda. The SATConda is a SAT-hard clause generator that utilizes a bipartite propagation based neural network model. The utilized model comprises multiple layers of artificial neural networks to extract the dependencies of literals and variables, followed by long short term memory (LSTM) networks to validate the SAT hardness. The SATConda is trained with conjunctive normal form (CNF) of the IC netlist that are both SAT solvable and SAT-hard. Further, the SATConda is equipped with a SAT-clause generator to convert a CNF from satisfiable (SAT) to unsatisfiable (unSAT) with minor perturbation (which translates to minor overheads) so that the SAT-attack cannot decrypt the keys. To the best of our knowledge, no previous work has been reported on neural network based SAT-hard clause or CNF translator for circuit obfuscation. We evaluate our proposed SATConda's empirical performance against MiniSAT, Lingeling and Glucose SAT solvers on ISCAS'85 benchmark circuits.
- Published
- 2020
29. On Unit Read-Once Resolutions and Copy Complexity
- Author
-
K. Subramani and Piotr J. Wojciechowski
- Subjects
Discrete mathematics ,Horn clause ,Literal (mathematical logic) ,Computer science ,True quantified Boolean formula ,French horn ,0102 computer and information sciences ,02 engineering and technology ,Resolution (logic) ,01 natural sciences ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,010201 computation theory & mathematics ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Conjunctive normal form ,Time complexity ,AND gate - Abstract
In this paper, we discuss the copy complexity of unit resolution with respect to Horn formulas. A Horn formula is a boolean formula in conjunctive normal form (CNF) with at most one positive literal per clause. Horn formulas find applications in a number of domains such as program verification and logic programming. Resolution as a proof system for boolean formulas is both sound and complete. However, resolution is considered an inefficient proof system when compared to other stronger proof systems for boolean formulas. Despite this inefficiency, the simple nature of resolution makes it an integral part of several theorem provers. Unit resolution is a restricted form of resolution in which each resolution step needs to use a clause with only one literal (unit literal clause). While not complete for general CNF formulas, unit resolution is complete for Horn formulas. A read-once resolution (ROR) refutation is a refutation in which each clause (input or derived) may be used at most once in the derivation of a refutation. As with unit resolution, ROR refutation is incomplete in general and complete for Horn clauses. This paper focuses on a combination of unit resolution and read-once resolution called Unit read-once resolution (UROR). UROR is incomplete for Horn clauses. In this paper, we study the copy complexity problem in Horn formulas under UROR. Briefly, the copy complexity of a formula under UROR is the smallest number k such that replicating each clause k times guarantees the existence of a UROR refutation. This paper focuses on two problems related to the copy complexity of unit resolution. We first relate the copy complexity of unit resolution for Horn formulas to the copy complexity of the addition rule in the corresponding Horn constraint system. We also examine a form of copy complexity where we permit replication of derived clauses, in addition to the input clauses. Finally, we provide a polynomial time algorithm for the problem of checking if a 2-CNF formula has a UROR refutation.
- Published
- 2020
30. A Simple yet Efficient MCSes Enumeration with SAT Oracles
- Author
-
Miyuki Koshimura and Ken Satoh
- Subjects
Theoretical computer science ,010201 computation theory & mathematics ,Simple (abstract algebra) ,Computer science ,0202 electrical engineering, electronic engineering, information engineering ,Enumeration ,020201 artificial intelligence & image processing ,0102 computer and information sciences ,02 engineering and technology ,Computer Science::Computational Complexity ,Conjunctive normal form ,01 natural sciences ,Task (project management) - Abstract
The enumeration of the maximal satisfiable subsets (MSSes) or the minimal correction subsets (MCSes) of conjunctive normal form (CNF) formulas is a cornerstone task in various AI domains. This paper presents an algorithm that enumerates all MCSes with SAT oracles. Our algorithm is simple because it follows a plain algorithm without any techniques that decrease the number of calls to a SAT oracle. The experimental results show that our proposed method is more efficient than state-of-the-art MCS enumerators on average to deal with Partial-MaxSAT instances.
- Published
- 2020
31. Syntax-Semantics Interface and the Form-Meaning Mismatch Between L1 and L2
- Author
-
Weifeng Han
- Subjects
Grammar ,Interface (Java) ,Computer science ,media_common.quotation_subject ,Context (language use) ,Semantics ,Second-language acquisition ,Syntax ,Linguistics ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,Conjunctive normal form ,media_common ,Meaning (linguistics) - Abstract
While syntactic rules guide how words in a language are combined to form sentences, semantics focuses on the rules of meaning at morphological, lexical and syntactic levels. The interface between syntax and semantics, therefore, links the clausal form and its underlying meaning. However, the syntax-semantics interface is one of the most vulnerable aspects in L2 acquisition. Therefore, L2 speakers are found to either often have incomplete grammar, or have highly variable syntactic-semantic awareness and performance. In the context of SLA, previous knowledge, such as that in L1, is believed to account for the “incompleteness” in L2 syntactic and semantic acquisition. The syntax-semantics interface, therefore, poses a big challenge for both child and adult L2 learners.
- Published
- 2020
32. Learning CNF Blocking for Large-scale Author Name Disambiguation
- Author
-
C. Lee Giles, Kunho Kim, and Athar Sefid
- Subjects
Theoretical computer science ,Computer science ,05 social sciences ,02 engineering and technology ,Disjoint sets ,Function (mathematics) ,Disjunctive normal form ,Blocking (statistics) ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,0509 other social sciences ,Conjunctive normal form ,050904 information & library sciences ,Completeness (statistics) ,Cluster analysis - Abstract
Author name disambiguation (AND) algorithms identify a unique author entity record from all similar or same publication records in scholarly or similar databases. Typically, a clustering method is used that requires calculation of similarities between each possible record pair. However, the total number of pairs grows quadratically with the size of the author database making such clustering difficult for millions of records. One remedy is a blocking function that reduces the number of pairwise similarity calculations. Here, we introduce a new way of learning blocking schemes by using a conjunctive normal form (CNF) in contrast to the disjunctive normal form (DNF). We demonstrate on PubMed author records that CNF blocking reduces more pairs while preserving high pairs completeness compared to the previous methods that use a DNF and that the computation time is significantly reduced. In addition, we also show how to ensure that the method produces disjoint blocks so that much of the AND algorithm can be efficiently paralleled. Our CNF blocking method is tested on the entire PubMed database of 80 million author mentions and efficiently removes 82.17% of all author record pairs in 10 minutes.
- Published
- 2020
33. DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
- Author
-
Jeffrey M. Dudek, Moshe Y. Vardi, and Vu H. N. Phan
- Subjects
050101 languages & linguistics ,Computer science ,05 social sciences ,Joins ,02 engineering and technology ,Data structure ,Tree (graph theory) ,Dynamic programming ,Treewidth ,Variable (computer science) ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Conjunctive normal form ,Heuristics ,Algorithm - Abstract
We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are project-join trees, which specify efficient project-join orders to apply additive projections (variable eliminations) and joins (clause multiplications). In this framework, model counting is performed in two phases. First, the planning phase constructs a project-join tree from a formula. Second, the execution phase computes the model count of the formula, employing dynamic programming as guided by the project-join tree. We empirically evaluate various methods for the planning phase and compare constraint-satisfaction heuristics with tree-decomposition tools. We also investigate the performance of different data structures for the execution phase and compare algebraic decision diagrams with tensors. We show that our dynamic-programming model-counting framework DPMC is competitive with the state-of-the-art exact weighted model counters Cachet, c2d, d4, and miniC2D.
- Published
- 2020
34. The First Shared Task on Discourse Representation Structure Parsing
- Author
-
Rik van Noord, Lasha Abzianidze, Hessel Haagsma, and Johan Bos
- Subjects
FOS: Computer and information sciences ,Computer Science - Machine Learning ,Discourse representation theory ,Computer Science - Artificial Intelligence ,Computer science ,WordNet ,Semantic parsing ,computer.software_genre ,Semantics ,Discourse Representation Structures ,Presupposition ,Shared task ,Machine Learning (cs.LG) ,Conjunctive normal form ,VerbNet ,Computer Science - Computation and Language ,Parsing ,business.industry ,I.2.7 ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Artificial Intelligence (cs.AI) ,Artificial intelligence ,Tuple ,business ,computer ,Computation and Language (cs.CL) ,Natural language processing - Abstract
The paper presents the IWCS 2019 shared task on semantic parsing where the goal is to produce Discourse Representation Structures (DRSs) for English sentences. DRSs originate from Discourse Representation Theory and represent scoped meaning representations that capture the semantics of negation, modals, quantification, and presupposition triggers. Additionally, concepts and event-participants in DRSs are described with WordNet synsets and the thematic roles from VerbNet. To measure similarity between two DRSs, they are represented in a clausal form, i.e. as a set of tuples. Participant systems were expected to produce DRSs in this clausal form. Taking into account the rich lexical information, explicit scope marking, a high number of shared variables among clauses, and highly-constrained format of valid DRSs, all these makes the DRS parsing a challenging NLP task. The results of the shared task displayed improvements over the existing state-of-the-art parser., Comment: International Conference on Computational Semantics (IWCS)
- Published
- 2020
- Full Text
- View/download PDF
35. Accelerating combinatorial filter reduction through constraints
- Author
-
Yulin Zhang, Hazhar Rahmani, Dylan A. Shell, and Jason M. O'Kane
- Subjects
FOS: Computer and information sciences ,Mathematical optimization ,Computer science ,business.industry ,Computer Science - Artificial Intelligence ,Automation ,Reduction (complexity) ,Nonlinear system ,Computer Science - Robotics ,Artificial Intelligence (cs.AI) ,Filter (video) ,Leverage (statistics) ,Robot ,Minification ,Conjunctive normal form ,business ,Robotics (cs.RO) - Abstract
Reduction of combinatorial filters involves compressing state representations that robots use. Such optimization arises in automating the construction of minimalist robots. But exact combinatorial filter reduction is an NP-complete problem and all current techniques are either inexact or formalized with exponentially many constraints. This paper proposes a new formalization needing only a polynomial number of constraints, and characterizes these constraints in three different forms: nonlinear, linear, and conjunctive normal form. Empirical results show that constraints in conjunctive normal form capture the problem most effectively, leading to a method that outperforms the others. Further examination indicates that a substantial proportion of constraints remain inactive during iterative filter reduction. To leverage this observation, we introduce just-in-time generation of such constraints, which yields improvements in efficiency and has the potential to minimize large filters., Comment: 7 pages, 3 figures
- Published
- 2020
- Full Text
- View/download PDF
36. Learning the Satisfiability of Ł-clausal Forms
- Author
-
Mohamed El Halaby and Areeg Abdalla
- Subjects
Artificial neural network ,Computer science ,business.industry ,Decision tree ,020206 networking & telecommunications ,Pattern recognition ,02 engineering and technology ,Fuzzy logic ,Satisfiability ,Random forest ,Classifier (linguistics) ,0202 electrical engineering, electronic engineering, information engineering ,Graph (abstract data type) ,020201 artificial intelligence & image processing ,Artificial intelligence ,Conjunctive normal form ,business - Abstract
The k-SAT problem for Ł-clausal forms has been found to be NP-complete if \(k\ge 3\). Similar to Boolean formulas in Conjunctive Normal Form (CNF), Ł-clausal forms are important from a theoretical and practical point of views for their expressive power, easy-hard-easy pattern as well as having a phase transition phenomena. In this paper, we investigate predicting the satisfiability of Ł-clausal forms by training different classifiers (Neural Network, Linear SVC, Logistic Regression, Random Forest and Decision Tree) on features extracted from randomly generated formulas. Firstly, a random instance generator is presented and used to generate instances in the phase transition area over 3-valued and 7-valued Lukasiewicz logic. Next, numeric and graph features were extracted from both datasets. Then, different classifiers were trained and the best classifier (Neural Network) was selected for hyper-parameter tuning, after which the mean of the cross-validation scores (CVS) increased from 92.5% to 95.2%.
- Published
- 2020
37. Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology
- Author
-
Lei Zuo, Dan Gusfield, and Hannah Brown
- Subjects
Range (mathematics) ,Theoretical computer science ,Current (mathematics) ,Development (topology) ,Exploit ,Computer science ,Systems biology ,Computer Science::Computational Complexity ,Conjunctive normal form ,ENCODE ,Integer programming - Abstract
It is useful to have general-purpose solution methods that can be applied to a wide range of problems, rather than relying on the development of clever, intricate algorithms for each specific problem. Integer Linear Programming is the most widely-used such general-purpose solution method. It is successful in a wide range of problems. However, there are some problems in computational biology where integer linear programming has had only limited success. In this paper, we explore an alternate, general-purpose solution method: SAT-solving, i.e., constructing Boolean formulas in conjunctive normal form (CNF) that encode a problem instance, and using a SAT-solver to determine if the CNF formula is satisfiable or not. In three hard problems examined, we were very surprised to find the SAT-solving approach was dramatically better than the ILP approach in two problems; and a little slower, but more robust, in the third problem. We also re-examined and confirmed an earlier result on a fourth problem, using current ILP and SAT-solvers. These results should encourage further efforts to exploit SAT-solving in computational biology.
- Published
- 2020
38. FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints
- Author
-
Anastasios Kyrillidis, Zhiwei Zhang, Moshe Y. Vardi, and Anshumali Shrivastava
- Subjects
FOS: Computer and information sciences ,Multilinear map ,Polynomial ,Computer Science - Logic in Computer Science ,Computer Science - Machine Learning ,Theoretical computer science ,Computer science ,Computer Science - Information Theory ,02 engineering and technology ,Computer Science::Computational Complexity ,Machine Learning (cs.LG) ,Cardinality ,FOS: Mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Leverage (statistics) ,Conjunctive normal form ,Algebraic number ,Boolean function ,Fourier series ,Mathematics - Optimization and Control ,Continuous optimization ,Information Theory (cs.IT) ,05 social sciences ,050301 education ,General Medicine ,Logic in Computer Science (cs.LO) ,Optimization and Control (math.OC) ,020201 artificial intelligence & image processing ,Boolean satisfiability problem ,0503 education - Abstract
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side, especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT solvers, has been remarkable. Yet, while SAT solvers aimed at solving industrial-scale benchmarks in Conjunctive Normal Form (CNF) have become quite mature, SAT solvers that are effective on other types of constraints, e.g., cardinality constraints and XORs, are less well studied; a general approach to handling non-CNF constraints is still lacking. In addition, previous work indicated that for specific classes of benchmarks, the running time of extant SAT solvers depends heavily on properties of the formula and details of encoding, instead of the scale of the benchmarks, which adds uncertainty to expectations of running time. To address the issues above, we design FourierSAT, an incomplete SAT solver based on Fourier analysis of Boolean functions, a technique to represent Boolean functions by multilinear polynomials. By such a reduction to continuous optimization, we propose an algebraic framework for solving systems consisting of different types of constraints. The idea is to leverage gradient information to guide the search process in the direction of local improvements. Empirical results demonstrate that FourierSAT is more robust than other solvers on certain classes of benchmarks., The paper was accepted by Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020). V2 (Feb 24): Typos corrected
- Published
- 2019
39. Fill-a-Pix Puzzle as a SAT Problem
- Author
-
Aye Myint Myat, Khine Khine Htwe, and Nobuo Funabiki
- Subjects
Computer science ,business.industry ,Circuit design ,MathematicsofComputing_GENERAL ,Cryptography ,Solver ,Automated theorem proving ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Encoding (memory) ,Central processing unit ,Conjunctive normal form ,Arithmetic ,business ,Hardware_LOGICDESIGN ,Sat problem - Abstract
Fill-a-Pix Puzzle is a Picture Logic Puzzle that has not been solved as a SAT Problem as well as there is no SAT Conjunctive Normal Form (CNF) Encoding Method to solve this puzzle yet. There are several practical SAT problems in various fields such as Artificial Intelligence (AI), Automatic Theorem Proving, Circuit Design, etc. Fill-a-Pix puzzle is also one of the SAT problems. This research proposes the SAT CNF Encoding Method to solve Fill-a-Pix Puzzle as a SAT Problem using SAT Solvers. The proposed SAT CNF Encoding Method will be executed on different standard SAT solvers – MiniSAT, CryptoMiniSAT and RSAT. The evaluation is presented regarding the CPU Execution Times of each solver for executing the proposed SAT CNF Encoding, the Number of Variables and Clauses produced by the proposed SAT CNF Encoding as well as the Comparison of Fill-a-Pix Puzzle with the other Similar Puzzles such as Sudoku and Slitherlink based on the Number of Variables and Clauses produced by the proposed SAT CNF Encoding when executing Puzzle Sizes above 50 × 50.
- Published
- 2019
40. SAT to SAT-hard clause translator
- Author
-
Setareh Rafatirad, Sai Manoj Pudukotai Dinakarrao, Houman Homayoun, and Rakibul Hassan
- Subjects
Reverse engineering ,Theoretical computer science ,Artificial neural network ,business.industry ,Computer science ,Work in process ,Encryption ,computer.software_genre ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Bipartite graph ,Netlist ,Conjunctive normal form ,business ,Boolean satisfiability problem ,computer ,Hardware_LOGICDESIGN - Abstract
Logic obfuscation emerged as an efficient solution to strengthen the security of integrated circuits (ICs) from multiple threats including reverse engineering and intellectual property (IP) theft. Emergence of Boolean Satisfiability (SAT) attacks and its variants have shown to circumvent the security mechanisms such as obfuscation and a plethora of its variants. Considering the size of ICs and the amount of time it takes to validate a defense i.e., obfuscation against SAT attack could range from few ms to days. In contrast, our current work focuses on devising an iterative, dynamic and intelligent SAT-hard clause generator for a given SAT-prone problem. The proposed Machine Learning (ML)-based SAT to unSAT clause translator is a SAT-hard clause generator that utilizes a bipartite propagation based neural network model. The utilized model comprises multiple layers of artificial neural networks to extract the dependencies of literals and variables, followed by long short term memory (LSTM) networks to validate the SAT hardness. The proposed ML-based SAT to unSAT clause translator is trained with conjunctive normal form (CNF) of the IC netlist that are both SAT solvable and SAT-hard. Further, the model is also trained to convert a CNF from satisfiable (SAT) to unsatisfiable (unSAT) form with minor perturbation (which translates to minor overheads) so that the SAT-attack cannot decrypt the keys. To the best of our knowledge, no previous work has been reported on neural network based SAT-hard clause or CNF translator for circuit obfuscation. We evaluate our proposed models's empirical performance against MiniSAT with 300 CNFs.
- Published
- 2019
41. Automated generation of (F)LTL oracles for testing and debugging
- Author
-
Ingo Pill and Franz Wotawa
- Subjects
Model checking ,Computer science ,business.industry ,Programming language ,media_common.quotation_subject ,020207 software engineering ,0102 computer and information sciences ,02 engineering and technology ,Artifact (software development) ,computer.software_genre ,01 natural sciences ,Oracle ,Software ,Debugging ,010201 computation theory & mathematics ,Hardware and Architecture ,0202 electrical engineering, electronic engineering, information engineering ,Automated reasoning ,Conjunctive normal form ,business ,computer ,Information Systems ,media_common ,Test data - Abstract
For being able to draw on automated reasoning that helps us in improving the quality of some software artifact or cyber-physical system, we have to express desired system traits in precise formal requirements. Verifying that a system adheres to these requirements allows us then to gain the crucial level of confidence in its capabilities and quality. Complementing related methods like model checking or runtime monitors, for testing and most importantly debugging recognized problems, we would certainly be interested in automated oracles. These oracles would allow us to judge whether observed (test) data really adhere to desired properties, and also to derive program spectra that have been shown to be an effective reasoning basis for debugging purposes. In this paper, we show how to automatically derive such an oracle as a dedicated satisfiability encoding that is specifically tuned to the considered test data at hand. In particular, we instantiate a dedicated SAT problem in conjunctive normal form directly from the requirements and a test case’s execution data. Our corresponding experiments illustrate that our approach shows attractive performance and can be fully automated.
- Published
- 2018
42. A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
- Author
-
Sa'ed Abed, Raed Mesleh, Sahel Alouneh, and Mohammad H. Al Shayeji
- Subjects
Linguistics and Language ,Computer science ,Unit propagation ,02 engineering and technology ,Conflict analysis ,Language and Linguistics ,Computer engineering ,Artificial Intelligence ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Conjunctive normal form ,Heuristics ,Boolean satisfiability problem ,Formal verification ,Hardware_LOGICDESIGN - Abstract
Boolean satisfiability (SAT) has been studied for the last twenty years. Advances have been made allowing SAT solvers to be used in many applications including formal verification of digital designs. However, performance and capacity of SAT solvers are still limited. From the practical side, many of the existing applications based on SAT solvers use them as blackboxes in which the problem is translated into a monolithic conjunctive normal form instance and then throw it to the SAT solver with no interaction between the application and the SAT solver. This paper presents a comprehensive study and analysis of the latest developments in SAT-solver and new approaches that used in branching heuristics, Boolean constraint propagation and conflict analysis techniques during the last two decade. In addition, the paper provides the most effective techniques in using SAT solvers as verification techniques, mainly model checkers, to enhance the SAT solver performance, efficiency and productivity. Moreover, the paper presents the remarkable accomplishments and the main challenges facing SAT-solver techniques and contrasts between different techniques according to their efficiency, algorithms, usage and feasibility.
- Published
- 2018
43. Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Author
-
Moshe Y. Vardi, Anastasios Kyrillidis, Anshumali Shrivastava, and Zhiwei Zhang
- Subjects
Reduction (complexity) ,Continuous optimization ,Linguistics and Language ,Multilinear map ,Theoretical computer science ,Cardinality ,Artificial Intelligence ,Computer science ,Conjunctive normal form ,Boolean satisfiability problem ,Boolean function ,Language and Linguistics ,Local search (constraint satisfaction) - Abstract
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side—especially that of Conflict-Driven Clause Learning (CDCL) and Local Search SAT solvers—has been remarkable. Yet, while SAT solvers, aimed at solving industrial-scale benchmarks in Conjunctive Normal Form ( CNF ), have become quite mature, SAT solvers that are effective on other types of constraints (e.g., cardinality constraints and XOR s) are less well-studied; a general approach to handling non- CNF constraints is still lacking. To address the issue above, we design FourierSAT , 1 an incomplete SAT solver based on Fourier Analysis (also known as Walsh-Fourier Transform) of Boolean functions, a technique to represent Boolean functions by multilinear polynomials. By such a reduction to continuous optimization, we propose an algebraic framework for solving systems consisting of different types of constraints. The idea is to leverage gradient information to guide the search process in the direction of local improvements. We show this reduction enjoys interesting theoretical properties. Empirical results demonstrate that FourierSAT can be a useful complement to other solvers on certain classes of benchmarks.
- Published
- 2021
44. Enhancing unsatisfiable cores for LTL with information on temporal relevance
- Author
-
Viktor Schuppan
- Subjects
FOS: Computer and information sciences ,Computer Science - Logic in Computer Science ,Theoretical computer science ,General Computer Science ,Computer science ,media_common.quotation_subject ,F.4.1 ,F.3.1 ,D.2.4 ,B5.2 ,I.2.4 ,02 engineering and technology ,lcsh:QA75.5-76.95 ,Theoretical Computer Science ,Computer Science - Software Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Relevance (information retrieval) ,Conjunctive normal form ,media_common ,Mathematics ,lcsh:Mathematics ,020207 software engineering ,Resolution (logic) ,lcsh:QA1-939 ,Logic in Computer Science (cs.LO) ,Software Engineering (cs.SE) ,Debugging ,020201 artificial intelligence & image processing ,lcsh:Electronic computers. Computer science ,Algorithm - Abstract
LTL is frequently used to express specifications in many domains such as embedded systems or business processes. Witnesses can help to understand why an LTL specification is satisfiable, and a number of approaches exist to make understanding a witness easier. In the case of unsatisfiable specifications unsatisfiable cores (UCs), i.e., parts of an unsatisfiable formula that are themselves unsatisfiable, are a well established means for debugging. However, little work has been done to help understanding a UC of an unsatisfiable LTL formula. In this paper we suggest to enhance a UC of an unsatisfiable LTL formula with additional information about the time points at which the subformulas of the UC are relevant for unsatisfiability. For example, in "(G p) and (X not p)" the first occurrence of "p" is really only "relevant" for unsatisfiability at time point 1 (time starts at time point 0). We present a method to extract such information from the resolution graph of a temporal resolution proof of unsatisfiability of an LTL formula. We implement our method in TRP++, and we experimentally evaluate it. Source code of our tool is available., In Proceedings QAPL 2013, arXiv:1306.2413
- Published
- 2016
45. Hardware-Oriented Algebraic Fault Attack Framework with Multiple Fault Injection Support
- Author
-
Mael Gay, Tobias Paxian, Devanshi Upadhyaya, Bernd Becker, and Ilia Polian
- Subjects
021110 strategic, defence & security studies ,Cryptographic primitive ,business.industry ,Computer science ,Advanced Encryption Standard ,0211 other engineering and technologies ,02 engineering and technology ,Fault (power engineering) ,Cipher ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Hardware_ARITHMETICANDLOGICSTRUCTURES ,Fault model ,Conjunctive normal form ,business ,Field-programmable gate array ,Computer hardware ,Block cipher - Abstract
The evaluation of fault attacks on security-critical hardware implementations of cryptographic primitives is an important concern. In such regards, we have created a framework for automated construction of fault attacks on hardware realization of ciphers. The framework can be used to quickly evaluate any cipher implementations, including any optimisations. It takes the circuit description of the cipher and the fault model as input. The output of the framework is a set of algebraic equations, such as conjunctive normal form (CNF) clauses, which is then fed to a SAT solver. We consider both attacking an actual implementation of a cipher on an field-programmable gate array (FPGA) platform using a fault injector and the evaluation of an early design of the cipher using idealized fault models. We report the successful application of our hardware-oriented framework to a collection of ciphers, including the advanced encryption standard (AES), and the lightweight block ciphers LED and PRESENT. The corresponding results and a discussion of the impact to different fault models on our framework are shown. Moreover, we report significant improvements compared to similar frameworks, such as speedups or more advanced features. Our framework is the first algebraic fault attack (AFA) tool to evaluate the state-of-the art cipher LED-64, PRESENT and full-scale AES using only hardware-oriented structural cipher descriptions.
- Published
- 2019
46. ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
- Author
-
Vu H. N. Phan, Jeffrey M. Dudek, and Moshe Y. Vardi
- Subjects
FOS: Computer and information sciences ,Model counting ,050101 languages & linguistics ,Computer Science - Logic in Computer Science ,Computer science ,Computer Science - Artificial Intelligence ,05 social sciences ,02 engineering and technology ,General Medicine ,Solver ,Data structure ,Logic in Computer Science (cs.LO) ,Dynamic programming ,Artificial Intelligence (cs.AI) ,Computer Science - Data Structures and Algorithms ,0202 electrical engineering, electronic engineering, information engineering ,Algebraic decision diagrams ,Data Structures and Algorithms (cs.DS) ,020201 artificial intelligence & image processing ,0501 psychology and cognitive sciences ,Conjunctive normal form ,Heuristics ,Algorithm ,Standard model (cryptography) - Abstract
We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in Conjunctive Normal Form. Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the primary data structure. We implement this technique in ADDMC, a new model counter. We empirically evaluate various heuristics that can be used with ADDMC. We then compare ADDMC to state-of-the-art exact weighted model counters (Cachet, c2d, d4, and miniC2D) on 1914 standard model counting benchmarks and show that ADDMC significantly improves the virtual best solver., Presented at AAAI 2020
- Published
- 2019
47. Efficient Verified (UN)SAT Certificate Checking
- Author
-
Peter Lammich
- Subjects
Programming language ,business.industry ,Computer science ,Integer sequence ,020207 software engineering ,0102 computer and information sciences ,02 engineering and technology ,Solver ,computer.software_genre ,Certificate ,01 natural sciences ,Satisfiability ,Set (abstract data type) ,Software ,Computational Theory and Mathematics ,010201 computation theory & mathematics ,Artificial Intelligence ,0202 electrical engineering, electronic engineering, information engineering ,Conjunctive normal form ,business ,Boolean satisfiability problem ,computer - Abstract
SAT solvers decide the satisfiability of Boolean formulas in conjunctivenormal form. They are commonly used for software and hardware verification.Modern SAT solvers are highly complex and optimized programs. As a single bug in the solver may invalidate the verification of many systems, SAT solvers output certificates for their answer, which are then checked independently. However, even certificate checking requires highly optimized non-trivial programs. This paper presents the first SAT solver certificate checker that is formally verified down to the integer sequence representing the formula. Our tool supports the full DRAT standard, and is even faster than the unverified state-of-the-art tool drat-trim, on a realistic set of benchmarks drawn from the 2016 and 2017 SAT competitions. An optional multi-threaded mode further reduces the runtime, in particular for big certificates.
- Published
- 2019
48. IMLI
- Author
-
Bishwamittra Ghosh and Kuldeep S. Meel
- Subjects
FOS: Computer and information sciences ,Computer Science - Machine Learning ,Computer Science - Artificial Intelligence ,Computer science ,Heuristic ,business.industry ,Context (language use) ,02 engineering and technology ,Machine learning ,computer.software_genre ,01 natural sciences ,Partition (database) ,Machine Learning (cs.LG) ,010104 statistics & probability ,Artificial Intelligence (cs.AI) ,Maximum satisfiability problem ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Artificial intelligence ,0101 mathematics ,Conjunctive normal form ,Medical diagnosis ,business ,computer ,Interpretability - Abstract
The wide adoption of machine learning in the critical domains such as medical diagnosis, law, education had propelled the need for interpretable techniques due to the need for end users to understand the reasoning behind decisions due to learning systems. The computational intractability of interpretable learning led practitioners to design heuristic techniques, which fail to provide sound handles to tradeoff accuracy and interpretability. Motivated by the success of MaxSAT solvers over the past decade, recently MaxSAT-based approach, called MLIC, was proposed that seeks to reduce the problem of learning interpretable rules expressed in Conjunctive Normal Form (CNF) to a MaxSAT query. While MLIC was shown to achieve accuracy similar to that of other state of the art black-box classifiers while generating small interpretable CNF formulas, the runtime performance of MLIC is significantly lagging and renders approach unusable in practice. In this context, authors raised the question: Is it possible to achieve the best of both worlds, i.e., a sound framework for interpretable learning that can take advantage of MaxSAT solvers while scaling to real-world instances? In this paper, we take a step towards answering the above question in affirmation. We propose IMLI: an incremental approach to MaxSAT based framework that achieves scalable runtime performance via partition-based training methodology. Extensive experiments on benchmarks arising from UCI repository demonstrate that IMLI achieves up to three orders of magnitude runtime improvement without loss of accuracy and interpretability., Comment: 10 pages, published in the proceedings of AAAI/ACM Conference on AI, Ethics, and Society (AIES 2019)
- Published
- 2019
49. Tractable Learning and Inference for Large-Scale Probabilistic Boolean Networks
- Author
-
Diana Marculescu and Ifigeneia Apostolopoulou
- Subjects
FOS: Computer and information sciences ,Theoretical computer science ,Dynamical systems theory ,Markov chain ,Computer Networks and Communications ,Computer science ,Probabilistic logic ,Markov process ,Inference ,02 engineering and technology ,Computer Science Applications ,Machine Learning (cs.LG) ,symbols.namesake ,Computer Science - Learning ,Artificial Intelligence ,0202 electrical engineering, electronic engineering, information engineering ,symbols ,020201 artificial intelligence & image processing ,Conjunctive normal form ,Representation (mathematics) ,Software - Abstract
Probabilistic Boolean Networks (PBNs) have been previously proposed so as to gain insights into complex dy- namical systems. However, identification of large networks and of the underlying discrete Markov Chain which describes their temporal evolution, still remains a challenge. In this paper, we introduce an equivalent representation for the PBN, the Stochastic Conjunctive Normal Form (SCNF), which paves the way to a scalable learning algorithm and helps predict long- run dynamic behavior of large-scale systems. Moreover, SCNF allows its efficient sampling so as to statistically infer multi- step transition probabilities which can provide knowledge on the activity levels of individual nodes in the long run., Comment: 16 pages
- Published
- 2019
50. Realizing Boolean Functions Using Probabilistic Spin Logic (PSL)
- Author
-
Sneh Saurabh and Vaibhav Agarwal
- Subjects
Digital electronics ,OR gate ,business.industry ,Computer science ,Probabilistic logic ,PSL ,Logic gate ,Inverse function ,Conjunctive normal form ,business ,Boolean function ,Hardware_REGISTER-TRANSFER-LEVELIMPLEMENTATION ,Algorithm ,Hardware_LOGICDESIGN - Abstract
Probabilistic Spin Logic (PSL) is a novel computing model that can be implemented using stochastic units (called p-bits) such as low-barrier nanomagnets. A PSL can exhibit accuracy which is comparable to a conventional digital circuit. Remarkably, a PSL can also be exploited to compute the inverse of a function. In this paper, using simulations, we examine the application of PSL in realizing Boolean functions. We propose a methodology to implement any Boolean function given in Conjunctive Normal Form (CNF) using PSL. Our methodology is based on synthesizing a given function in terms of NOT/AND/OR gates and deriving appropriate interconnections between p-bits. Further, we demonstrate the application of PSL in computing the inverse of a given function.
- Published
- 2019
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.