{"id":"https://openalex.org/W2488315955","doi":"https://doi.org/10.1017/s1471068416000430","title":"First-order modular logic programs and their conservative extensions","display_name":"First-order modular logic programs and their conservative extensions","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2488315955","doi":"https://doi.org/10.1017/s1471068416000430","mag":"2488315955"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068416000430","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000430","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":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074195056","display_name":"Amelia Harrison","orcid":null},"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":"AMELIA HARRISON","raw_affiliation_strings":["University of Texas at Austin (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Texas at Austin (e-mail:","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008816972","display_name":"Yuliya Lierler","orcid":"https://orcid.org/0000-0002-6146-623X"},"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":false,"raw_author_name":"YULIYA LIERLER","raw_affiliation_strings":["University of Nebraska Omaha (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Nebraska Omaha (e-mail:","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2993,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86910051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"16","issue":"5-6","first_page":"755","last_page":"770"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"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.9998000264167786,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9952999949455261,"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.9932000041007996,"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.8281933665275574},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.8236292600631714},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.660126805305481},{"id":"https://openalex.org/keywords/conservative-extension","display_name":"Conservative extension","score":0.6572220325469971},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5854356288909912},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5296611189842224},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5067048668861389},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4954489469528198},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.43435490131378174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20253607630729675}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8281933665275574},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.8236292600631714},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.660126805305481},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.6572220325469971},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5854356288909912},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5296611189842224},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5067048668861389},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4954489469528198},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.43435490131378174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20253607630729675},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068416000430","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000430","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1526528721","https://openalex.org/W1527039196","https://openalex.org/W1800801472","https://openalex.org/W1985274317","https://openalex.org/W2006279573","https://openalex.org/W2087563242","https://openalex.org/W2092211394","https://openalex.org/W2105016364","https://openalex.org/W2126102461","https://openalex.org/W2134039900","https://openalex.org/W2215047634","https://openalex.org/W2249048248"],"related_works":["https://openalex.org/W2157334321","https://openalex.org/W1836559177","https://openalex.org/W2898556184","https://openalex.org/W2351847247","https://openalex.org/W2728496526","https://openalex.org/W1529567299","https://openalex.org/W1973544374","https://openalex.org/W2178785057","https://openalex.org/W1837266337","https://openalex.org/W2964338094"],"abstract_inverted_index":{"Abstract":[0],"Modular":[1],"logic":[2,9,23],"programs":[3,10,52],"provide":[4],"a":[5,65],"way":[6],"of":[7,13,30,40,64],"viewing":[8],"as":[11,53,55],"consisting":[12],"many":[14,31],"independent,":[15],"meaningful":[16],"modules.":[17],"This":[18,43],"paper":[19],"introduces":[20],"first-order":[21],"modular":[22,51],"programs,":[24],"which":[25],"can":[26,68],"capture":[27],"the":[28,62,73],"meaning":[29],"answer":[32],"set":[33],"programs.":[34,42,58],"We":[35,59],"also":[36],"introduce":[37],"conservative":[38,66],"extensions":[39],"such":[41],"concept":[44],"helps":[45],"to":[46,71],"identify":[47],"strong":[48],"relationships":[49],"between":[50,56],"well":[54],"traditional":[57],"show":[60],"how":[61],"notion":[63],"extension":[67],"be":[69],"used":[70],"justify":[72],"common":[74],"projection":[75],"rewriting.":[76]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}