About: Propositional directed acyclic graph     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatDirectedGraphs, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FPropositional_directed_acyclic_graph

A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with (true), (false), or a Boolean variable. * Non-leaves are (logical and), (logical or) and (logical not). * - and -nodes have at least one child. * -nodes have exactly one child.

AttributesValues
rdf:type
rdfs:label
  • Propositional directed acyclic graph (en)
rdfs:comment
  • A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with (true), (false), or a Boolean variable. * Non-leaves are (logical and), (logical or) and (logical not). * - and -nodes have at least one child. * -nodes have exactly one child. (en)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/BDD2pdag.png
  • http://commons.wikimedia.org/wiki/Special:FilePath/BDD2pdag_simple.svg
  • http://commons.wikimedia.org/wiki/Special:FilePath/BDD_simple.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
sameAs
thumbnail
has abstract
  • A propositional directed acyclic graph (PDAG) is a data structure that is used to represent a Boolean function. A Boolean function can be represented as a rooted, directed acyclic graph of the following form: * Leaves are labeled with (true), (false), or a Boolean variable. * Non-leaves are (logical and), (logical or) and (logical not). * - and -nodes have at least one child. * -nodes have exactly one child. Leaves labeled with represent the constant Boolean function which always evaluates to 1 (0). A leaf labeled with a Boolean variable is interpreted as the assignment , i.e. it represents the Boolean function which evaluates to 1 if and only if . The Boolean function represented by a -node is the one that evaluates to 1, if and only if the Boolean function of all its children evaluate to 1. Similarly, a -node represents the Boolean function that evaluates to 1, if and only if the Boolean function of at least one child evaluates to 1. Finally, a -node represents the complementary Boolean function its child, i.e. the one that evaluates to 1, if and only if the Boolean function of its child evaluates to 0. (en)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 49 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software