Results 231 to 240 of about 494,310 (275)

Inner speech in motor cortex and implications for speech neuroprostheses. [PDF]

Cell
Kunz EM, Abramovich Krasa B, Kamdar F, Avansino DT, Hahn N, Yoon S, Singh A, Nason-Tomaszewski SR, Card NS, Jude JJ, Jacques BG, Bechefsky PH, Iacobacci C, Hochberg LR, Rubin DB, Williams ZM, Brandman DM, Stavisky SD, AuYong N, Pandarinath C, Druckmann S, Henderson JM, Willett FR.   +22 more
europepmc   +1 more source

Conjunctive Normal Form

Encyclopedia of Machine Learning and Data Mining, 2011
Bernhard Pfahringer
exaly   +6 more sources

Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra

INFORMS Journal on Computing, 2015
Model counting is the #P problem of counting the number of satisfying solutions of a given propositional formula. Here we focus on a restricted variant of this problem, where the input formula is monotone (i.e., there are no negations). A monotone conjunctive normal form (CNF) formula is sufficient for modeling various graph problems, e.g., the vertex
Radislav Vaisman, Ofer Strichman, Ilya B. Gertsbakh   +2 more
semanticscholar   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

An algorithm for the satisfiability problem of formulas in conjunctive normal form

Journal of Algorithms, 2005
Summary: We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We show that a satisfying assignment of a formula can be found in polynomial time with a success probability of \(2^{-n(1-1/(1+\log m))}\), where \(n\) and \(m\) are the number of variables and the number of clauses of the formula, respectively.
Rainer Schüler
exaly   +4 more sources

Fuzzy Cellular Automata in Conjunctive Normal Form

, 2011
Cellular automata (CA) are discrete dynamical systems comprised of a lattice of finite-state cells. At each time step, each cell updates its state as a function of the previous state of itself and its neighbours. Fuzzy cellular automata (FCA) are a real-valued extension of Boolean cellular automata which "fuzzifies" Boolean logic in the transition ...
D. Forrester
semanticscholar   +5 more sources

Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form

Lecture Notes in Computer Science, 2014
In this paper, a new approach for enumerating the set prime implicants (PI) of a Boolean formula in conjunctive normal form (CNF) is proposed. It is based on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory.
João Marques-Silva, Lakhdar Sais, Yakoub Salhi   +2 more
exaly   +3 more sources

PEL-CNF: Probabilistic event logic conjunctive normal form for video interpretation

2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops), 2011
This is a theoretical paper that proves that probabilistic event logic (PEL) is MAP-equivalent to its conjunctive normal form (PEL-CNF). This allows us to address the NP-hard MAP inference for PEL in a principled manner. We first map the confidence-weighted formulas from a PEL knowledge base to PEL-CNF, and then conduct MAP inference for PEL-CNF using ...
Alan Fern, Siniša Todorović
exaly   +3 more sources

Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions

20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07), 2007
Boolean satisfiability is seeing increasing use as a decision procedure in electronic design automation (EDA) and other domains. Most applications encode their domain specific constraints in conjunctive normal form (CNF), which is accepted as input by most efficient contemporary SAT solvers (Moskewicz et al., 2001).
Zhaohui Fu, Sharad Malik
exaly   +3 more sources

How to Make Manual Conjunctive Normal Form Queries Work in Patents Search [PDF]

Text Retrieval Conference, 2018
This year we focused on the Technology Survey (TS) task: Given a natural language description of the topic, look for related patents about that topic. The task is close to an ad hoc retrieval task, except for the additional information of the specific chemicals or chemical reactions that the user cares about.
Le Zhao, Jamie Callan
semanticscholar   +3 more sources

Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models

Information Processing and Management, 1988
Abstract Most commercial document retrieval systems require queries to be valid Boolean expressions that may be used to split the set of available documents into a subset consisting of documents to be retrieved and a subset of documents not to be retrieved.
Robert M Losee, Abraham Bookstein
exaly   +3 more sources