{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:31Z","timestamp":1774946551107,"version":"3.50.1"},"reference-count":25,"publisher":"Oxford University Press (OUP)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1093\/logcom\/exu003","type":"journal-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T21:55:08Z","timestamp":1392328508000},"page":"893-922","source":"Crossref","is-referenced-by-count":3,"title":["On constraint satisfaction problems below P"],"prefix":"10.1093","volume":"26","author":[{"given":"L\u00e1szl\u00f3","family":"Egri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,2,13]]},"reference":[{"key":"2016052804473441000_26.3.893.1","doi-asserted-by":"crossref","unstructured":"Afrati F. Cosmadakis S. S. Expressiveness of restricted recursive queries. In: Johnson D. S. , editor. Proceedings of the 21st ACM Symposium on Theory of Computing (STOC). ACM; 1989. p. 113-126.","DOI":"10.1145\/73007.73018"},{"key":"2016052804473441000_26.3.893.2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2008.11.001"},{"key":"2016052804473441000_26.3.893.3","doi-asserted-by":"crossref","unstructured":"Barto L. Kozik M. Proceedings of The 50th Annual Symposium on Foundations of Computer Science (FOCS). 2009. Constraint satisfaction problems of bounded width.","DOI":"10.1109\/FOCS.2009.32"},{"key":"2016052804473441000_26.3.893.4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92800-3_5"},{"key":"2016052804473441000_26.3.893.5","doi-asserted-by":"crossref","unstructured":"Burris S. Sankappanavar H. P. A Course in Universal Algebra. Springer-Verlag; 1981. Number 78 in Graduate Texts in Mathematics .","DOI":"10.1007\/978-1-4613-8130-3"},{"key":"2016052804473441000_26.3.893.6","doi-asserted-by":"crossref","unstructured":"Carvalho C. Egri L. Jackson M. Niven T. ; Kulikov A. Vereshchagin N. , editors. On Maltsev digraphs. Proceedings of the 6th International Computer Science Symposium in Russia (CSR) Springer; 2011:181-194.","DOI":"10.1007\/978-3-642-20712-9_14"},{"key":"2016052804473441000_26.3.893.7","doi-asserted-by":"crossref","unstructured":"Dalmau V. Constraint satisfaction problems in non-deterministic logarithmic space. In: Widmayer P. Ruiz F. T. Bueno R. M. Hennessy M. Eidenbenz S. Conejo R. , editors. Proceedings of the 29th International Colloquium on Automata, Languages and Programming. Springer-Verlag; 2002. p. 414-425. ICALP.","DOI":"10.1007\/3-540-45465-9_36"},{"key":"2016052804473441000_26.3.893.8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2007.11.020"},{"key":"2016052804473441000_26.3.893.9","doi-asserted-by":"crossref","unstructured":"Dalmau V. Larose B. IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society; 2008. Maltsev\u2009+\u2009Datalog \u2009\u2192\u2009symmetric Datalog; p. 297-306.","DOI":"10.1109\/LICS.2008.14"},{"key":"2016052804473441000_26.3.893.10","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-011-9333-8"},{"key":"2016052804473441000_26.3.893.11","doi-asserted-by":"crossref","unstructured":"Egri L. Larose B. Tesson P. IEEE Symposium on Logic in Computer Science (LICS). 2007. Symmetric Datalog and constraint satisfaction problems in logspace; p. 193-202.","DOI":"10.1109\/LICS.2007.47"},{"key":"2016052804473441000_26.3.893.12","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199383353"},{"key":"2016052804473441000_26.3.893.13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"2016052804473441000_26.3.893.14","first-page":"112","article-title":"Old and new proofs of the Erd\u00f6s-Ko-Rado Theorem","volume":"26","author":"Frankl","year":"1989","journal-title":"Journal of Sichuan University Natural Science Edition"},{"key":"2016052804473441000_26.3.893.15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90149-A"},{"key":"2016052804473441000_26.3.893.16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122553"},{"key":"2016052804473441000_26.3.893.17","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90235-6"},{"key":"2016052804473441000_26.3.893.18","doi-asserted-by":"crossref","unstructured":"Hobby D. McKenzie R. The Structure of Finite Algebras American Mathematical Society; 1988;76. Contemporary Mathematics.","DOI":"10.1090\/conm\/076"},{"key":"2016052804473441000_26.3.893.19","doi-asserted-by":"crossref","unstructured":"Immerman N. Graduate Texts in Computer Science. Springer; 1999. Descriptive Complexity.","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"2016052804473441000_26.3.893.20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.12.048"},{"key":"2016052804473441000_26.3.893.21","doi-asserted-by":"publisher","DOI":"10.1007\/s00012-007-2012-6"},{"key":"2016052804473441000_26.3.893.22","doi-asserted-by":"crossref","unstructured":"Libkin L. Elements of Finite Model Theory. Springer; 2004.","DOI":"10.1007\/978-3-662-07003-1"},{"key":"2016052804473441000_26.3.893.23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1963-0146104-X"},{"key":"2016052804473441000_26.3.893.24","doi-asserted-by":"crossref","unstructured":"Schaefer T. The complexity of satisfiability problems. In: Lipton R. J. Burkhard W. A. Savitch W. J. Friedman E. P. Aho A. V. , editors. Proceedings of the 10th ACM Symposium on Theory of Computing (STOC). ACM; 1978. p. 216-226.","DOI":"10.1145\/800133.804350"},{"key":"2016052804473441000_26.3.893.25","doi-asserted-by":"crossref","unstructured":"Wegener I. Branching Programs and Binary Decision Diagrams: Theory and Applications. Society for Industrial and Applied Mathematics (SIAM); 2000.","DOI":"10.1137\/1.9780898719789"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/26\/3\/893\/7949135\/exu003.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T12:33:44Z","timestamp":1565181224000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exu003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,13]]},"references-count":25,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2016,5,28]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1093\/logcom\/exu003"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exu003","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,13]]}}}