Results 1 to 10 of about 5,149 (81)
Cause-effect relationships and partially defined Boolean functions [PDF]
Annals of Operations Research, 1988 This paper investigates the use of Boolean techniques in a systematic study of cause-effect relationships. The model uses partially defined Boolean functions. Procedures are provided to extrapolate from limited observations, concise and meaningful theories to explain the effect under study, and to prevent (or provoke) its occurrence.
Ibaraki Toshihide +2 more
exaly +3 more sources
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Peter L Hammer
exaly +3 more sources
Variations on extending partially defined Boolean functions with missing bits
Information and Computation, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Kazuhisa Makino
exaly +2 more sources
Positive and Horn decomposability of partially defined Boolean functions
Discrete Applied Mathematics, 1997 Let \(T\) be a set of positive examples, \(F\) a set of negative examples, i.e. \(T,F\subset\{0,1\}^n\), \(T\cap F=\emptyset\), and let \((T,F)\) be the partially defined Boolean function (pdBf), defined by \[ (T,F)(\nu)=\begin{cases} 1\text{ if }\nu\in T\\ 0\text{ if }\nu\in F\end{cases} \] Given a pdBf \((T,F)\) and a family of subsets \(S_i\subseteq\
Kazuhisa Makino
exaly +3 more sources
Inner-core and outer-core functions of partially defined Boolean functions
Discrete Applied Mathematics, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazuhisa Makino
exaly +3 more sources
Error-Free and Best-Fit Extensions of Partially Defined Boolean Functions
Information and Computation, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Kazuhisa Makino
exaly +2 more sources
Inapproximability of a Pair of Forms Defining a Partial Boolean Function
CoRR, 2021 We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B) = \{1\}$. We hypothesize that this problem is easier to solve or approximate than the well-understood problem of ...
Stein, David, Andres, Bjoern
openaire +4 more sources
Eastern-European Journal of Enterprise Technologies, 2023 This paper reports a research that established the possibility of increasing the effectiveness of the method of figurative transformations to minimize partially defined Boolean functions. The method makes it possible, without loss of functionality, to reduce the complexity of the minimization procedure, compared to sorting out binary definitions of ...
Mykhailo Solomko +5 more
openaire +3 more sources
Journal of Engineering Research and Reports, 2021 This paper utilizes a modern regular and modular eight-variable Karnaugh map in a systematic investigation of cause-effect relationships modeled by partially-defined Boolean functions (PDBF) (known also as incompletely specified switching functions). First, we present a Karnaugh-map test that can decide whether a certain variable must be included in a ...
Raid Salih Badawi +1 more
openaire +2 more sources
Comparison of Four Weighting Methods in Fuzzy-based Land Suitability to Predict Wheat Yield
مجله آب و خاک, 2017 Introduction: Land suitability evaluation is a process to examine the degree of land fitness for specific utilization and also makes it possible to estimate land productivity potential.
Fatemeh Rahmati, Ardavan Kamali
doaj +1 more source