en>Yobot: Tagging using AWB (10703)

2015-01-07T09:10:25Z

Tagging using AWB (10703)

← Older revision		Revision as of 11:10, 7 January 2015
Line 1:		Line 1:
	[~~[Image~~:~~Implication graph~~.svg\|thumb\|360px\|An implication graph representing the [[2-satisfiability]] instance <math>\scriptscriptstyle(x_0\lor x_2)\land(x_0\lor\lnot x_3)\land(x_1\lor\lnot x_3)\land(x_1\lor\lnot x_4)\land(x_2\lor\lnot x_4)\land{}\atop\quad\scriptscriptstyle(x_0\lor\lnot x_5)\land (x_1\lor\lnot x_5)\land (x_2\lor\lnot x_5)\land (x_3\lor x_6)\land (x_4\lor x_6)\land (x_5\lor x_6).</~~math>]]~~		Friends contact her Claude Gulledge. Her [http://Www.Cars.com/go/advice/Story.jsp?section=buy&story=usedWarranty&subject=warranty buddies] say it's not good for her but what she enjoys doing is flower arranging and she is attempting to make it a occupation. car [http://Www.Wikihow.com/Buy-an-Extended-Warranty-for-a-Car warranty] She works as a financial officer and she will not change it anytime quickly. Delaware has always car warranty been my residing location and will never move.<br><br>Feel free to visit my blog; [http://racespace.org/groups/auto-repair-tips-make-your-car-running-smooth/ extended auto warranty] warranty [http://www.itcomplianceexperts.com/UserProfile/tabid/165/userId/36272/Default.aspx extended car warranty] warranty ([http://testing6.nittanylink.com/ActivityFeed/MyProfile/tabid/60/userId/56/Default.aspx view it now])
	~~In [[mathematical logic]~~]~~, an '''implication graph''~~' is a ~~[[skew-symmetric graph\|skew-symmetric]] [[directed graph]] ''G''(''V'', ''E'') composed of vertex set ''V'' and directed edge set ''E''~~. ~~Each vertex in ''V'' represents the truth status of a~~ [~~[Boolean literal]], and each directed edge from vertex ''u'' to vertex ''v'' represents the [[material implication]] "If the literal ''u'' is true then the literal ''v'' is also true"~~. ~~Implication graphs were originally used for analyzing complex [[Boolean expression]]s~~.

	~~==Applications==~~
	~~A [[2~~-~~satisfiability]] instance in [[conjunctive normal form]] can be transformed into~~ an ~~implication graph by replacing each of its [[disjunction~~]~~]s by~~ a ~~pair of implications~~. ~~An instance is satisfiable if and only if no literal~~ and ~~its negation belong to the same [[strongly connected component]] of its implication graph; this characterization can be used to solve 2-satisfiability instances in linear time~~.<~~ref~~>~~{{cite journal\|author = Aspvall, Bengt~~; [~~[Michael Plass\|Plass, Michael F~~.]]; [~~[Robert Tarjan\|Tarjan, Robert E~~.]]\|title = A linear-time algorithm for testing the truth of certain quantified boolean formulas\|journal = Information Processing Letters \| volume = 8 \| issue = 3 \| pages = 121–123\|year = 1979\|doi = 10.~~1016~~/~~0020-0190(79)90002-4}}<~~/~~ref>~~

	~~==References==~~
	~~<references~~/>

	~~[[Category:Boolean algebra~~]]
	[[~~Category~~:~~Application-specific graphs]]~~
	~~[[Category:Directed graphs]]~~
	~~[[Category:Graph families]~~]

108.68.109.77 at 04:03, 25 February 2011

2011-02-25T04:03:22Z

New page

[[Image:Implication graph.svg|thumb|360px|An implication graph representing the [[2-satisfiability]] instance <math>\scriptscriptstyle(x_0\lor x_2)\land(x_0\lor\lnot x_3)\land(x_1\lor\lnot x_3)\land(x_1\lor\lnot x_4)\land(x_2\lor\lnot x_4)\land{}\atop\quad\scriptscriptstyle(x_0\lor\lnot x_5)\land (x_1\lor\lnot x_5)\land (x_2\lor\lnot x_5)\land (x_3\lor x_6)\land (x_4\lor x_6)\land (x_5\lor x_6).</math>]]
In [[mathematical logic]], an '''implication graph''' is a [[skew-symmetric graph|skew-symmetric]] [[directed graph]] ''G''(''V'', ''E'') composed of vertex set ''V'' and directed edge set ''E''. Each vertex in ''V'' represents the truth status of a [[Boolean literal]], and each directed edge from vertex ''u'' to vertex ''v'' represents the [[material implication]] "If the literal ''u'' is true then the literal ''v'' is also true". Implication graphs were originally used for analyzing complex [[Boolean expression]]s.

==Applications==
A [[2-satisfiability]] instance in [[conjunctive normal form]] can be transformed into an implication graph by replacing each of its [[disjunction]]s by a pair of implications. An instance is satisfiable if and only if no literal and its negation belong to the same [[strongly connected component]] of its implication graph; this characterization can be used to solve 2-satisfiability instances in linear time.<ref>{{cite journal|author = Aspvall, Bengt; [[Michael Plass|Plass, Michael F.]]; [[Robert Tarjan|Tarjan, Robert E.]]|title = A linear-time algorithm for testing the truth of certain quantified boolean formulas|journal = Information Processing Letters | volume = 8 | issue = 3 | pages = 121–123|year = 1979|doi = 10.1016/0020-0190(79)90002-4}}</ref>

==References==
<references/>

[[Category:Boolean algebra]]
[[Category:Application-specific graphs]]
[[Category:Directed graphs]]
[[Category:Graph families]]

Continuous quantum computation - Revision history

en>Yobot: Tagging using AWB (10703)

108.68.109.77 at 04:03, 25 February 2011