{"id":"https://openalex.org/W4292714640","doi":"https://doi.org/10.1017/s1471068422000333","title":"Positive Dependency Graphs Revisited","display_name":"Positive Dependency Graphs Revisited","publication_year":2022,"publication_date":"2022-08-23","ids":{"openalex":"https://openalex.org/W4292714640","doi":"https://doi.org/10.1017/s1471068422000333"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068422000333","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000333","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1017/s1471068422000333","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112705886","display_name":"Jorge Fandinno","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"JORGE FANDINNO","raw_affiliation_strings":["University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail:","University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail: jfandinno@unomaha.edu)"],"raw_orcid":"https://orcid.org/0000-0002-3917-8717","affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail:","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Nebraska Omaha, Omaha, NE 68182, USA (e-mail: jfandinno@unomaha.edu)","institution_ids":["https://openalex.org/I122266389"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076917986","display_name":"Vladimir Lifschitz","orcid":"https://orcid.org/0000-0001-6051-7907"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VLADIMIR LIFSCHITZ","raw_affiliation_strings":["University of Texas at Austin, Austin, TX 78712, USA (e-mail:"],"raw_orcid":"https://orcid.org/0000-0001-6051-7907","affiliations":[{"raw_affiliation_string":"University of Texas at Austin, Austin, TX 78712, USA (e-mail:","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112705886"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.1387,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54484523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"23","issue":"5","first_page":"1128","last_page":"1137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.8313283920288086},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.813210129737854},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.694014310836792},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5316023826599121},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.48185694217681885},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46244341135025024},{"id":"https://openalex.org/keywords/dependency-theory","display_name":"Dependency theory (database theory)","score":0.43138182163238525},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4268740117549896},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4206226170063019},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.41502201557159424},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.30018675327301025},{"id":"https://openalex.org/keywords/functional-dependency","display_name":"Functional dependency","score":0.27906230092048645},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26611173152923584},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13020846247673035},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10483649373054504},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.060142964124679565}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8313283920288086},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.813210129737854},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.694014310836792},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5316023826599121},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.48185694217681885},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46244341135025024},{"id":"https://openalex.org/C40683218","wikidata":"https://www.wikidata.org/wiki/Q5260625","display_name":"Dependency theory (database theory)","level":4,"score":0.43138182163238525},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4268740117549896},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4206226170063019},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.41502201557159424},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30018675327301025},{"id":"https://openalex.org/C26320393","wikidata":"https://www.wikidata.org/wiki/Q597053","display_name":"Functional dependency","level":3,"score":0.27906230092048645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26611173152923584},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13020846247673035},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10483649373054504},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.060142964124679565},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068422000333","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000333","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1017/s1471068422000333","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s1471068422000333","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W68877015","https://openalex.org/W1639901403","https://openalex.org/W1766332311","https://openalex.org/W1800801472","https://openalex.org/W1985819576","https://openalex.org/W2004414305","https://openalex.org/W2006279573","https://openalex.org/W2105016364","https://openalex.org/W2111353076","https://openalex.org/W2134039900","https://openalex.org/W2144198727","https://openalex.org/W2152131859","https://openalex.org/W2399343913","https://openalex.org/W2912103526","https://openalex.org/W2962690688","https://openalex.org/W2964218452","https://openalex.org/W3199255105","https://openalex.org/W4254790956","https://openalex.org/W6637298476","https://openalex.org/W6680694123","https://openalex.org/W6684378522","https://openalex.org/W6712688321"],"related_works":["https://openalex.org/W1511336005","https://openalex.org/W1903938722","https://openalex.org/W4231236017","https://openalex.org/W1875972884","https://openalex.org/W34858115","https://openalex.org/W1988877409","https://openalex.org/W1575307414","https://openalex.org/W2076569795","https://openalex.org/W3088092049","https://openalex.org/W2728676088"],"abstract_inverted_index":{"Abstract":[0],"Theory":[1],"of":[2,9,22,27,35,44,53],"stable":[3],"models":[4],"is":[5],"the":[6,20,23,41],"mathematical":[7],"basis":[8],"answer":[10],"set":[11],"programming.":[12],"Several":[13],"results":[14],"in":[15],"that":[16,36,40],"theory":[17],"refer":[18],"to":[19,50],"concept":[21,37],"positive":[24,45],"dependency":[25,46],"graph":[26],"a":[28,33],"logic":[29],"program.":[30],"We":[31],"describe":[32],"modification":[34],"and":[38],"show":[39],"new":[42],"understanding":[43],"makes":[47],"it":[48],"possible":[49],"strengthen":[51],"some":[52],"these":[54],"results.":[55]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}