Horn-kielégíthetőség (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Horn-kielégíthetőség" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

3^rd place

28^th place

books.google.com

Stephen Cook. Logical foundations of proof complexity. Cambridge University Press, 224. o. (2010). ISBN 978-0-521-51729-4
Reiner Hähnle.szerk.: Dov M. Gabbay, Franz Günthner: Advanced many-valued logics, Handbook of philosophical logic, 2nd, Springer, 373. o. (2001). ISBN 978-0-7923-7126-7

Buning (1995). „Resolution for Quantified Boolean Formulas”. Information and Computation 117 (1), 12–18. o, Kiadó: Elsevier. DOI:10.1006/inco.1995.1025.
Lewis (1978). „Renaming a set of clauses as a Horn set”. Journal of the ACM 25 (1), 134–135. o. DOI:10.1145/322047.322059. .
Aspvall (1980). „Recognizing disguised NR(1) instances of the satisfiability problem”. Journal of Algorithms 1 (1), 97–103. o. DOI:10.1016/0196-6774(80)90007-3.
Hébrard (1994). „A linear algorithm for renaming a set of clauses as a Horn set”. Theoretical Computer Science 124 (2), 343–350. o. DOI:10.1016/0304-3975(94)90015-9. .
Chandru (2005). „On renamable Horn and generalized Horn functions”. Annals of Mathematics and Artificial Intelligence 1 (1–4), 33–47. o. DOI:10.1007/BF01531069.