Sciweavers

707 search results - page 124 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 8 months ago
Mining The Successful Binary Combinations: Methodology and A Simple Case Study
The importance of finding the characteristics leading to either a success or a failure is one of the driving forces of data mining. The various application areas of finding succes...
Yuval Cohen
CONSTRAINTS
2008
121views more  CONSTRAINTS 2008»
13 years 8 months ago
Modeling Biological Networks by Action Languages via Answer Set Programming
We describe an approach to modeling biological networks by action languages via answer set programming. To this end, we propose an action language for modeling biological networks...
Steve Dworschak, Susanne Grell, Victoria J. Nikifo...
CORR
2008
Springer
113views Education» more  CORR 2008»
13 years 8 months ago
Generalized Modal Satisfiability
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor
JSW
2008
105views more  JSW 2008»
13 years 7 months ago
Representing Procedural Logic in XML
Extensible Markup Language (XML) is a powerful tool used for describing structured documents and exchanging standardized data files over the Internet. This article describes how us...
Albert D. Bethke
JSYML
2006
85views more  JSYML 2006»
13 years 7 months ago
An alternative semantics for quantified relevant logic
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
Robert Goldblatt, Edwin D. Mares