<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/cschenk/boolean"><title>BibSonomy bookmarks for /user/cschenk/boolean</title><link>https://www.bibsonomy.org/user/cschenk/boolean</link><description>BibSonomy RSS Feed for /user/cschenk/boolean</description><items><rdf:Seq><rdf:li rdf:resource="http://de.wikipedia.org/wiki/Karnaugh-Veitch-Diagramm"/><rdf:li rdf:resource="http://ti.itec.uka.de/KVD/"/><rdf:li rdf:resource="http://www.eecs.harvard.edu/cs141/resources/logic.html"/></rdf:Seq></items></channel><item rdf:about="http://de.wikipedia.org/wiki/Karnaugh-Veitch-Diagramm"><title>Karnaugh-Veitch-Diagramm – Wikipedia</title><description></description><link>http://de.wikipedia.org/wiki/Karnaugh-Veitch-Diagramm</link><dc:creator>cschenk</dc:creator><dc:date>2008-03-28T10:44:35+01:00</dc:date><dc:subject>boolean diagramme digitaltechnik dnf karnaugh knf kvd maxterm minterm normalformen studium theoretische-informatik uni veitch wikipedia </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-03-28T10:44:35+01:00&#034; href=&#034;http://de.wikipedia.org/wiki/Karnaugh-Veitch-Diagramm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://de.wikipedia.org/wiki/Karnaugh-Veitch-Diagramm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/boolean"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/diagramme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/digitaltechnik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dnf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/karnaugh"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/knf"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kvd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/maxterm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/minterm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/normalformen"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/studium"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theoretische-informatik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/uni"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/veitch"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/></rdf:Bag></taxo:topics></item><item rdf:about="http://ti.itec.uka.de/KVD/"><title>Karnaugh-Veitch-Diagramme</title><description>Die bereitgestellte Software dient zur Visualisierung der Minimierung Boolescher Funktionen mit Hilfe von KV-Diagrammen</description><link>http://ti.itec.uka.de/KVD/</link><dc:creator>cschenk</dc:creator><dc:date>2008-03-28T10:18:11+01:00</dc:date><dc:subject>applet boolean diagramme digitaltechnik karnaugh kvd maxterm minterm software studium theoretische-informatik uni veitch visualization </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Die bereitgestellte Software dient zur Visualisierung der Minimierung Boolescher Funktionen mit Hilfe von KV-Diagrammen&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/applet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/boolean"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/diagramme"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/digitaltechnik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/karnaugh"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/kvd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/maxterm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/minterm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/studium"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theoretische-informatik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/uni"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/veitch"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.eecs.harvard.edu/cs141/resources/logic.html"><title>Truth Table Generator</title><description>The program will create a truth table by cycling through all possible states of the variables</description><link>http://www.eecs.harvard.edu/cs141/resources/logic.html</link><dc:creator>cschenk</dc:creator><dc:date>2008-02-07T21:46:21+01:00</dc:date><dc:subject>boolean harvard logic table theoretische-informatik tools truth variables </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The program will create a truth table by cycling through all possible states of the variables&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/boolean"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/harvard"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/logic"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/table"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theoretische-informatik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/truth"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/variables"/></rdf:Bag></taxo:topics></item></rdf:RDF>