{"id":"https://openalex.org/W2061409643","doi":"https://doi.org/10.1017/s1471068412000269","title":"Module theorem for the general theory of stable models","display_name":"Module theorem for the general theory of stable models","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2061409643","doi":"https://doi.org/10.1017/s1471068412000269","mag":"2061409643"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068412000269","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000269","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1210.5222","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"JOSEPH BABB","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]},{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"JOSEPH BABB","raw_affiliation_strings":["School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA (e-mail:","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":null,"display_name":"JOOHYUNG LEE","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]},{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"JOOHYUNG LEE","raw_affiliation_strings":["School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA (e-mail:"],"affiliations":[{"raw_affiliation_string":"School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, Tempe, AZ, USA (e-mail:","institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210143601","https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.4459,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73013612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"4-5","first_page":"719","last_page":"735"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9907000064849854,"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.9907000064849854,"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.0015999999595806003,"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.001500000013038516,"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/principle-of-compositionality","display_name":"Principle of compositionality","score":0.6984000205993652},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6480000019073486},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5439000129699707},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5295000076293945},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.527899980545044},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5206999778747559},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5162000060081482},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.4756999909877777},{"id":"https://openalex.org/keywords/set-theory","display_name":"Set theory","score":0.42590001225471497}],"concepts":[{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.6984000205993652},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6480000019073486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5547000169754028},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5439000129699707},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5295000076293945},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.527899980545044},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5206999778747559},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5162000060081482},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.4756999909877777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4327999949455261},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.42590001225471497},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.4180999994277954},{"id":"https://openalex.org/C171636804","wikidata":"https://www.wikidata.org/wiki/Q1149458","display_name":"Compactness theorem","level":4,"score":0.4052000045776367},{"id":"https://openalex.org/C194886279","wikidata":"https://www.wikidata.org/wiki/Q430271","display_name":"Fundamental theorem","level":3,"score":0.38029998540878296},{"id":"https://openalex.org/C47030870","wikidata":"https://www.wikidata.org/wiki/Q467606","display_name":"Model theory","level":2,"score":0.3635999858379364},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.34869998693466187},{"id":"https://openalex.org/C2776230367","wikidata":"https://www.wikidata.org/wiki/Q7314222","display_name":"Representation theorem","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33320000767707825},{"id":"https://openalex.org/C102565666","wikidata":"https://www.wikidata.org/wiki/Q1378301","display_name":"Universal set","level":3,"score":0.30730000138282776},{"id":"https://openalex.org/C113843644","wikidata":"https://www.wikidata.org/wiki/Q901882","display_name":"Interface (matter)","level":4,"score":0.30630001425743103},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3041999936103821},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.2732999920845032},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C2780432614","wikidata":"https://www.wikidata.org/wiki/Q864213","display_name":"Conservative extension","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C48540410","wikidata":"https://www.wikidata.org/wiki/Q5221089","display_name":"Danskin's theorem","level":4,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068412000269","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000269","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"},{"id":"pmh:oai:arXiv.org:1210.5222","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.5222","pdf_url":"https://arxiv.org/pdf/1210.5222","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1210.5222","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.5222","pdf_url":"https://arxiv.org/pdf/1210.5222","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1634869392","https://openalex.org/W1772789695","https://openalex.org/W2115872603","https://openalex.org/W2134039900","https://openalex.org/W6763467701"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"The":[1,39,79],"module":[2,22,65,110],"theorem":[3,40,66,111,116],"by":[4,74,117],"Janhunen":[5],"et":[6,76,119],"al":[7,77,120],".":[8,78,121],"demonstrates":[9],"how":[10],"to":[11,32,67,82,112,137],"provide":[12],"a":[13,24,52,138],"modular":[14],"structure":[15],"in":[16,43,89],"answer":[17,37,47,59,90,134],"set":[18,48,60,91,135],"programming,":[19,92],"where":[20],"each":[21],"has":[23],"well-defined":[25],"input/output":[26],"interface":[27],"which":[28],"can":[29],"be":[30],"used":[31],"establish":[33],"the":[34,44,64,68,97,109,113,130],"compositionality":[35],"of":[36,46,54,71,132,142],"sets.":[38],"is":[41,51,105],"useful":[42,87],"analysis":[45],"programs,":[49],"and":[50,57,100,128],"basis":[53],"incremental":[55,133],"grounding":[56],"reactive":[58],"programming.":[61],"We":[62],"extend":[63,129],"general":[69,140],"theory":[70,131],"stable":[72],"models":[73],"Ferraris":[75,118],"generalization":[80],"applies":[81],"non-ground":[83],"logic":[84],"programs":[85],"allowing":[86],"constructs":[88],"such":[93],"as":[94],"choice":[95],"rules,":[96],"count":[98],"aggregate,":[99],"nested":[101],"expressions.":[102],"Our":[103],"extension":[104],"based":[106],"on":[107,123],"relating":[108],"symmetric":[114],"splitting":[115],"Based":[122],"this":[124],"result,":[125],"we":[126],"reformulate":[127],"computation":[136],"more":[139],"class":[141],"programs.":[143]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}