Results 41 to 50 of about 1,160 (65)

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

, 2020
The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.
N. Gdansky, A. Denisov
semanticscholar   +1 more source

Veritas: Deterministic Verilog Code Synthesis from LLM-Generated Conjunctive Normal Form

arXiv.org
Automated Verilog code synthesis poses significant challenges and typically demands expert oversight. Traditional high-level synthesis (HLS) methods often fail to scale for real-world designs. While large language models (LLMs) have enhanced scalability,
Prithwish Basu Roy, Akashdeep Saha, Manaar Alam, J. Knechtel, Michail Maniatakos, Ozgur Sinanoglu, Ramesh Karri   +6 more
semanticscholar   +1 more source

Disjunctive and Conjunctive Normal Form Explanations of Clusters Using Auxiliary Information

arXiv.org
We consider generating post-hoc explanations of clusters generated from various datasets using auxiliary information which was not used by clustering algorithms.
Robert Downey, S. Ravi
semanticscholar   +1 more source

Normal form computation of nonlinear dispersion relationship for locally resonant metamaterial

Physica A: Statistical Mechanics and its Applications
This article is devoted to the application of the parametrisation method for invariant manifold with a complex normal form style (CNF), for the derivation of high-order approximations of underdamped nonlinear dispersion relationships for periodic ...
Tao Wang, Cyril Touz'e, Haiqin Li, Qian Ding   +3 more
semanticscholar   +1 more source

Hands-On Teaching of CNF Conversion with Tseytin Transformation: From Boolean Expressions to Combinational Logic Circuits

International Symposium for Design and Technology in Electronic Packaging
This paper presents an active-learning methodology on Tseytin transformation designed for undergraduate and graduate students of logic synthesis and formal methods.
A. Borodzhieva
semanticscholar   +1 more source

Playing a Toy-Grammar with GCS

International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005
O. Unold
semanticscholar   +1 more source

Analogical Conception of Chomsky Normal Form and Greibach Normal Form for Linear, Monadic Context-Free Tree Grammars

IEICE Trans. Inf. Syst., 2006
Akio Fujiyoshi
semanticscholar   +1 more source

Generating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form

J. Autom. Lang. Comb., 2006
P. Asveld
semanticscholar   +1 more source

Study on cellulose nanofibers (CNF) distribution behaviors and their roles in improving paper property

Industrial Crops and Products, 2023
Zonghong Lu, Hao Zhang, Xingye An
exaly  

Complexity of Unordered CNF Games

ACM Transactions on Computation Theory, 2020
Thomas Watson
exaly