Talk:Horn clause

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Older Discussion[edit]

Not conjunctive, it should be disjunctive normal form.

Wrong. Its conjunctive. Horn form is a conjunction of clauses. A clause is a symbol or {conjunction of symbols} -> symbol. —Preceding unsigned comment added by 137.132.3.7 (talk) 15:15, 30 April 2008 (UTC)[reply]

Deletion[edit]

I deleted

"Recent research ("An Evaluation of the Effect of the Brain-Oriented Organized Knowledge Map (Bookmap) for Improving School Results", Twan Brouwers & Hans Morélis, 2003) has shown that diagrams based on Horn clauses improve the human understanding of complex matter."

because there seems to be no public domain reference for this otherwise interesting work.193.136.122.18 16:47, 19 March 2007 (UTC)[reply]

There is a link http://www.bookmap.com/SLO-report.pdf on https://pt.wikipedia.org/wiki/Cl%C3%A1usula_de_Horn, but it seems broken. - Jochen Burghardt (talk) 19:33, 2 October 2013 (UTC)[reply]

Math Formulas[edit]

This is yet another example of poorly documented symbols in mathematical formulas. It would be nice if articles would give a natural language translation of formulas or give a definition of symbols that are not listed in the Table of mathematical symbols page.

mattelfesso (talk) 03:39, 28 February 2008 (UTC)[reply]

All symbols in this article are listed in Table of mathematical symbols, apart from which is clearly the used in the other direction. Tizio 10:05, 28 February 2008 (UTC)[reply]

You're right! I take back my comment... mattelfesso (talk) 05:21, 15 May 2008 (UTC)[reply]

Maximum 1 Positive Literal[edit]

The german article has a nice table that shows the implications of the above are. Namely a horn clause can be:

Rule: ~A1 v ... v ~An v B      n>=1  
Fact: B  
Query: ~A1 v ... v ~An         n>=1

In Prolog:

Rule: B :- A1, .., An  
Fact: B  
Query: ?- A1, .., An

Maybe the english article could be enhanced accordingly.

Bye

Janburse (talk) 20:06, 12 April 2012 (UTC)[reply]

Recent edit[edit]

The recent edit by an anonymous editor borders on vandalism, removing about half of the article without justification. Some of the changes it introduces are worth keeping, but it would be a lot easier to revert the edit first. Unfortunately, I don't have the time to work on it now myself. Compulogger (talk) 22:56, 21 November 2012 (UTC)[reply]

I integrated the recent editor's changes into the previous version, correcting a number of mistakes along the way. Unfortunately, I seem to have lost the categories at the end. Compulogger (talk) 07:28, 22 November 2012 (UTC)[reply]

Rating[edit]

This is a very important concept. Not as much due to foundations as due to its applications in logic programming, specification, and automated reasoning. I will continue to work on this article, but many concepts can be seen in logic programming. Historically, though, Horn clauses predate logic programming and have use in model theory originally, so they deserve this separate article. Vkuncak (talk) 10:54, 22 November 2013 (UTC)[reply]

Undecideable[edit]

Since it states citation needed, I'm not sure if this is relevant but

https://www.ii.uni.wroc.pl/~jma/csl93.pdf

"A Horn Clause that Implies an Undecidable Set of Horn Clauses"

Can someone with knowledge of this please check if this is a decent citation for the statement "Horn clauses are not decideable"? --130.63.96.77 (talk) 16:57, 4 April 2017 (UTC)[reply]

Also, in the pdf itself:
  • J. Marcinkowski, L. Pacholski: Undecidability of the Horn Clause Implication Problem; Proc 33rd Annual Symposium on the Foundations of Computer Science (1992). pp. 354-362
  • M.Schmidt-Schauss: Implication of Clauses is Undecidable; Theoretical Com-puter Science 59 (1988), pp. 287-296.

--130.63.96.77 (talk) 17:00, 4 April 2017 (UTC)[reply]

Readbility[edit]

It would be nice if the first paragraph said what a horn clause is, in easy to understand text. — Preceding unsigned comment added by 128.16.14.238 (talk) 13:20, 18 May 2017 (UTC)[reply]