Publications related to Conjunctive normal form

Validating functional redundancy with mixed generative adversarial networks

Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Trung-Dung Hoang

Data redundancy has been one of the most important problems in data-intensive applications such as data mining and machine learning. Removing data redundancy brings many benefits in efficient data updating, effective data storage, and error-free query proc ...

ELSEVIER2023

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Viktor Kuncak, Simon Guilloud

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

Springer2022

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

Paolo Ienne, Andrea Guerrieri, Lana Josipovic, Ayatallah Ahmed Gamal Kamal Elakhras

High-level synthesis (HLS) is the process of automatically generating circuits out of high-level language descriptions. Previous research has shown that dynamically scheduled HLS through elastic circuit generation is successful at exploiting parallelism in ...

IEEE COMPUTER SOC2022

On Polynomial Algorithms for Normalizing Formulas

Viktor Kuncak, Simon Guilloud, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2022

On the Power and Limitations of Branch and Cut

Mika Tapani Göös

The Stabbing Planes proof system [Paul Beame et al., 2018] was introduced to model the reasoning carried out in practical mixed integer programming solvers. As a proof system, it is powerful enough to simulate Cutting Planes and to refute the Tseitin formu ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Majority Logic Representation and Satisfiability

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù

Majority logic is a powerful generalization of common AND/OR logic. Original two-level and multi-level logic networks can use majority operators as primitive connective, in place of AND/ORs. In such a way, Boolean functions have novel means for compact rep ...

2014

Measurement of in-plane and out-of-plane displacements and strains using digital holographic moiré

Pramod Rastogi, Sai Siva Gorthi, Rishikesh Dilip Kulkarni

The paper proposes a non-destructive method for simultaneous measurement of in-plane and out-of-plane displacements and strains undergone by a deformed specimen from a single moire fringe pattern obtained on the specimen in a dual beam digital holographic ...

Taylor & Francis2014

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Conjunctive normal form

Validating functional redundancy with mixed generative adversarial networks

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

On Polynomial Algorithms for Normalizing Formulas

On the Power and Limitations of Branch and Cut

A unifying framework for form-finding and topology-finding of tensegrity structures

SAT-Based Exact Synthesis for Multi-Level Logic Networks

Atomic distributions in crystal structures solved by Boolean satisfiability techniques

Majority Logic Representation and Satisfiability

Measurement of in-plane and out-of-plane displacements and strains using digital holographic moiré

Graph Chatbot

Chat with Graph Search

Validating functional redundancy with mixed generative adversarial networks

On Polynomial Algorithms for Normalizing Formulas

Atomic distributions in crystal structures solved by Boolean satisfiability techniques

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

On the Power and Limitations of Branch and Cut

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

A unifying framework for form-finding and topology-finding of tensegrity structures

Measurement of in-plane and out-of-plane displacements and strains using digital holographic moiré

Majority Logic Representation and Satisfiability

SAT-Based Exact Synthesis for Multi-Level Logic Networks