• DERIVE

  • Referenced in 65 articles [sw02964]
  • expressions, equations, functions, vectors, matrices and Boolean expressions like a scientific calculator processes numbers...
  • PolyBoRi

  • Referenced in 48 articles [sw00723]
  • hardware and software verification based on Boolean expressions, which suffer-besides from the complexity...
  • XPath

  • Referenced in 375 articles [sw15780]
  • XPath 2.0 is an expression language that allows the processing of values conforming ... atomic values such as integers, strings, and booleans, and sequences that may contain both references ... atomic values. The result of an XPath expression may be a selection of nodes from...
  • Kodkod

  • Referenced in 26 articles [sw07090]
  • representation of boolean formulas inspired by boolean expression diagrams and reduced boolean circuits. The presented...
  • TCPDUMP

  • Referenced in 22 articles [sw04165]
  • network interface that match the boolean expression. It can also be run with...
  • REVEAL

  • Referenced in 28 articles [sw36999]
  • genetic network architectures. Given the immanent gene expression mapping covering whole genomes during development, health ... transition tables of Boolean nets, resemble time series of gene expression. By systematically analyzing ... While this study is limited to synchronous Boolean networks, the algorithm is generalizable to include...
  • BLOSOM

  • Referenced in 2 articles [sw18880]
  • BLOSOM: a framework for mining arbitrary boolean expressions. We introduce a novel framework, called BLOSOM ... mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions ... conjunctions. We focus on mining the simplest expressions the minimal generators for each class ... each class that yields closed boolean expressions. BLOSOM efficiently mines frequent boolean expressions by utilizing...
  • POLY

  • Referenced in 2 articles [sw01164]
  • description of an object, i.e. a Boolean expression over primitives, is displayed as a binary ... creating a subobject by performing a Boolean expression over primitives...
  • PRECiSA

  • Referenced in 2 articles [sw38041]
  • that may occur. In addition, a Boolean expression that characterizes the input values leading...
  • Localizer

  • Referenced in 21 articles [sw21238]
  • search algorithms. Localizer makes it possible to express local search algorithms in a notation close ... descriptions in scientific papers. Experimental results on Boolean satisfiability graph coloring, graph partitioning...
  • AMoRE

  • Referenced in 12 articles [sw20980]
  • automata theory algorithms, including: conversion of regular expression into finite automata, determinization and minimization ... minimization of nondeterministic automata), language operations (e.g. boolean and regular operations, quotients, shuffle product), tests...
  • GLIMPSE

  • Referenced in 9 articles [sw23326]
  • including Boolean queries, approximate matching (i.e., allowing misspelling), and even searching for regular expressions...
  • medrxivr

  • Referenced in 1 article [sw35505]
  • downloaded preprint records using regular expressions and Boolean logic, as well as helper functions that...
  • jFuzzyIBATranslator

  • Referenced in 4 articles [sw22488]
  • algebra (IBA) is real-valued realization of Boolean algebra, mostly used in performance measuring ... process any expression and transform it to an analog Generalized Boolean Polynomial (GBP). All transformation...
  • JFormula

  • Referenced in 0 articles [sw05494]
  • expression. It supports the +, -, *, ^, and % operators, boolean expressions, a short expression format...
  • GraMoFoNe

  • Referenced in 3 articles [sw34237]
  • choose to express our problem as a linear pseudo-boolean optimization problem...
  • SMV

  • Referenced in 13 articles [sw04135]
  • types in the language are finite ones. Booleans, scalars and fixed arrays. Static, structured data ... checking algorithm to efficiently determine whether specifications expressed in CTL are satisfied...
  • EVC

  • Referenced in 8 articles [sw13374]
  • Uninterpreted Functions and Memories (EUFM). The logic expresses connectness of high-level microprocessors. We present ... which can then be evaluated by any Boolean satisfiability (SAT) procedure. EVC has been used...
  • SQUAD

  • Referenced in 5 articles [sw29353]
  • qualitative information about patterns of expression to infer the regulatory networks that generate such patterns ... SQUAD method, which approximates a Boolean network with the use of a set of ordinary...