Results 21 to 30 of about 1,160 (65)

Certified grammar transformation to Chomsky normal form in f

, 2016
Certified programming allows to prove that the program meets its specification. The check of correctness of a program is performed at compile time, which guarantees that the program always runs as specified.
M. Polubelova, S. Bozhko, S. Grigorev
semanticscholar   +1 more source

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing [PDF]

Nature Communications
The Boolean satisfiability (SAT) problem is a computationally challenging decision problem central to many industrial applications. For SAT problems in cryptanalysis, circuit design, and telecommunication, solutions can often be found more efficiently by
Haesol Im, F. Böhm, Giacomo Pedretti, Noriyuki Kushida, Moslem Noori, Elisabetta Valiante, Xiangyi Zhang, Chan-Woo Yang, Tinish Bhattacharya, X. Sheng, J. Ignowski, Arne Heittmann, J. Strachan, M. Mohseni, R. Beausoleil, T. Vaerenbergh, Ignacio Rozada   +16 more
semanticscholar   +1 more source

Parsing for ET0L Systems

, 2020
This thesis focuses on deciding the membership of strings in languages generated by ET0L systems. It is achieved by designing two algorithms. The first one is a modification of the existing algorithm Cocke-Younger-Kasami for syntax analysis of context ...
Kožár, Tomáš
core  

A Compiler for Weak Decomposable Negation Normal Form

AAAI Conference on Artificial Intelligence
This paper integrates weak decomposable negation normal form (wDNNF) circuits, introduced by Akshay et al. in 2018, into the knowledge compilation map.
Petr Illner, P. Kučera
semanticscholar   +1 more source

A Method for Deriving Systolic Algorithms

, 1992
We can solve several problems, in particular the recognition of strings in context free grammars in Chomsky Normal Form, using dynamic programming methods in O(n 3 ) sequential time.
Robert Wagner, Michael D. Landis, Robert A. Wagner, Michael D. L   +3 more
core  

Generator Pohon Untuk Grammar Berbasis Algoritma Couke Younger Kasami

, 2016
Syntactic analysis is a series of processes in order to validate a string that is received by a language. In this section it is often difficult to be explained properly, especially when making the rules up into a tree decline valid received by language ...
Susanto, Ajib, Wijanarto, Wijanarto
core  

Polynomial-Time 0-1 Linear Programming Approach to CNF-SAT Using Totally Unimodular Matrices

Asian Research Journal of Mathematics
Efficient 0-1 Linear Programming Approach for CNF-SAT Based on Unimodularity. CNF-SAT, i.e, the satisfaction of a Conjunctive Normal Form, is considered of  NP complexity. It can be formulated as an Integer Programmining problem.
Angelo Monfroglio
semanticscholar   +1 more source

Generating all permutations by context-free grammars in Chomsky normal form

Theoretical Computer Science, 2004
P. Asveld
semanticscholar   +1 more source

Random generation of RNA secondary structures according to native distributions. [PDF]

Algorithms Mol Biol, 2011
Nebel ME, Scheid A, Weinberg F.
europepmc   +1 more source

A Novel Grammar-Based Approach for Patients' Symptom and Disease Diagnosis Information Dissemination to Maintain Confidentiality and Information Integrity. [PDF]

Bioengineering (Basel)
Nag S, Basu N, Bose P, Bandyopadhyay SK.
europepmc   +1 more source