Exploració per tema "Algebra, Boolean"
Ara es mostren els items 1-16 de 16
-
A characterization of weighted simple games based on pseudoweightings
(2020-09-14)
Article
Accés obertThe paper provides a new characterization of weighted games within the class of simple games. It is based on a stronger form of the point-set-additive pseudoweighting property of simple games. The characterization obtained ... -
Analyzing multiple conflicts in SAT: an experimental evaluation
(EasyChair Publications, 2023)
Text en actes de congrés
Accés obertUnit propagation and conflict analysis are two essential ingredients of CDCL SAT Solving. The order in which unit propagation is computed does not matter when no conflict is found, because it is well known that there exists ... -
Anti-alignments in conformance checking: the dark side of process models
(Springer, 2016)
Text en actes de congrés
Accés obertConformance checking techniques asses the suitability of a process model in representing an underlying process, observed through a collection of real executions. These techniques suffer from the wellknown state space ... -
Automatic detection of at-most-one and exactly-one relations for improved SAT encodings of pseudo-boolean constraints
(Springer, 2019)
Text en actes de congrés
Accés obertPseudo-Boolean (PB) constraints often have a critical role in constraint satisfaction and optimisation problems. Encoding PB constraints to SAT has proven to be an efficient approach in many applications, however care must ... -
Boolean operations for 3D simulation of CNC machining
(2002-07-04)
Report de recerca
Accés obertThis paper addresses the simulation of drilling tools CNC machining. It describes a novel approach for the computation of the boundary representation of the machined tools. Machining consists of a sequence of boolean ... -
Bounded-width QBF is PSPACE-complete
(2014-11-01)
Article
Accés obertTree-width and path-width are two well-studied parameters of structures that measure their similarity to a tree and a path, respectively. We show that QBF on instances with constant path-width, and hence constant tree-width, ... -
Coloración de grafos
(2000-05)
Article
Accés obertEstudiamos algunos resultados sobre rama-coloración de grafos y su relación con el teorema del mapa de cuatro colores. A tal fin, se introduce la noción de “coloración” de una conjunto de ramas y se estudian sus propiedades ... -
Dos problemas
(1985-09)
Report de recerca
Accés obert -
Extreme weights in Steinhaus triangles
(2016-09-08)
Article
Accés obertLet {0=w0<w1<w2<…<wm0=w0<w1<w2<…<wm} be the set of weights of binary Steinhaus triangles of size n , and let Wibe the set of sequences in F2n that generate triangles of weight wi. In this paper we obtain the values of wi ... -
Graphs, Friends and Acquaintances
(2010-04-23)
Report de recerca
Accés obertAs is well known, a graph is a mathematical object modeling the existence of a certain relation between pairs of elements of a given set. Therefore, it is not surprising that many of the first results concerning graphs ... -
Learning read-constant polynomials of constant degree modulo composites
(2014-08)
Article
Accés obertBoolean functions that have constant degree polynomial representation over a fixed finite ring form a natural and strict subclass of the complexity class ACC0. They are also precisely the functions computable efficiently ... -
Minimal dimensional classes of simple games
(2009)
Report de recerca
Accés restringit per decisió de l'autorEstudi de classes mínimes de jocs simples amb dimensió i codimensió així com de les relacions entre elles -
On the enumeration of Boolean functions with distinguished variables
(Springer Nature, 2020-11-18)
Article
Accés obertBoolean functions have a fundamental role in neural networks and machine learning. Enumerating these functions and significant subclasses is a highly complex problem. Therefore, it is of interest to study subclasses that ... -
On the enumeration of some inequivalent monotone Boolean functions
(2022-12-13)
Article
Accés obertThis paper considers inequivalent monotone Boolean functions of an arbitrary number of variables, two monotone Boolean functions are equivalent if one can be obtained from the other by permuting the variables. It focuses ... -
Parametrized conditional log-specifications: proof theory and correctness
(1989)
Report de recerca
Accés obertConditional LOG-specifications extend standard conditional specifications in that the booleans are considered to be built-in. Formally, there is an initial constraint on booleans in every specification. It is shown that ... -
Propositional logic as Boolean many-valued logic
(1992)
Report de recerca
Accés obertIt is commonly assumed that Boolean logic is synonymous with two-valued logic. However, this needs not be the case. As Boole suspected, and Probability theorists know, one can value propositions in, say, the real unit ...