{"id":"https://openalex.org/W2071035573","doi":"https://doi.org/10.2168/lmcs-1(1:5)2005","title":"Linear Datalog and Bounded Path Duality of Relational Structures","display_name":"Linear Datalog and Bounded Path Duality of Relational Structures","publication_year":2005,"publication_date":"2005-04-29","ids":{"openalex":"https://openalex.org/W2071035573","doi":"https://doi.org/10.2168/lmcs-1(1:5)2005","mag":"2071035573"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-1(1:5)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:5)2005","pdf_url":"https://lmcs.episciences.org/2275/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/2275/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Victor Dalmau","orcid":null},"institutions":[{"id":"https://openalex.org/I170486558","display_name":"Universitat Pompeu Fabra","ror":"https://ror.org/04n0g0b29","country_code":"ES","type":"education","lineage":["https://openalex.org/I170486558"]}],"countries":["ES"],"is_corresponding":true,"raw_author_name":"Victor Dalmau","raw_affiliation_strings":["Departament de Tecnologia, Universitat Pompeu Fabra,, Estaci de Frana, Passeig de la Circum-val.lacio 8. Barcelona 08003, Spain,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departament de Tecnologia, Universitat Pompeu Fabra,, Estaci de Frana, Passeig de la Circum-val.lacio 8. Barcelona 08003, Spain,","institution_ids":["https://openalex.org/I170486558"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I170486558"],"apc_list":null,"apc_paid":null,"fwci":3.7108,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.9357009,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 1, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.27219998836517334,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.27219998836517334,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.20800000429153442,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.18140000104904175,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.8176000118255615},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.7084000110626221},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6704000234603882},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6291000247001648},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6202999949455261},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5286999940872192}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8176000118255615},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.7084000110626221},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6704000234603882},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6291000247001648},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6202999949455261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5461000204086304},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5286999940872192},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.506600022315979},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46810001134872437},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.42879998683929443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29440000653266907},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2809000015258789},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.26919999718666077},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.26649999618530273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2635999917984009}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-1(1:5)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:5)2005","pdf_url":"https://lmcs.episciences.org/2275/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:cs/0504027","is_oa":true,"landing_page_url":"http://arxiv.org/abs/cs/0504027","pdf_url":"https://arxiv.org/pdf/cs/0504027","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:ee0db70e252049969e8a5e5a780f7a69","is_oa":true,"landing_page_url":"https://doaj.org/article/ee0db70e252049969e8a5e5a780f7a69","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 1, Issue 1 (2005)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-1(1:5)2005","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-1(1:5)2005","pdf_url":"https://lmcs.episciences.org/2275/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2668045193","display_name":"Aspects of Computation Theory and Logic","funder_award_id":"9610257","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309018","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2071035573.pdf","grobid_xml":"https://content.openalex.org/works/W2071035573.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W153181359","https://openalex.org/W1489296438","https://openalex.org/W1508474696","https://openalex.org/W1565047086","https://openalex.org/W1570219696","https://openalex.org/W1571873445","https://openalex.org/W1748315421","https://openalex.org/W1825515612","https://openalex.org/W1965377399","https://openalex.org/W1976011706","https://openalex.org/W1979514837","https://openalex.org/W1989168011","https://openalex.org/W2025319967","https://openalex.org/W2033405938","https://openalex.org/W2036265926","https://openalex.org/W2038225707","https://openalex.org/W2041737564","https://openalex.org/W2046284526","https://openalex.org/W2061734130","https://openalex.org/W2063356069","https://openalex.org/W2077575555","https://openalex.org/W2080192364","https://openalex.org/W2104881994","https://openalex.org/W2112957923","https://openalex.org/W2116407296","https://openalex.org/W2119456262","https://openalex.org/W2135432705","https://openalex.org/W2150339067","https://openalex.org/W2153597031","https://openalex.org/W2155002729","https://openalex.org/W2166197332","https://openalex.org/W2166566648","https://openalex.org/W2171280299","https://openalex.org/W4212857488","https://openalex.org/W4254380579"],"related_works":["https://openalex.org/W1581526951","https://openalex.org/W3016424514","https://openalex.org/W1964929013","https://openalex.org/W2148351559","https://openalex.org/W2012293611","https://openalex.org/W2338525844","https://openalex.org/W2962917480","https://openalex.org/W3080875783","https://openalex.org/W2326739023","https://openalex.org/W3104030884"],"abstract_inverted_index":{"In":[0],"this":[1,85],"paper":[2,109],"we":[3,48,102],"systematically":[4],"investigate":[5],"the":[6,28,56,61,104,108],"connections":[7],"between":[8],"logics":[9],"with":[10,75],"a":[11,43,89],"finite":[12],"number":[13],"of":[14,17,30,42,60,63,94],"variables,":[15],"structures":[16],"bounded":[18,50,64,76],"pathwidth,":[19],"and":[20,83],"linear":[21],"Datalog":[22],"Programs.":[23],"We":[24,53,67],"prove":[25],"that,":[26],"in":[27,81,88,99,107,114],"context":[29],"Constraint":[31],"Satisfaction":[32],"Problems,":[33],"all":[34,92],"these":[35],"concepts":[36],"correspond":[37],"to":[38,97,110],"different":[39],"mathematical":[40],"embodiments":[41],"unique":[44],"robust":[45],"notion":[46,62,86],"that":[47,69,84],"call":[49],"path":[51,65,77],"duality.":[52,66],"also":[54],"study":[55],"computational":[57],"complexity":[58],"implications":[59],"show":[68],"every":[70],"constraint":[71],"satisfaction":[72],"problem":[73],"$\\csp(\\best)$":[74],"duality":[78],"is":[79],"solvable":[80],"NL":[82],"explains":[87],"uniform":[90],"way":[91],"families":[93],"CSPs":[95],"known":[96],"be":[98],"NL.":[100,115],"Finally,":[101],"use":[103],"results":[105],"developed":[106],"identify":[111],"new":[112],"problems":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}