{"id":"https://openalex.org/W1850367199","doi":"https://doi.org/10.1017/s1471068415000162","title":"Knowledge compilation of logic programs using approximation fixpoint theory","display_name":"Knowledge compilation of logic programs using approximation fixpoint theory","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W1850367199","doi":"https://doi.org/10.1017/s1471068415000162","mag":"1850367199"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000162","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000162","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://lirias.kuleuven.be/handle/123456789/502798","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"BART BOGAERTS","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"BART BOGAERTS","raw_affiliation_strings":["Department of Computer Science, KU Leuven, Belgium (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":null,"display_name":"GUY VAN DEN BROECK","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"GUY VAN DEN BROECK","raw_affiliation_strings":["Department of Computer Science, KU Leuven, Belgium (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4452,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76232158,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"15","issue":"4-5","first_page":"464","last_page":"480"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.7997000217437744,"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.7997000217437744,"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.1695999950170517,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.008299999870359898,"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/constructive","display_name":"Constructive","score":0.6561999917030334},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.6087999939918518},{"id":"https://openalex.org/keywords/propositional-calculus","display_name":"Propositional calculus","score":0.5938000082969666},{"id":"https://openalex.org/keywords/default-logic","display_name":"Default logic","score":0.5752999782562256},{"id":"https://openalex.org/keywords/autoepistemic-logic","display_name":"Autoepistemic logic","score":0.5582000017166138},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5460000038146973},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.538100004196167},{"id":"https://openalex.org/keywords/modal-\u03bc-calculus","display_name":"Modal \u03bc-calculus","score":0.46860000491142273},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.3894999921321869}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7696999907493591},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.6561999917030334},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.6087999939918518},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.5938000082969666},{"id":"https://openalex.org/C160236029","wikidata":"https://www.wikidata.org/wiki/Q842421","display_name":"Default logic","level":5,"score":0.5752999782562256},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.5582000017166138},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.538100004196167},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4830000102519989},{"id":"https://openalex.org/C173125200","wikidata":"https://www.wikidata.org/wiki/Q5275729","display_name":"Modal \u03bc-calculus","level":5,"score":0.46860000491142273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45089998841285706},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.3894999921321869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37540000677108765},{"id":"https://openalex.org/C58041814","wikidata":"https://www.wikidata.org/wiki/Q792533","display_name":"Axiomatic semantics","level":5,"score":0.35429999232292175},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.32829999923706055},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3151000142097473},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.30730000138282776},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C14523651","wikidata":"https://www.wikidata.org/wiki/Q3492863","display_name":"Propositional variable","level":4,"score":0.28040000796318054},{"id":"https://openalex.org/C13184196","wikidata":"https://www.wikidata.org/wiki/Q9453","display_name":"Dialectic","level":2,"score":0.2768999934196472},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.271699994802475},{"id":"https://openalex.org/C74640108","wikidata":"https://www.wikidata.org/wiki/Q1372900","display_name":"Propositional formula","level":5,"score":0.266400009393692},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C191222856","wikidata":"https://www.wikidata.org/wiki/Q655328","display_name":"Well-formed formula","level":5,"score":0.2538999915122986},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068415000162","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000162","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:lirias2repo.kuleuven.be:123456789/502798","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/502798","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 15 (4), (464-480)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1507.06554","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06554","pdf_url":"https://arxiv.org/pdf/1507.06554","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:lirias2repo.kuleuven.be:123456789/502798","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/502798","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 15 (4), (464-480)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W36707155","https://openalex.org/W202248608","https://openalex.org/W1494051470","https://openalex.org/W1533371796","https://openalex.org/W1545697174","https://openalex.org/W1565496223","https://openalex.org/W1567452831","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1949847137","https://openalex.org/W1968513265","https://openalex.org/W2014272228","https://openalex.org/W2023141722","https://openalex.org/W2036869460","https://openalex.org/W2038897673","https://openalex.org/W2042690606","https://openalex.org/W2050842068","https://openalex.org/W2062818807","https://openalex.org/W2079430756","https://openalex.org/W2080267935","https://openalex.org/W2099792091","https://openalex.org/W2105197197","https://openalex.org/W2108911687","https://openalex.org/W2121869744","https://openalex.org/W2145648043","https://openalex.org/W2184463008","https://openalex.org/W2249048248","https://openalex.org/W2256752531","https://openalex.org/W2402839980","https://openalex.org/W4211035117","https://openalex.org/W6635326540","https://openalex.org/W6651418978","https://openalex.org/W6656226397","https://openalex.org/W6682828956","https://openalex.org/W6785734557"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Recent":[1],"advances":[2],"in":[3,84],"knowledge":[4],"compilation":[5],"introduced":[6],"techniques":[7],"to":[8,60,69,72,105],"compile":[9],"positive":[10],"logic":[11,74,109],"programs":[12,75],"into":[13],"propositional":[14],"logic,":[15,107],"essentially":[16],"exploiting":[17],"the":[18,22,45,77],"constructive":[19],"nature":[20],"of":[21,47,94],"least":[23],"fixpoint":[24,86],"computation.":[25],"This":[26],"approach":[27],"has":[28],"several":[29],"advantages":[30],"over":[31],"existing":[32,53],"approaches:":[33],"it":[34,71],"maintains":[35],"logical":[36],"equivalence,":[37],"does":[38],"not":[39],"require":[40],"(expensive)":[41],"loop-breaking":[42],"preprocessing":[43],"or":[44],"introduction":[46],"auxiliary":[48],"variables,":[49],"and":[50,110],"significantly":[51],"outperforms":[52],"algorithms.":[54],"Unfortunately,":[55],"this":[56,64],"technique":[57],"is":[58],"limited":[59],"negation-free":[61],"programs.":[62],"In":[63],"paper,":[65],"we":[66],"show":[67],"how":[68],"extend":[70],"general":[73],"under":[76],"well-founded":[78],"semantics.":[79],"We":[80],"develop":[81],"our":[82,99],"work":[83],"approximation":[85],"theory,":[87],"an":[88],"algebraical":[89,100],"framework":[90],"that":[91],"unifies":[92],"semantics":[93],"different":[95],"logics.":[96],"As":[97],"such,":[98],"results":[101],"are":[102],"also":[103],"applicable":[104],"autoepistemic":[106],"default":[108],"abstract":[111],"dialectical":[112],"frameworks.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}