{"id":"https://openalex.org/W1972499235","doi":"https://doi.org/10.1017/s1471068408003578","title":"Extended ASP Tableaux and rule redundancy in normal logic programs","display_name":"Extended ASP Tableaux and rule redundancy in normal logic programs","publication_year":2008,"publication_date":"2008-10-17","ids":{"openalex":"https://openalex.org/W1972499235","doi":"https://doi.org/10.1017/s1471068408003578","mag":"1972499235"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068408003578","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068408003578","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/0809.3204","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MATTI J\u00c4RVISALO","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109212","display_name":"National Defence University","ror":"https://ror.org/01js4x705","country_code":"FI","type":"education","lineage":["https://openalex.org/I4210109212"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"MATTI J\u00c4RVISALO","raw_affiliation_strings":["Helsinki University of Technology (TKK), Department of Information and Computer Science, P.O. Box 5400, FI-02015 TKK, Finland (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki University of Technology (TKK), Department of Information and Computer Science, P.O. Box 5400, FI-02015 TKK, Finland (e-mail:","institution_ids":["https://openalex.org/I4210109212"]}]},{"author_position":"last","author":{"id":null,"display_name":"EMILIA OIKARINEN","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109212","display_name":"National Defence University","ror":"https://ror.org/01js4x705","country_code":"FI","type":"education","lineage":["https://openalex.org/I4210109212"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"EMILIA OIKARINEN","raw_affiliation_strings":["Helsinki University of Technology (TKK), Department of Information and Computer Science, P.O. Box 5400, FI-02015 TKK, Finland (e-mail:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Helsinki University of Technology (TKK), Department of Information and Computer Science, P.O. Box 5400, FI-02015 TKK, Finland (e-mail:","institution_ids":["https://openalex.org/I4210109212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210109212"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.06524465,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"5-6","first_page":"691","last_page":"716"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9933000206947327,"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.9933000206947327,"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.00139999995008111,"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.0010000000474974513,"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/mathematical-proof","display_name":"Mathematical proof","score":0.78329998254776},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.6553000211715698},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.5896999835968018},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4943000078201294},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.450300008058548},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.4472000002861023},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4050000011920929},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.36809998750686646}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.78329998254776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.717199981212616},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.6553000211715698},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.5896999835968018},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4943000078201294},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46059998869895935},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.450300008058548},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.4472000002861023},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4050000011920929},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39010000228881836},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.36809998750686646},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.35030001401901245},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3465999960899353},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.33959999680519104},{"id":"https://openalex.org/C199879729","wikidata":"https://www.wikidata.org/wiki/Q205140","display_name":"Infinite set","level":3,"score":0.32030001282691956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3068000078201294},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.3001999855041504},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C47884741","wikidata":"https://www.wikidata.org/wiki/Q1166618","display_name":"Mathematical logic","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.26969999074935913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2676999866962433},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2635999917984009},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.262800008058548},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25290000438690186},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068408003578","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068408003578","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:0809.3204","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0809.3204","pdf_url":"https://arxiv.org/pdf/0809.3204","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:CiteSeerX.psu:10.1.1.79.8159","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.79.8159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.hut.fi/~eoikarin/papers/jarvisalo-oikarinen.iclp07.ps","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0809.3204","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0809.3204","pdf_url":"https://arxiv.org/pdf/0809.3204","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W127232014","https://openalex.org/W1498722751","https://openalex.org/W1533970988","https://openalex.org/W1606891084","https://openalex.org/W1639901403","https://openalex.org/W1706499668","https://openalex.org/W1766332311","https://openalex.org/W1976055110","https://openalex.org/W1988083342","https://openalex.org/W1997158981","https://openalex.org/W1997780525","https://openalex.org/W2004414305","https://openalex.org/W2011124182","https://openalex.org/W2023141722","https://openalex.org/W2043673291","https://openalex.org/W2050842068","https://openalex.org/W2057361103","https://openalex.org/W2062897452","https://openalex.org/W2069767473","https://openalex.org/W2079430756","https://openalex.org/W2092211394","https://openalex.org/W2092984557","https://openalex.org/W2097576831","https://openalex.org/W2100699693","https://openalex.org/W2115895293","https://openalex.org/W2152131859","https://openalex.org/W2171790376","https://openalex.org/W2177693862","https://openalex.org/W6634145069","https://openalex.org/W6712688321"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,68,80],"introduce":[2],"an":[3,64],"extended":[4],"tableau":[5],"calculus":[6],"for":[7,31,97,114,124],"answer":[8,32],"set":[9,33],"programming":[10],"(ASP).":[11],"The":[12],"proof":[13,92,113],"system":[14,93],"is":[15],"based":[16],"on":[17,42,150,171],"the":[18,23,38,70,82,89,145,151,166,172],"ASP":[19,74,86,104,107,126,139,161,175],"tableaux":[20],"defined":[21,94],"in":[22,56,155],"work":[24],"by":[25,95,109],"Gebser":[26],"and":[27,50,78,101],"Schaub":[28],"(Tableau":[29],"calculi":[30],"programming.":[34],"In":[35],"Proceedings":[36],"of":[37,72,84,99,117,147,153,168,174],"22nd":[39],"International":[40],"Conference":[41],"Logic":[43],"Programming":[44],"(ICLP":[45],"2006)":[46],",":[47],"S.":[48],"Etalle":[49],"M.":[51],"Truszczynski,":[52],"Eds.":[53],"Lecture":[54],"Notes":[55],"Computer":[57],"Science,":[58],"vol.":[59],"4079.":[60],"Springer,":[61],"11\u201325)":[62],"with":[63,88,132],"added":[65],"extension":[66],"rule.":[67],"investigate":[69,165],"power":[71],"Extended":[73,85,90,103,138,160],"Tableaux":[75,87,105,108,127,140],"both":[76],"theoretically":[77],"empirically.":[79],"study":[81],"relationship":[83],"Resolution":[91],"Tseitin":[96],"sets":[98],"clauses,":[100],"separate":[102],"from":[106],"giving":[110],"a":[111,115],"polynomial-length":[112],"family":[116],"normal":[118],"logic":[119],"programs":[120],"{\u03a6":[121],"n":[122,135],"}":[123],"which":[125],"has":[128],"exponential-length":[129],"minimal":[130],"proofs":[131,154],"respect":[133],"to":[134,159],".":[136],"Additionally,":[137],"imply":[141],"interesting":[142],"insight":[143],"into":[144],"effect":[146,167],"program":[148],"simplification":[149],"lengths":[152],"ASP.":[156],"Closely":[157],"related":[158],"Tableaux,":[162],"we":[163],"empirically":[164],"redundant":[169],"rules":[170],"efficiency":[173],"solving.":[176]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}