Results 31 to 40 of about 510,140 (296)
Cell Reports, 2020 Summary: Multi-input logic gene circuits can enable sophisticated control of cell function, yet large-scale synthetic circuitry in mammalian cells has relied on post-transcriptional regulation or recombinase-triggered state transitions.
Jiten Doshi +4 more
doaj +1 more source
Complexity of fuzzy answer set programming under Łukasiewicz semantics [PDF]
, 2014 Fuzzy answer set programming (FASP) is a generalization of answer set programming (ASP) in which propositions are allowed to be graded. Little is known about the computational complexity of FASP and almost no techniques are available to compute the ...
Blondeel, Marjon +3 more
core +2 more sources
Approximating Boolean Functions with Disjunctive Normal Form
, 2020 The theorem states that: Every Boolean function can be $ -approximated$ by a Disjunctive Normal Form (DNF) of size $O_ (2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is generated and proving its correctness. We will also dive into some specific Boolean functions and explore how these Boolean functions
Yang, Yunhao, Tan, Andrew
openaire +2 more sources
An Analytical Comparison of Some Rule-Learning Programs [PDF]
, 1985 To become a mature science, Artificial Intelligence needs more theoretical work. One form this should take is the analytic comparison of existing programs to extract precise techniques from the code, compare similar techniques, expose faults, and extend ...
Bundy, Alan, Plummer, D., Silver, B.
core +1 more source
, 2012 Many nonlinear filters used in practise are stack filters. An algorithm is presented which calculates the output distribution of an arbitrary stack filter S from the disjunctive normal form (DNF) of its underlying positive Boolean function. The so called
A.T. Craig +14 more
core +1 more source
Disjunctive ASP with Functions: Decidable Queries and Effective Computation [PDF]
, 2010 Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP^{fs}). We show that query answering in
Bonatti +10 more
core +3 more sources
Informatika, 2022 Objectives. Methods, algorithms and programs for solving problems of minimizing the DNF representations of Boolean functions are widely used in the design of digital systems to reduce the complexity (crystal area) of functional combinational blocks of ...
P. N. Bibilo, I. P. Loginova
doaj +1 more source
On the Sensitivity Conjecture for Disjunctive Normal Forms
, 2016 The sensitivity conjecture of Nisan and Szegedy [CC '94] asks whether for any Boolean function $f$, the maximum sensitivity $s(f)$, is polynomially related to its block sensitivity $bs(f)$, and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open.
S., Karthik C., Tavenas, Sébastien
openaire +5 more sources
Hardware implementation of Boolean functions based on the automaton model
Informatika, 2023 Objectives. Currently, electronic control devices are increasingly being introduced into various household and production products. Microcontrollers of a wide variety of configurations are widely used as such devices.
A. A. Butov
doaj +1 more source
Renyi entropies as a measure of the complexity of counting problems
, 2013 Counting problems such as determining how many bit strings satisfy a given Boolean logic formula are notoriously hard. In many cases, even getting an approximate count is difficult.
Chamon, Claudio, Mucciolo, Eduardo R.
core +1 more source