This HTML5 document contains 50 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
n16http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n8https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
dbpedia-srhttp://sr.dbpedia.org/resource/
freebasehttp://rdf.freebase.com/ns/
n14http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_data_structures
dbo:wikiPageWikiLink
dbr:Propositional_directed_acyclic_graph
Subject Item
dbr:PDAG
dbo:wikiPageWikiLink
dbr:Propositional_directed_acyclic_graph
dbo:wikiPageDisambiguates
dbr:Propositional_directed_acyclic_graph
Subject Item
dbr:Propositional_directed_acyclic_graph
rdf:type
yago:Arrangement105726596 yago:Structure105726345 yago:VisualCommunication106873252 yago:DataStructure105728493 yago:Graph107000195 yago:Communication100033020 yago:WikicatGraphDataStructures yago:Abstraction100002137 yago:PsychologicalFeature100023100 yago:Cognition100023271 yago:WikicatDirectedGraphs
rdfs:label
Propositional directed acyclic graph
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.
foaf:depiction
n14:BDD2pdag.png n14:BDD2pdag_simple.svg n14:BDD_simple.svg
dcterms:subject
dbc:Directed_graphs dbc:Boolean_algebra dbc:Graph_data_structures
dbo:wikiPageID
4477141
dbo:wikiPageRevisionID
1076467926
dbo:wikiPageWikiLink
dbr:Proposition_(mathematics) dbr:Boolean_function dbc:Directed_graphs dbr:Boolean_satisfiability_problem n16:BDD_simple.svg dbr:Binary_decision_diagram dbc:Boolean_algebra dbc:Graph_data_structures n16:BDD2pdag.png n16:BDD2pdag_simple.svg dbr:Data_structure dbr:Negation_normal_form dbr:Directed_acyclic_graph
owl:sameAs
yago-res:Propositional_directed_acyclic_graph n8:4tuY1 freebase:m.0c4mq5 dbpedia-sr:Исказни_усмерени_ациклични_граф wikidata:Q7250415
dbo:thumbnail
n14:BDD_simple.svg?width=300
dbo: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.
prov:wasDerivedFrom
wikipedia-en:Propositional_directed_acyclic_graph?oldid=1076467926&ns=0
dbo:wikiPageLength
2968
foaf:isPrimaryTopicOf
wikipedia-en:Propositional_directed_acyclic_graph
Subject Item
dbr:Binary_decision_diagram
dbo:wikiPageWikiLink
dbr:Propositional_directed_acyclic_graph
Subject Item
dbr:Boolean_function
dbo:wikiPageWikiLink
dbr:Propositional_directed_acyclic_graph
Subject Item
wikipedia-en:Propositional_directed_acyclic_graph
foaf:primaryTopic
dbr:Propositional_directed_acyclic_graph