{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:08:14Z","timestamp":1725653294067},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642276590"},{"type":"electronic","value":"9783642276606"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27660-6_15","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T15:14:28Z","timestamp":1326726868000},"page":"177-189","source":"Crossref","is-referenced-by-count":5,"title":["Properties of SLUR Formulae"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[]},{"given":"Petr","family":"Ku\u010dera","sequence":"additional","affiliation":[]},{"given":"V\u00e1clav","family":"Vl\u010dek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"15_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","volume":"1","author":"B. Aspvall","year":"1980","unstructured":"Aspvall, B.: Recognizing disguised nr(1) instances of the satisfiability problem. Journal of Algorithms\u00a01(1), 97\u2013103 (1980)","journal-title":"Journal of Algorithms"},{"key":"15_CR2","volume-title":"Propositional Logic: Deduction and Algorithms","author":"H.K. Buning","year":"1999","unstructured":"Buning, H.K., Letterman, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, New York (1999)"},{"key":"15_CR3","unstructured":"\u010cepek, O., Ku\u010dera, P.: Various notes on SLUR formulae. In: Proceedings of the 13th Czech-Japan Seminar on Data Analysis and Decision Making in Service Science, Otaru, Japan, pp. 85\u201395 (2010)"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1145\/102782.102789","volume":"38","author":"V. Chandru","year":"1991","unstructured":"Chandru, V., Hooker, J.N.: Extended horn sets in propositional logic. J. ACM\u00a038(1), 205\u2013221 (1991)","journal-title":"J. ACM"},{"issue":"19-20","key":"15_CR5","doi-asserted-by":"publisher","first-page":"2411","DOI":"10.1016\/j.disc.2005.12.033","volume":"306","author":"M. Conforti","year":"2006","unstructured":"Conforti, M., Cornu\u00e9jols, G., Vuskovic, K.: Balanced matrices. Discrete Mathematics\u00a0306(19-20), 2411\u20132437 (2006)","journal-title":"Discrete Mathematics"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC 1971: Proceedings of the Third Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(92)90081-6","volume":"44","author":"M. Dala","year":"1992","unstructured":"Dala, M., Etherington, D.W.: A hierarchy of tractable satisfiability problems. Information Processing Letters\u00a044(4), 173\u2013180 (1992)","journal-title":"Information Processing Letters"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear time algorithms for testing the satisfiability of propositional horn formulae. Journal of Logic Programming\u00a03, 267\u2013284 (1984)","journal-title":"Journal of Logic Programming"},{"issue":"2-3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00358-4","volume":"125","author":"J. Franco","year":"2003","unstructured":"Franco, J., Van Gelder, A.: A perspective on certain polynomial-time solvable classes of satisfiability. Discrete Appl. Math.\u00a0125(2-3), 177\u2013214 (2003)","journal-title":"Discrete Appl. Math."},{"key":"15_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman and Company, San Francisco (1979)"},{"key":"15_CR11","volume-title":"Logical Foundations of Artificial Intelligence","author":"M.R. Genesereth","year":"1987","unstructured":"Genesereth, M.R., Nilsson, N.J.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos (1987)"},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","volume":"4","author":"A. Itai","year":"1987","unstructured":"Itai, A., Makowsky, J.A.: Unification as a complexity measure for logic programming. Journal of Logic Programming\u00a04, 105\u2013117 (1987)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/322047.322059","volume":"25","author":"H.R. Lewis","year":"1978","unstructured":"Lewis, H.R.: Renaming a set of clauses as a horn set. J. ACM\u00a025(1), 134\u2013135 (1978)","journal-title":"J. ACM"},{"key":"15_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","volume":"29","author":"M. Minoux","year":"1988","unstructured":"Minoux, M.: Ltur: A simplified linear time unit resolution algorithm for horn formulae and computer implementation. Information Processing Letters\u00a029, 1\u201312 (1988)","journal-title":"Information Processing Letters"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(95)00019-9","volume":"54","author":"J.S. Schlipf","year":"1995","unstructured":"Schlipf, J.S., Annexstein, F.S., Franco, J.V., Swaminathan, R.P.: On finding solutions for extended horn formulas. Inf. Process. Lett.\u00a054(3), 133\u2013137 (1995)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2012: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27660-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T23:54:07Z","timestamp":1556150047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27660-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642276590","9783642276606"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27660-6_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}