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

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

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n14http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n13http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n7http://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Disjunctive_normal_form
rdfs:label
Disjunctive normal form
rdfs:comment
In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving.
owl:sameAs
freebase:m.0jpw_
dbp:wikiPageUsesTemplate
dbt:Cn dbt:Short_description dbt:Color dbt:Springer dbt:Reflist dbt:Refimprove dbt:Cite_book dbt:Rp dbt:Multiple dbt:No_footnotes
dct:subject
dbc:Normal_forms_(logic)
dbo:thumbnail
n13:Karnaugh_map_KV_4mal4_18.svg?width=300
foaf:depiction
n13:Karnaugh_map_KV_4mal4_18.svg n13:Karnaugh_map_KV_4mal4_19.svg
gold:hypernym
dbr:Standardization
prov:wasDerivedFrom
n7:Disjunctive_normal_form?oldid=1048937265&ns=0
dbo:wikiPageID
73341
dbo:wikiPageLength
6194
dbo:wikiPageRevisionID
1048937265
dbo:wikiPageWikiLink
dbr:Boolean_algebra dbr:Negation dbr:Boolean_satisfiability_problem dbr:Logical_disjunction dbr:Canonical_normal_form dbr:Boolean_function dbr:Conjunctive_normal_form dbr:Philosophical_logic dbr:Propositional_calculus dbr:Quine–McCluskey_algorithm dbr:Automated_theorem_proving n14:Karnaugh_map_KV_4mal4_18.svg dbr:Truth_table dbr:Logical_equivalence dbr:Context-free_grammar n14:Karnaugh_map_KV_4mal4_19.svg dbr:Propositional_variable dbr:Algebraic_normal_form dbr:Tautology_(logic) dbr:Analysis_of_algorithms dbr:Logical_conjunction dbr:Distributive_property dbr:Blake_canonical_form dbr:Normal_form_(abstract_rewriting) dbr:Literal_(mathematical_logic) dbr:NP-hardness dbr:Co-NP-complete dbr:Double_negation dbc:Normal_forms_(logic) dbr:De_Morgan's_laws
dbo:abstract
In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or (in philosophical logic) a cluster concept. As a normal form, it is useful in automated theorem proving.
foaf:isPrimaryTopicOf
n7:Disjunctive_normal_form