{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:25Z","timestamp":1725535825871},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_6","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"54-65","source":"Crossref","is-referenced-by-count":3,"title":["Combinatorial Problems for Horn Clauses"],"prefix":"10.1007","author":[{"given":"Marina","family":"Langlois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Sloan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Machine Learning\u00a09, 147\u2013164 (1992)","journal-title":"Machine Learning"},{"key":"6_CR2","volume-title":"Propositional Logic: Deduction and Algorithms","author":"H. Kleine B\u00fcning","year":"1999","unstructured":"Kleine B\u00fcning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)"},{"key":"6_CR3","unstructured":"Langlois, M., Sloan, R.H., Tur\u00e1n, G.: Horn upper bounds of random 3-CNF: A computational study. In: Ninth Int. Symp. Artificial Intelligence and Mathematics (2006), \n                  \n                    http:\/\/anytime.cs.umass.edu\/aimath06\/"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-72788-0_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"M. Langlois","year":"2007","unstructured":"Langlois, M., Sloan, R.H., Tur\u00e1n, G.: Horn upper bounds and renaming. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 80\u201393. Springer, Heidelberg (2007)"},{"key":"6_CR5","unstructured":"Langlois, M., Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Horn complements: Towards Horn-to-Horn belief revision. In: AAAI 2008, pp. 466\u2013471 (2008)"},{"key":"6_CR6","unstructured":"Singh, P.: The public acquisition of commonsense knowledge. In: Proc. AAAI Spring Symposium on Acquiring (and Using) Linguistic (and World) Knowledge for Information Access (2002)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C.E. Alchourr\u00f3n","year":"1985","unstructured":"Alchourr\u00f3n, C.E., G\u00e4rdenfors, P., Makinson, D.: On the logic of theory change: partial meet functions for contraction and revision. J. Symb. Logic\u00a050, 510\u2013530 (1985)","journal-title":"J. Symb. Logic"},{"key":"6_CR8","volume-title":"Artificial Intelligence: A Modern Approach","author":"S. Russell","year":"2003","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice Hall, Englewood Cliffs (2003)","edition":"2"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E. Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow\u2013resolution made simple. J. ACM\u00a048(2), 149\u2013169 (2001)","journal-title":"J. ACM"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoret. Comput. Sci.\u00a039, 297\u2013308 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR11","unstructured":"\u010cepek, O.: Restricted consensus method and quadratic implicates of pure Horn functions. RUTCOR Research Report RRR 31-94, Rutgers University, New Brunswick, NJ (1994)"},{"key":"6_CR12","unstructured":"\u010cepek, O.: Structural Properties and Minimization of Horn Boolean functions. Ph.D thesis, Rutgers University (1995)"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","volume":"3","author":"T. K\u0151v\u00e1ri","year":"1954","unstructured":"K\u0151v\u00e1ri, T., S\u00f3s, V.T., Tur\u00e1n, P.: On a problem of K. Zarankiewicz. Colloquium Math.\u00a03, 50\u201357 (1954)","journal-title":"Zarankiewicz. Colloquium Math."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1017\/S0963548305007236","volume":"15","author":"T. Gowers","year":"2006","unstructured":"Gowers, T.: Quasirandomness, counting and regularity for 3-uniform hypergraphs. Combin. Probab. Comput.\u00a015, 143\u2013184 (2006)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1002\/rsa.10094","volume":"23","author":"B. Nagle","year":"2003","unstructured":"Nagle, B., R\u00f6dl, V.: Regularity properties for triple systems. Random Struct. Algorithms\u00a023(3), 264\u2013332 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1017\/S0963548305006905","volume":"14","author":"Z. F\u00fcredi","year":"2005","unstructured":"F\u00fcredi, Z., Pikhurko, O., Simonovits, M.: On triple systems with independent neighbourhoods. Combinatorics, Probability and Computing\u00a014, 795\u2013813 (2005)","journal-title":"Combinatorics, Probability and Computing"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1090\/S0894-0347-99-00305-7","volume":"12","author":"E. Friedgut","year":"1999","unstructured":"Friedgut, E.: Necessary and sufficient conditions for sharp threshold of graph properties and the k-SAT problem. J. Amer. Math. Soc.\u00a012, 1017\u20131054 (1999)","journal-title":"J. Amer. Math. Soc."},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1567-8326(00)00002-3","volume":"47","author":"P.E. Dunne","year":"2001","unstructured":"Dunne, P.E., Bench-Capon, T.J.M.: A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses. J. Log. Algebr. Program.\u00a047(1), 1\u201314 (2001)","journal-title":"J. Log. Algebr. Program."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/rsa.3240010106","volume":"1","author":"R.M. Karp","year":"1990","unstructured":"Karp, R.M.: The transitive closure of a random digraph. Random Struct. Algorithms\u00a01, 73\u201394 (1990)","journal-title":"Random Struct. Algorithms"},{"key":"6_CR20","first-page":"205","volume":"1","author":"I. Pal\u00e1sti","year":"1966","unstructured":"Pal\u00e1sti, I.: On the strong connectedness of directed random graphs. Studia Sci. Math. Hungar.\u00a01, 205\u2013214 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"key":"6_CR21","first-page":"2694","volume":"E81-A","author":"Y. Uno","year":"1998","unstructured":"Uno, Y., Ibaraki, T.: Reachability problems of random digraphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci.\u00a0E81-A, 2694\u20132702 (1998)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"2","key":"6_CR22","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/rsa.20176","volume":"31","author":"C. Moore","year":"2007","unstructured":"Moore, C., Istrate, G., Demopoulos, D., Vardi, M.Y.: A continuous\u2013discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Struct. Algorithms\u00a031(2), 173\u2013185 (2007)","journal-title":"Random Struct. Algorithms"},{"key":"6_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:12:37Z","timestamp":1552115557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}