{"id":"https://openalex.org/W3035858516","doi":"https://doi.org/10.1109/saci49304.2020.9118814","title":"Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema","display_name":"Deductive Synthesis of Min-Max-Sort Using Multisets in Theorema","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3035858516","doi":"https://doi.org/10.1109/saci49304.2020.9118814","mag":"3035858516"},"language":"en","primary_location":{"id":"doi:10.1109/saci49304.2020.9118814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci49304.2020.9118814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-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/A5001991801","display_name":"Isabela Dr\u0103mnesc","orcid":"https://orcid.org/0000-0003-4686-2864"},"institutions":[{"id":"https://openalex.org/I3121153395","display_name":"West University of Timi\u015foara","ror":"https://ror.org/0583a0t97","country_code":"RO","type":"education","lineage":["https://openalex.org/I3121153395"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Isabela Dramnesc","raw_affiliation_strings":["Department of Computer Science, West University, Timi\u015foara, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, West University, Timi\u015foara, Romania","institution_ids":["https://openalex.org/I3121153395"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021113261","display_name":"Tudor Jebelean","orcid":"https://orcid.org/0000-0002-2247-2151"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Tudor Jebelean","raw_affiliation_strings":["Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5416,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.732785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":null,"first_page":"000165","last_page":"000172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9961000084877014,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.69648677110672},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5964668989181519},{"id":"https://openalex.org/keywords/mathematical-induction","display_name":"Mathematical induction","score":0.5893212556838989},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.5535172820091248},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.5383293628692627},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.516811728477478},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.5058166980743408},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.4483267366886139},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44591712951660156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4232638478279114},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.36225637793540955},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2732256352901459},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2463771402835846},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.09688270092010498}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.69648677110672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5964668989181519},{"id":"https://openalex.org/C206743973","wikidata":"https://www.wikidata.org/wiki/Q178377","display_name":"Mathematical induction","level":2,"score":0.5893212556838989},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.5535172820091248},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.5383293628692627},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.516811728477478},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.5058166980743408},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4483267366886139},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44591712951660156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4232638478279114},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.36225637793540955},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2732256352901459},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2463771402835846},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.09688270092010498},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/saci49304.2020.9118814","is_oa":false,"landing_page_url":"https://doi.org/10.1109/saci49304.2020.9118814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 14th International Symposium on Applied Computational Intelligence and Informatics (SACI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W64540772","https://openalex.org/W141983600","https://openalex.org/W1519651380","https://openalex.org/W1848963184","https://openalex.org/W1981034844","https://openalex.org/W1988598795","https://openalex.org/W1992696924","https://openalex.org/W2012436850","https://openalex.org/W2013373314","https://openalex.org/W2023299380","https://openalex.org/W2038862832","https://openalex.org/W2042550236","https://openalex.org/W2089340995","https://openalex.org/W2101432564","https://openalex.org/W2113352466","https://openalex.org/W2113996446","https://openalex.org/W2115190288","https://openalex.org/W2182989621","https://openalex.org/W2254208305","https://openalex.org/W2805273157","https://openalex.org/W2971618036","https://openalex.org/W3034065188","https://openalex.org/W3105181945","https://openalex.org/W3162885617","https://openalex.org/W4240339708","https://openalex.org/W4289046583","https://openalex.org/W6605840097","https://openalex.org/W6631331401","https://openalex.org/W6691590370","https://openalex.org/W6761714954"],"related_works":["https://openalex.org/W4372046861","https://openalex.org/W4241520140","https://openalex.org/W2908348257","https://openalex.org/W4392178020","https://openalex.org/W2994182992","https://openalex.org/W2944673558","https://openalex.org/W2350549588","https://openalex.org/W2085265870","https://openalex.org/W2362374543","https://openalex.org/W3206496585"],"abstract_inverted_index":{"We":[0,86],"demonstrate":[1],"the":[2,6,12,15,20,24,42,48,60,69,72,75,81,84,103,108,114,122,156,168,171,179,182,204,207,212,224],"deductive":[3],"synthesis":[4,37,123,199],"of":[5,14,23,64,74,83,124,158,181,206,214],"Min-Max-Sort":[7],"algorithm":[8,43,62,192],"using":[9,153],"multisets":[10,154],"in":[11,99,131,146,196,203,218],"frame":[13,205],"Theorema":[16,208],"system.":[17],"Starting":[18],"from":[19,39],"logical":[21,94],"specification":[22],"sorting":[25],"function":[26],"(input":[27],"and":[28,55,71,77,127,155,221],"output":[29],"conditions),":[30],"we":[31,50],"show":[32,88],"how":[33,89],"to":[34,90,101],"construct":[35],"a":[36,93,96,132,150],"conjecture,":[38],"whose":[40],"proof":[41,49,116,142,180],"can":[44],"be":[45],"constructed.":[46],"For":[47],"choose":[51],"those":[52],"inference":[53],"methods":[54],"induction":[56,173,184,189],"principles":[57],"such":[58],"that":[59,170],"synthesized":[61,225],"consists":[63],"selecting":[65],"at":[66,80],"each":[67],"step":[68],"minimum":[70],"maximum":[73],"list,":[76],"moving":[78],"them":[79],"ends":[82],"list.":[85],"also":[87],"add,":[91],"on":[92],"basis,":[95],"specific":[97],"flag":[98],"order":[100],"stop":[102],"recursion":[104],"as":[105,107],"soon":[106],"list":[109],"is":[110,194,201],"already":[111],"sorted.":[112],"During":[113],"main":[115],"new":[117],"conjectures":[118],"are":[119,139,145,175],"produced":[120],"for":[121,161],"auxiliary":[125],"algorithms,":[126],"this":[128],"process":[129],"repeats":[130],"cascading":[133],"fashion":[134],"until":[135],"all":[136],"necessary":[137],"algorithms":[138],"produced.":[140],"Our":[141],"techniques,":[143],"which":[144,210],"natural":[147,219],"style,":[148,220],"include":[149],"novel":[151],"approach":[152],"use":[157],"cover":[159],"sets":[160],"realizing":[162],"Noetherian":[163],"induction.":[164],"The":[165,198],"later":[166],"has":[167],"advantage":[169],"concrete":[172,188],"hypotheses":[174],"created":[176],"dynamically":[177],"during":[178],"corresponding":[183],"conclusion,":[185],"thus":[186],"no":[187],"principle":[190],"or":[191],"scheme":[193],"needed":[195],"advance.":[197],"mechanism":[200],"implemented":[202],"system":[209],"allows":[211],"construction":[213],"mathematical":[215],"theories,":[216],"proving":[217],"computing":[222],"with":[223],"algorithms.":[226]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}