Linux and UNIX Man Pages

Linux & Unix Commands - Search Man Pages

boolstuff(3) [debian man page]

boolstuff(3)															      boolstuff(3)

NAME
boolstuff - Disjunctive Normal Form boolean expression C++ library SYNOPSIS
g++ prog.cpp -lboolstuff DESCRIPTION
boolstuff is a C++ library that contains an algorithm to convert a boolean expression binary tree into the Disjunctive Normal Form. The NOT operator is supported. A C API covers most of the library's functionality. The Disjunctive Normal Form is an ORing of ANDed terms. In other words, if the OR is considered an additive operation and the AND a multi- plicative operation, then the DNF is a sum of products. For example, the DNF of the expression a&(b|c) is a&b|a&c The DNF eliminates parentheses and provides a normalized form of the original expression. This normalized form is easier to execute. The DNF produced by BoolStuff is devoid of any "useless" terms, which are always false (e.g., x&y&!x), but the terms that form the DNF are not necessarily simplified (e.g., x&y&x). When executing an expression in DNF, it is recommended to obtain the list of terms and then to obtain the set of variables used in each term. In the case of the term x&y&x, the set will only contain x once. EXAMPLES
The library's source archive comes with an example program (in the 'examples' subdirectory) and with two testing programs (in the src/bool- stuff subdirectory). LICENSE
This program is free software; you may redistribute it under the terms of the GNU General Public License. This program has absolutely no warranty. AUTHOR
Pierre Sarrazin See the BoolStuff Home Page: http://sarrazip.com/dev/boolstuff.html Comments are welcome. BUGS
Version 0.1.x is an unstable development version. The programming interface of the library and the command-line options of the accompany- ing commands are not necessarily fixed. The documentation has not been reviewed for completeness. HISTORY
George Boole (1815-1864) is an English mathematician who helped establish modern symbolic logic and whose algebra of logic, now called Boolean algebra, is basic to the design of digital computer circuits. October 13th, 2008 boolstuff(3)

Check Out this Related Man Page

RDF::Query::Algebra::Path(3pm)				User Contributed Perl Documentation			    RDF::Query::Algebra::Path(3pm)

NAME
RDF::Query::Algebra::Path - Algebra class for path patterns VERSION
This document describes RDF::Query::Algebra::Path version 2.908. METHODS
Beyond the methods documented below, this class inherits methods from the RDF::Query::Algebra class. "new ( $start, [ $op, @paths ], $end, $graph )" Returns a new Path structure. "construct_args" Returns a list of arguments that, passed to this class' constructor, will produce a clone of this algebra pattern. "path" Returns the path description for this path expression. "start" Returns the path origin node. "end" Returns the path destination node. "graph" Returns the named graph. "distinguish_bnode_variables" Returns a new Path object with blank nodes replaced by distinguished variables. "bounded_length" Returns true if the path is of bounded length. "sse" Returns the SSE string for this algebra expression. "as_sparql" Returns the SPARQL string for this algebra expression. "type" Returns the type of this algebra expression. "referenced_variables" Returns a list of the variable names used in this algebra expression. "potentially_bound" Returns a list of the variable names used in this algebra expression that will bind values during execution. "definite_variables" Returns a list of the variable names that will be bound after evaluating this algebra expression. AUTHOR
Gregory Todd Williams <gwilliams@cpan.org> perl v5.14.2 2012-01-31 RDF::Query::Algebra::Path(3pm)
Man Page