Results 41 to 50 of about 1,765 (205)
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
Analyzing capacitated networks via Boolean-based coherent pseudo-Boolean functions [PDF]
Network Biology, 2021 This paper introduces a novel method for analyzing capacitated networks through the utilization of the concept of a "probability-ready expression" for a Boolean-based coherent pseudo-Boolean function. Our main concern is to assess the performance indexes
Ali Muhammad Ali Rushdi +1 more
doaj
Minimal disjunctive normal form
, 2016 The truth table of a k-order Boolean function has 2^k rows. Its disjunctive normal form extracts all rows that return True. The prime implicants for these cases consolidate rules by introducing so-called "don't care" inputs that specify cases that do not
Schreiber, Michael
core +1 more source
Disjunctive normal unsupervised LDA for P300-based brain-computer interfaces [PDF]
, 2016 Can people use text-entry based brain-computer interface (BCI) systems and start a free spelling mode without any calibration session? Brain activities differ largely across people and across sessions for the same user.
Tolga Tasdizen +5 more
core +3 more sources
De Morgan Functions and Free De Morgan Algebras
Demonstratio Mathematica, 2014 It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M. +2 more
doaj +1 more source
A heuristic method for bi-decomposition of partial Boolean functions
Informatika, 2020 The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source
Semantics and complexity of recursive aggregates in answer set programming
, 2011 The addition of aggregates has been one of the most relevant enhancements to the language of answer set programming (ASP). They strengthen the modelling power of ASP in terms of natural and concise problem representations.
Faber, Wolfgang +2 more
core +1 more source
On the size of disjunctive formulas in the μ-calculus [PDF]
, 2021 A key result in the theory of the modal mu-calculus is the disjunctive normal form theorem by Janin & Walukiewicz, stating that every mu-calculus formula is semantically equivalent to a so-called disjunctive formula.
Kupke, C. +5 more
core +1 more source
Checking the Satisfiability of ALCN-concepts with a Complete DNF
工程科学与技术, 2009 :The Tableaux based on “unfolding gradually” may produce a lot of repetitive intermediate concept descriptions in deciding the satisfiabilities of acyclic concepts in a variety of description logics, which wastes large space.
Gu Hua-Mao, Gao Ji, Wang Xun
doaj
A MODIFIED ALGORITHM FOR MINIMIZING THE DISJUNCTIVE NORMAL FORM
Proceedings in Cybernetics, 2023 The article describes an algorithm for a directed search to find the minimum disjunctive normal form using the lexicographic order.
openaire +1 more source