Results 11  20
of
150,365
On a natural fuzzification of Boolean logic
, 2004
"... Introduction In this communication we propose two logically sound fuzzification and defuzzification techniques for implementing a credibility calculus on a set of propositional expressions. Both rely on a credibility evaluation domain using the rational interval [1, 1] where the sign carries a sp ..."
Abstract
 Add to MetaCart
Introduction In this communication we propose two logically sound fuzzification and defuzzification techniques for implementing a credibility calculus on a set of propositional expressions. Both rely on a credibility evaluation domain using the rational interval [1, 1] where the sign carries a
Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results
"... We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents ’ knowledge in multiagent contexts, such as “agent a knows as much as agent b”. We analyse the ..."
Abstract
 Add to MetaCart
We introduce epistemic quantified boolean logic (EQBL), an extension of propositional epistemic logic with quantification over propositions. We show that EQBL can express relevant properties about agents ’ knowledge in multiagent contexts, such as “agent a knows as much as agent b”. We analyse
A Probabilistic Boolean Logic and its Meaning
"... We introduce a novel probabilistic Boolean logic (pbl) in which the probabilistic disjunction, conjunction and negation operators, provide the “output ” expected of their deterministic counterparts, with a probability p. By design, this output can be incorrect with a probability (1 − p). In order to ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We introduce a novel probabilistic Boolean logic (pbl) in which the probabilistic disjunction, conjunction and negation operators, provide the “output ” expected of their deterministic counterparts, with a probability p. By design, this output can be incorrect with a probability (1 − p). In order
PROBABILISTIC BOOLEAN LOGIC, ARITHMETIC AND ARCHITECTURES Approved by:
, 2008
"... To my parents The source of my existence, inspiration and strength. iii ACKNOWLEDGEMENTS आचायार् त ्पादमादƣ े पाद ं िशंय ः ःवमेधया।पाद ं सॄƺचाǐरßय ः पाद ं कालबमे ण च॥ “One fourth (of knowledge) from the teacher, one fourth from self study, one fourth from fellow students and one fourth in due time ” ..."
Abstract
 Add to MetaCart
energy, support and guidance throughout the course of my graduate studies. Several key results pertaining to the semantic model and the properties of probabilistic Boolean logic were due to his brilliant insights. In this sense, the results pertaining to the semantic model and the properties
Learning Boolean logic models of signaling networks with ASP
"... Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fun ..."
Abstract
 Add to MetaCart
Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a
Efficient Analog Circuit Modeling By Boolean Logic Operations
"... In this paper, we propose a novel symbolic analysis method for analog behavioral modeling by Boolean logic operations and graph representation. The exact symbolic analysis problem is formulated as a logic circuit synthesis problem where we build a logic circuit which detects whether or not a given s ..."
Abstract
 Add to MetaCart
In this paper, we propose a novel symbolic analysis method for analog behavioral modeling by Boolean logic operations and graph representation. The exact symbolic analysis problem is formulated as a logic circuit synthesis problem where we build a logic circuit which detects whether or not a given
Modeling Biological Reactivity: Statecharts vs. Boolean Logic
 In Proceeding of the Second International Conference on Systems Biology
, 2002
"... Remarkable progress in various fields of biology is leading in the direction of a complete map of the building blocks of biological systems. There is broad agreement among researchers that 21 century biology will focus on attempting to understand how component parts collaborate to create a whole. I ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
the visual formalism of statecharts. We presented a detailed model for T cell activation using statecharts within the general framework of objectoriented modeling. In this work, we compare the statechartbased modeling approach to a Boolean formalism presented by Thomas & D'Ari. This comparison
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions
Beyond Boolean logic: exploring representation languages for learning complex concepts
"... We study concept learning for semanticallymotivated, settheoretic concepts. We first present an experiment in which we show that subjects learn concepts which cannot be represented by a simple Boolean logic. We then present a computational model which is similarly capable of learning these concepts ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We study concept learning for semanticallymotivated, settheoretic concepts. We first present an experiment in which we show that subjects learn concepts which cannot be represented by a simple Boolean logic. We then present a computational model which is similarly capable of learning
Boolean Logic Inspired High Order Perceptron Construction
 SIPAR Workshop'95 Parallel and Distributed Systems, SIPAR SI Group for Parallel Systems, Biel School of Engineering, Computer Science Dept., Rue de la Source 21, CH2501
"... This paper describes and evaluates sevaral new methods for the construction of high order perceptrons. The methods are based on approximating real valued data by Boolean values and to use these as a base for the construnction of a high order neural network. The methods are evaluated for their e ecti ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper describes and evaluates sevaral new methods for the construction of high order perceptrons. The methods are based on approximating real valued data by Boolean values and to use these as a base for the construnction of a high order neural network. The methods are evaluated for their e
Results 11  20
of
150,365