{ "labelLang" : "hun", "responseDate" : "2024-03-29 11:44", "content" : { "otype" : "JournalArticle", "mtid" : 27217218, "status" : "ADMIN_APPROVED", "published" : true, "comment" : "Admin megjegyzés-24916952\n#JournalID1#\nName: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\nISSN: 0302-9743\n#JournalID2#", "unhandledTickets" : 0, "oldTimestamp" : "2018-03-20T14:52:39.000+0000", "deleted" : false, "oldId" : 17217218, "lastRefresh" : "2022-02-12T11:13:43.572+0000", "lastModified" : "2021-10-23T20:08:36.597+0000", "created" : "2018-03-19T14:50:38.000+0000", "creator" : { "otype" : "Admin", "mtid" : 10060827, "link" : "/api/admin/10060827", "label" : "Zeller Rozália (SZTE admin5)", "familyName" : "Zeller", "givenName" : "Rozália", "published" : true, "oldId" : 10060827, "snippet" : true }, "lastDuplumOK" : "2021-10-23T19:49:29.622+0000", "lastDuplumSearch" : "2021-10-23T19:49:29.622+0000", "adminApproved" : "2021-10-23T20:08:36.607+0000", "adminApprover" : { "otype" : "Admin", "mtid" : 10067876, "link" : "/api/admin/10067876", "label" : "MTMT API (MTMT API user, admin)", "familyName" : "MTMT", "givenName" : "API", "published" : true, "snippet" : true }, "core" : false, "citation" : true, "publicationPending" : false, "type" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "subType" : { "otype" : "SubType", "mtid" : 10000059, "link" : "/api/subtype/10000059", "label" : "Szakcikk (Folyóiratcikk)", "name" : "Szakcikk", "nameEng" : "Article", "docType" : { "otype" : "PublicationType", "mtid" : 24, "link" : "/api/publicationtype/24", "label" : "Folyóiratcikk", "code" : 24, "otypeName" : "JournalArticle", "listPosition" : 1, "published" : true, "oldId" : 24, "snippet" : true }, "listPosition" : 101, "published" : true, "oldId" : 10000059, "snippet" : true }, "category" : { "otype" : "Category", "mtid" : 1, "link" : "/api/category/1", "label" : "Tudományos", "published" : true, "oldId" : 1, "snippet" : true }, "languages" : [ { "otype" : "Language", "mtid" : 10002, "link" : "/api/language/10002", "label" : "Angol", "name" : "Angol", "nameEng" : "English", "published" : true, "oldId" : 2, "snippet" : true } ], "firstAuthor" : "Bulatov, AA", "authorships" : [ { "otype" : "PersonAuthorship", "mtid" : 76261865, "link" : "/api/authorship/76261865", "label" : "Bulatov, AA", "listPosition" : 1, "share" : 0.0, "first" : true, "last" : false, "familyName" : "Bulatov", "givenName" : "AA", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 156293084, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 76261866, "link" : "/api/authorship/76261866", "label" : "Krokhin, A", "listPosition" : 2, "share" : 0.0, "first" : false, "last" : false, "familyName" : "Krokhin", "givenName" : "A", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 156293083, "snippet" : true }, { "otype" : "PersonAuthorship", "mtid" : 76261867, "link" : "/api/authorship/76261867", "label" : "Larose, B", "listPosition" : 3, "share" : 0.0, "first" : false, "last" : true, "familyName" : "Larose", "givenName" : "B", "authorTyped" : true, "editorTyped" : false, "otherTyped" : false, "type" : { "otype" : "AuthorshipType", "mtid" : 1, "link" : "/api/authorshiptype/1", "label" : "Szerző", "code" : 0, "published" : true, "oldId" : 0, "snippet" : true }, "published" : false, "oldId" : 156293082, "snippet" : true } ], "title" : "Dualities for constraint satisfaction problems", "identifiers" : [ { "otype" : "PublicationIdentifier", "mtid" : 13670578, "link" : "/api/publicationidentifier/13670578", "label" : "DOI: 10.1007/978-3-540-92800-3_5", "source" : { "otype" : "PlainSource", "mtid" : 6, "link" : "/api/publicationsource/6", "label" : "DOI", "type" : { "otype" : "PublicationSourceType", "mtid" : 10001, "link" : "/api/publicationsourcetype/10001", "label" : "DOI", "mayHaveOa" : true, "published" : true, "snippet" : true }, "name" : "DOI", "nameEng" : "DOI", "linkPattern" : "https://doi.org/@@@", "publiclyVisible" : true, "published" : true, "oldId" : 6, "snippet" : true }, "validState" : "NO", "idValue" : "10.1007/978-3-540-92800-3_5", "realUrl" : "https://doi.org/10.1007%2F978-3-540-92800-3_5", "published" : false, "oldId" : 16735449, "snippet" : true }, { "otype" : "PublicationIdentifier", "mtid" : 13670577, "link" : "/api/publicationidentifier/13670577", "label" : "Scopus: 59149099890", "source" : { "otype" : "PlainSource", "mtid" : 3, "link" : "/api/publicationsource/3", "label" : "Scopus", "type" : { "otype" : "PublicationSourceType", "mtid" : 10003, "link" : "/api/publicationsourcetype/10003", "label" : "Indexelő adatbázis", "mayHaveOa" : false, "published" : true, "snippet" : true }, "name" : "Scopus", "linkPattern" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-@@@", "publiclyVisible" : true, "published" : true, "oldId" : 3, "snippet" : true }, "validState" : "NO", "idValue" : "59149099890", "realUrl" : "http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-59149099890", "published" : false, "oldId" : 16735448, "snippet" : true } ], "journal" : { "otype" : "Journal", "mtid" : 3028, "link" : "/api/journal/3028", "label" : "LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 0302-9743", "pIssn" : "0302-9743", "reviewType" : "REVIEWED", "noIF" : false, "sciIndexed" : true, "scopusIndexed" : false, "lang" : "FOREIGN", "hungarian" : false, "published" : true, "oldId" : 3028, "snippet" : true }, "volume" : "5250 LNCS", "firstPage" : "93", "lastPage" : "124", "firstPageOrInternalIdForSort" : "93", "pageLength" : 32, "publishedYear" : 2008, "digital" : null, "printed" : null, "sourceYear" : 2018, "packet" : "(Zeller Rozália (SZTE admin5); 2018.03.19. 15:43:25)", "foreignEdition" : true, "foreignLanguage" : true, "fullPublication" : true, "conferencePublication" : false, "nationalOrigin" : false, "missingAuthor" : false, "oaType" : "NONE", "oaCheckDate" : "2022-02-12", "oaFree" : false, "citationCount" : 0, "citationCountUnpublished" : 0, "citationCountWoOther" : 0, "independentCitCountWoOther" : 0, "doiCitationCount" : 0, "wosCitationCount" : 0, "scopusCitationCount" : 0, "independentCitationCount" : 0, "unhandledCitationCount" : 0, "citingPubCount" : 0, "independentCitingPubCount" : 0, "unhandledCitingPubCount" : 0, "citedPubCount" : 6, "citedCount" : 6, "referenceList" : "Afrati, F., Cosmodakis, S., Expressiveness of restricted recursive queries (1989) STOC 1989, pp. 113-126; \n\nAtserias, A., On digraph coloring problems and treewidth duality (2008) European Journal of Combinatorics, 29 (4), pp. 796-820; \n\nAtserias, A., Bulatov, A., Dawar, A., Affine systems of equations and counting infinitary logic (2007) LNCS, 4596, pp. 558-570. , Arge, L, Cachin, C, Jurdzi'nski, T, Tarlecki, A, eds, ICALP 2007, Springer, Heidelberg; \n\nBodirsky, M., Constraint satisfaction problems with infinite templates (2008) LNCS, 5250. , Creignou, N, Kolaitis, P.G, Vollmer, H, eds, Complexity of Constraints, Springer, Heidelberg; \n\nBodirsky, M., Dalmau, V., Datalog and constraint satisfaction with infinite templates (2006) LNCS, 3884, pp. 646-659. , Durand, B, Thomas, W, eds, STACS 2006, Springer, Heidelberg; \n\nBodirsky, M., Dalmau, V.: Datalog and constraint satisfaction with infinite templates (2008) arXiv: 0809.2386v1; Bulatov, A.: Tractable conservative constraint satisfaction problems. In: LICS 2003, pp. 321-330 (2003); Bulatov, A.: A graph of a relational structure and constraint satisfaction problems. In: LICS 2004, pp. 448-457 (2004); Bulatov, A., Combinatorial problems raised from 2-semilattices (2006) Journal of Algebra, 298 (2), pp. 321-339; \n\nBulatov, A., A dichotomy theorem for constraint satisfaction problems on a 3- element set (2006) Journal of the ACM, 53 (1), pp. 66-120; \n\nBulatov, A., Jeavons, P., Algebraic structures in combinatorial problems (2001), Technical Report MATH-AL-4-2001, Technische Universität Dresden, Germany; Bulatov, A., Jeavons, P., Krokhin, A., Classifying complexity of constraints using finite algebras (2005) SIAM Journal on Computing, 34 (3), pp. 720-742; \n\nBulatov, A., Valeriote, M., Recent results on the algebraic approach to the CSP (2008) LNCS, 5250, pp. 68-92. , Creignou, N, Kolaitis, P, Vollmer, H, eds, Complexity of Constraints, Springer, Heidelberg; \n\nCarvalho, C., Dalmau, V., Krokhin, A.: Caterpillar duality for constraint satisfaction problems. In: LICS 2008, pp. 307-316 (2008); Carvalho, C., Dalmau, V., Markovi'c, P., Mar'oti, M., CD(4) has bounded width Algebra Universalis, , accepted; \n\nClasen, M., Valeriote, M., Tame congruence theory (2002) Lectures on Algebraic Model Theory, 15, pp. 67-111. , Fields Institute Monographs; \n\nCohen, D., Jeavons, P., The complexity of constraint languages (2006) Handbook of Constraint Programming, , Rossi, F, van Beek, P, Walsh, T, eds, ch. 8. Elsevier, Amsterdam; \n\nCooper, M.C., Cohen, D.A., Jeavons, P.G., Characterising tractable constraints (1994) Artificial Intelligence, 65, pp. 347-361; \n\nCreignou, N., Khanna, S., Sudan, M., Complexity Classifications of Boolean Constraint Satisfaction Problems (2001) SIAM Monographs on Discrete Mathematics and Applications, 7; \n\nDalmau, V., Linear Datalog and bounded path duality for relational structures. Logical Methods in Computer (2005) Science, 1 (1). , electronic; \n\nDalmau, V., (2008) There are no pure relational width 2 constraint satisfaction problems, , submitted; \n\nDalmau, V., Krokhin, A., Majority constraints have bounded pathwidth duality (2008) European Journal of Combinatorics, 29 (4), pp. 821-837; \n\nDalmau, V., Larose, B.: Maltsev + Datalog ⇒Symmetric Datalog. In: LICS 2008, pp. 297-306 (2008); Dalmau, V., Pearson, J.: Set functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, 1713, pp. 159-173. Springer, Heidelberg (1999); Egri, L., Larose, B., Tesson, P.: Symmetric Datalog and constraint satisfaction problems in Logspace. In: LICS 2007, pp. 193-202 (2007); Feder, T., Classification of homomorphisms to oriented cycles and of k-partite satisfiability (2001) SIAM Journal on Discrete Mathematics, 14 (4), pp. 471-480; \n\nFeder, T., Hell, P., Huang, J., Bi-arc graphs and the complexity of list homomorphisms (2003) Journal of Graph Theory, 42, pp. 61-80; \n\nFeder, T., Vardi, M.Y., The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory (1998) SIAM Journal on Computing, 28, pp. 57-104; \n\nFeder, T., Vardi, M.Y., Homomorphism closed vs. existential positive (2003) Proc. 18th IEEE Symp. on Logic in Computer Science, LICS 2003, pp. 311-320; \n\nFurst, M., Saxe, J., Sipser, M., Parity, circuits, and the polynomial-time hierarchy (1984) Mathematical Systems Theory, 17 (1), pp. 13-27; \n\nGarey, M., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , Freeman, San Francisco; \n\nHell, P.: From graph colouring to constraint satisfaction: there and back again. In: Topics in Discrete Mathematics. Algorithms and Combinatorics, 26, pp. 407-432. Springer, Heidelberg (2006); Hell, P., Nešetřil, J., On the complexity of H-coloring (1990) Journal of Combinatorial Theory, Ser. B, 48, pp. 92-110; \n\nHell, P., Nešetřil, J., (2004) Graphs and Homomorphisms, , Oxford University Press, Oxford; \n\nHell, P., Nešetřil, J., Zhu, X., Duality and polynomial testing of tree homomorphisms (1996) Trans. Amer. Math. Soc, 348, pp. 147-156; \n\nHell, P., Nešetřil, J., Zhu, X.: Duality of graph homomorphisms. In: Combinatorics, Paul Erdös is Eighty. Bolyai Soc. Math. Stud., 2, pp. 271-282. J'anos Bolyai Math. Soc. (1996); Hell, P., Zhou, H., Zhu, X., On homomorphisms to acyclic local tournaments (1995) Journal of Graph Theory, 20 (4), pp. 467-471; \n\nHell, P., Zhu, X., Homomorphisms to oriented paths (1994) Discrete Mathematics, 132, pp. 107-114; \n\nHell, P., Zhu, X., The existence of homomorphisms to oriented cycles (1995) SIAM Journal on Discrete Mathematics, 8, pp. 208-222; \n\nHobby, D., McKenzie, R.N., The Structure of Finite Algebras (1988) Contemporary Mathematics, 76. , American Mathematical Society, Providence; \n\nIdziak, P., Markovic, P., McKenzie, R., Valeriote, M., Willard, R.: Tractability and learnability arising from algebras with few subpowers. In: LICS 2007, pp. 213-222 (2007); Jeavons, P., On the algebraic structure of combinatorial problems (1998) Theoretical Computer Science, 200, pp. 185-204; \n\nJeavons, P.G., Cohen, D.A., Cooper, M.C., Constraints, consistency and closure (1998) Artificial Intelligence, 101 (1-2), pp. 251-265; \n\nKiss, E.W., Valeriote, M., On tractability and congruence distributivity. Logical Methods in Computer (2007) Science, 3 (2). , electronic; \n\nKolaitis, P.G.: On the expressive power of logics on finite models. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 27-124. Springer, Heidelberg (2007); Kolaitis, P.G., Vardi, M.Y., On the expressive power of Datalog: Tools and a case study (1995) Journal of Computer and System Sciences, 51, pp. 110-134; \n\nKolaitis, P.G., Vardi, M.Y., Conjunctive-query containment and constraint satisfaction (2000) Journal of Computer and System Sciences, 61, pp. 302-332; \n\nKolaitis, P.G., Vardi, M.Y.: A logical approach to constraint satisfaction. In: Finite Model Theory and its Applications. EATCS Series: Texts in Theoretical Computer Science, pp. 339-370. Springer, Heidelberg (2007); Kom'arek, P., Some new good characterisations of directed graphs (1984) Časopis Pěst. Mat, 51, pp. 348-354; \n\nKrokhin, A., Bulatov, A., Jeavons, P.: The complexity of constraint satisfaction: an algebraic approach. In: Structural Theory of Automata, Semigroups, and Universal Algebra. NATO Science Series II: Math., Phys., Chem., 207, pp. 181-213. Springer, Heidelberg (2005); Larose, B., Loten, C., Tardif, C., A characterisation of first-order constraint satisfaction problems. Logical Methods in Computer (2007) Science, 3 (4). , electronic; \n\nLarose, B., Tesson, P., Universal algebra and hardness results for constraint satisfaction problems (2007) LNCS, 4596, pp. 267-278. , Arge, L, Cachin, C, Jurdzi'nski, T, Tarlecki, A, eds, ICALP 2007, Springer, Heidelberg; \n\nLarose, B., Valeriote, M., Z'adori, L., (2008) Omitting types, bounded width and the ability to count, , submitted; \n\nLarose, B., Z'adori, L., Bounded width problems and algebras (2007) Algebra Universalis, 56 (3-4), pp. 439-466; \n\nLibkin, L., Elements of Finite Model Theory (2004) EATCS Series: Texts in Theoretical Computer Science, , Springer, Heidelberg; \n\nLoten, C., Tardif, C., Majority functions on structures with finite duality (2008) European Journal of Combinatorics, 29 (4), pp. 979-986; \n\nMar'oti, M., McKenzie, R., Existence theorems for weakly symmetric operations (2007) Algebra Universalis, , to appear; \n\nNěsetřil, J., Pultr, A., On classes of relations and graphs determined by subobjects and factorobjects (1978) Discrete Mathematics, 22, pp. 287-300; \n\nNešetřil, J., Tardif, C., Duality theorems for finite structures (characterising gaps and good characterisations) (2000) Journal of Combinatorial Theory, Ser. B, 80, pp. 80-97; \n\nNešetřil, J., Tardif, C., Short answers to exponentially long questions: Extremal aspects of homomorphism duality (2005) SIAM Journal on Discrete Mathematics, 19 (4), pp. 914-920; \n\n(2006) Handbook of Constraint Programming, , Rossi, F, van Beek, P, Walsh, T, eds, Elsevier, Amsterdam; \n\nRossman, B.: Existential positive types and preservation under homomorphisms. In: LICS 2005, pp. 467-476 (2005); Szendrei, A., Clones in Universal Algebra (1986) Seminaires de Mathematiques Superieures, 99. , University of Montreal; \n\nValeriote, M., A subalgebra intersection property for congruence-distributive varieties (2007) Canadian Journal of Mathematics, , to appear; \n\nZ'adori, L., Posets, near-unanimity functions and zigzags (1993) Bulletin of the Australian Mathematical Society, 47, pp. 79-93", "hasCitationDuplums" : false, "userChangeableUntil" : "2018-03-20T14:52:39.000+0000", "publishDate" : "2018-03-19T17:06:38.000+0000", "directInstitutesForSort" : "", "ownerAuthorCount" : 4, "ownerInstituteCount" : 18, "directInstituteCount" : 0, "authorCount" : 3, "contributorCount" : 0, "hasQualityFactor" : false, "link" : "/api/publication/27217218", "label" : "Bulatov AA et al. Dualities for constraint satisfaction problems. (2008) LECTURE NOTES IN ARTIFICIAL INTELLIGENCE 0302-9743 5250 LNCS 93-124", "template" : "