41.192.255.123: /* External links */

2014-03-06T12:41:42Z

External links

Show changes

138.246.2.200: Fix a minor error in LaTeX

2014-02-25T12:45:51Z

Fix a minor error in LaTeX

Show changes

134.58.253.57: Removed "is an example". It's not an example, it's an actual algorithm.

2013-11-14T13:55:28Z

Removed "is an example". It's not an example, it's an actual algorithm.

← Older revision		Revision as of 15:55, 14 November 2013
Line 1:		Line 1:
	~~Nice~~ to ~~satisfy you~~, ~~my title~~ is ~~Araceli Oquendo but I don~~'~~t like when individuals use my full~~ name. ~~Some time~~ in the ~~past he selected~~ to ~~live in Idaho~~. The ~~job I've been occupying for many years~~ is a ~~bookkeeper but I've currently applied~~ for ~~another 1~~. ~~Camping~~ is ~~something~~ that ~~I've~~ done ~~for many years~~.<br><br>~~Here is my weblog auto warranty~~ ([http://~~Myonlinearcade~~.com/~~profile~~/~~408868~~/~~ClGlasgow.html Read Home Page~~])		In [[formal logic]], '''Horn-satisfiability''', or '''HORNSAT''', is the problem of deciding whether a given set of propositional [[Horn clause]]s is satisfiable or not.

			A Horn clause is a [[Clause (logic)\|clause]] with at most one positive [[literal (mathematical logic)\|literal]], called the ''head'' of the clause, and any number of negative literals, forming the ''body'' of the clause. A Horn formula is a [[propositional formula]] formed by [[logical and\|conjunction]] of Horn clauses.

			The problem of Horn satisfiability is solvable in [[linear time]].<ref>Dowling, W., and Gallier, J., (1984) "Linear-time algorithms for testing the satisfiability of propositional Horn formulae". ''[[Journal of Logic Programming]]'', '''3''', 267-284</ref> A polynomial-time algorithm for Horn satisfiability is based on the rule of [[unit propagation]]: if the formula contains a clause composed of a single literal <math>l</math> (a unit clause), then all clauses containing <math>l</math> (except the unit clause itself) are removed, and all clauses containing <math>\neg l</math> have this literal removed. The result of the second rule may itself be a unit clause, which is propagated in the same manner. If there are no unit clauses, the formula can be satisfied by simply setting all remaining variables negative. The formula is unsatisfiable if this transformation generates a pair of opposite unit clauses <math>l</math> and <math>\neg l</math>. Horn satisfiability is actually one of the "hardest" or "most expressive" problems which is known to be computable in polynomial time, in the sense that it is a [[P-complete\|'''P'''-complete]] problem.<ref name="CookNguyen2010">{{cite book\|author1=Stephen Cook\|author2=Phuong Nguyen\|title=Logical foundations of proof complexity\|url=http://books.google.com/books?id=2aW2sSlQj_QC&pg=PA224\|year=2010\|publisher=Cambridge University Press\|isbn=978-0-521-51729-4\|page=224}}</ref>

			This algorithm also allows determining a truth assignment of satisfiable Horn formulae: all variables contained in a unit clause are set to the value satisfying that unit clause; all other literals are set to false. The resulting assignment is the minimal model of the Horn formula, that is, the assignment having a minimal set of variables assigned to true, where comparison is made using set containment.

			Using a linear algorithm for unit propagation, the algorithm is linear in the size of the formula.

			A generalization of the class of Horn formulae is that of renamable-Horn formulae, which is the set of formulae that can be placed in Horn form by replacing some variables with their respective negation. Checking the existence of such a replacement can be done in linear time; therefore, the satisfiability of such formulae is in P as it can be solved by first performing this replacement and then checking the satisfiability of the resulting Horn formula.<ref>
			{{cite journal
			\| last=Chandru
			\| first=Vijaya
			\| coauthors=Collette R. Coullard, Peter L. Hammer, Miguel Montañez, and Xiaorong Sun
			\| title=On renamable Horn and generalized Horn functions
			\| journal=Annals of Mathematics and Artificial Intelligence
			\| year=2005
			\| doi=10.1007/BF01531069
			\| volume=1
			\| issue=1–4
			\| pages=33–47
			}}</ref>

			The Horn satisfiability problem can also be asked for propositional [[many-valued logic]]s. The algorithms are not usually linear, but some are polynomial; see Hähnle (2001 or 2003) for a survey.<ref>{{cite book\|editor=Dov M. Gabbay, Franz Günthner\|title=Handbook of philosophical logic\|url=http://books.google.com/books?id=_ol81ow-1s4C&pg=PA373\|year=2001\|publisher=Springer\|isbn=978-0-7923-7126-7\|page=373\|chapter=Advanced many-valued logics\|author=Reiner Hähnle\|edition=2nd\|volume=2}}</ref><ref name="FittingOrlowska2003">{{cite book\|editor=Melvin Fitting, Ewa Orlowska\|title=Beyond two: theory and applications of multiple-valued logic\|year=2003\|publisher=Springer\|isbn=978-3-7908-1541-2\|author=Reiner Hähnle\|chapter=Complexity of Many-valued Logics}}</ref>

			==See also==

			* [[Unit propagation]]
			* [[Boolean satisfiability problem]]
			* [[2-satisfiability]]

			==References==
			<references />

			[[Category:Logic in computer science]]
			[[Category:P-complete problems]]
			[[Category:Satisfiability problems]]

			{{comp-sci-theory-stub}}

62.32.27.39: /* Simple C# Implementation */ minor code reformatting

2012-08-21T11:24:58Z

Simple C# Implementation: minor code reformatting

New page

Nice to satisfy you, my title is Araceli Oquendo but I don't like when individuals use my full name. Some time in the past he selected to live in Idaho. The job I've been occupying for many years is a bookkeeper but I've currently applied for another 1. Camping is something that I've done for many years.<br><br>Here is my weblog auto warranty ([http://Myonlinearcade.com/profile/408868/ClGlasgow.html Read Home Page])

Sort-merge join - Revision history

41.192.255.123: /* External links */

138.246.2.200: Fix a minor error in LaTeX

134.58.253.57: Removed "is an example". It's not an example, it's an actual algorithm.

62.32.27.39: /* Simple C# Implementation */ minor code reformatting