{"id":"https://openalex.org/W4407811461","doi":"https://doi.org/10.3233/978-1-60750-061-2-265","title":"Secure and Optimal Base Contraction in Graded Łukasiewicz Logics","display_name":"Secure and Optimal Base Contraction in Graded Łukasiewicz Logics","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W4407811461","doi":"https://doi.org/10.3233/978-1-60750-061-2-265"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-60750-061-2-265","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-061-2-265","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","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/A5116363386","display_name":"Pardo Pere","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Pardo Pere","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5116363387","display_name":"Dellunde Pilar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dellunde Pilar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5116363388","display_name":"Godo Llu iacute s","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Godo Lluís","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5116363386"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.55244179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9000999927520752,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9000999927520752,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/contraction","display_name":"Contraction (grammar)","score":0.6613459587097168},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.5505958199501038},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38900601863861084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38546162843704224},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3316670358181},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.1733541488647461},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15006175637245178},{"id":"https://openalex.org/keywords/linguistics","display_name":"Linguistics","score":0.09841984510421753}],"concepts":[{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.6613459587097168},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.5505958199501038},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38900601863861084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38546162843704224},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3316670358181},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.1733541488647461},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15006175637245178},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.09841984510421753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/978-1-60750-061-2-265","is_oa":false,"landing_page_url":"https://doi.org/10.3233/978-1-60750-061-2-265","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W4391375266","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"The":[0],"operation":[1],"of":[2,13,18,52,77,80,82,102],"base":[3],"contraction":[4,92],"was":[5],"successfully":[6],"characterized":[7],"for":[8,30,49,74,116],"a":[9,50,95,108],"very":[10],"general":[11,24],"class":[12],"logics":[14],"using":[15],"the":[16,23,75,83],"notion":[17,27,47],"remainder":[19],"sets.":[20],"Nevertheless,":[21],"in":[22,56],"case,":[25],"this":[26,45,72],"is":[28,34,43],"inadequate":[29],"revision,":[31],"where":[32],"it":[33,58],"replaced":[35],"by":[36],"maximal":[37],"consistent":[38],"subsets.":[39],"A":[40],"natural":[41],"question":[42],"whether":[44],"latter":[46],"allows":[48],"definition":[51],"contraction-like":[53],"operators":[54,93],"and,":[55],"case":[57,76],"does,":[59],"what":[60],"differences":[61],"there":[62],"exist":[63],"w.r.t.":[64],"standard":[65],"contraction.":[66],"We":[67,90],"make":[68],"some":[69,114],"steps":[70],"towards":[71],"direction":[73],"graded":[78],"expansions":[79],"one":[81],"most":[84],"prominent":[85],"fuzzy":[86],"logics,":[87],"Łukasiewicz":[88],"logic.":[89],"characterize":[91],"with":[94],"fixed":[96],"security-threshold":[97],"ϵ>0;":[98],"we":[99],"prove":[100],"soundness":[101],"(an":[103],"optimal)":[104],"ω-contraction":[105],"operation,":[106],"and":[107],"collapse":[109],"theorem":[110],"from":[111],"ω-":[112],"to":[113],"ϵ-contraction":[115],"finite":[117],"theories.":[118]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}