Metaheuristic Algorithms for Proof Searching in HOL4 Article Swipe
YOU?
·
· 2022
· Open Access
·
· DOI: https://doi.org/10.18293/seke2022-103
User guided proof development in interactive theorem proving is a manual and time consuming activity.For automating proof searching and optimization in a higher-order logic proof assistant, we provide two metaheuristic algorithms that are based on Fitness Dependent Optimizer (FDO) and Bat Algorithm (BA).In both metaheuristic algorithms, random proof sequences are first created from a population of frequently occurring proof steps that are discovered using pattern mining techniques.Created proof sequences are then evolved till their fitness matches the fitness of the original (or target) proof sequences.Experiments are performed to investigate the performance of the proposed algorithms on different HOL4 theories.Moreover, the proposed FDO and BA-based proof searching approaches are compared with Simulated Annealing (SA) and Genetic Algorithm (GA)based methods.Results show that BA performs best, followed by FDO and SA for proof finding and optimization in HOL4.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- http://doi.org/10.18293/seke2022-103
- https://doi.org/10.18293/seke2022-103
- OA Status
- bronze
- References
- 25
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4294659115
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4294659115Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.18293/seke2022-103Digital Object Identifier
- Title
-
Metaheuristic Algorithms for Proof Searching in HOL4Work title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2022Year of publication
- Publication date
-
2022-07-01Full publication date if available
- Authors
-
M. Saqib Nawaz, Muhammad Zohaib Nawaz, Osman Hasan, Philippe Fournier‐VigerList of authors in order
- Landing page
-
https://doi.org/10.18293/seke2022-103Publisher landing page
- PDF URL
-
https://doi.org/10.18293/seke2022-103Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
bronzeOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.18293/seke2022-103Direct OA link when available
- Concepts
-
Proof of concept, Metaheuristic, Computer science, Simulated annealing, Algorithm, Automated theorem proving, Proof theory, Genetic algorithm, Theoretical computer science, Mathematics, Mathematical proof, Machine learning, Operating system, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
- References (count)
-
25Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4294659115 |
|---|---|
| doi | https://doi.org/10.18293/seke2022-103 |
| ids.doi | https://doi.org/10.18293/seke2022-103 |
| ids.openalex | https://openalex.org/W4294659115 |
| fwci | 0.0 |
| type | article |
| title | Metaheuristic Algorithms for Proof Searching in HOL4 |
| biblio.issue | |
| biblio.volume | 2022 |
| biblio.last_page | 381 |
| biblio.first_page | 376 |
| topics[0].id | https://openalex.org/T10126 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9962000250816345 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Logic, programming, and type systems |
| topics[1].id | https://openalex.org/T10260 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9764000177383423 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1710 |
| topics[1].subfield.display_name | Information Systems |
| topics[1].display_name | Software Engineering Research |
| topics[2].id | https://openalex.org/T11574 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.965499997138977 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Artificial Intelligence in Games |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C124978682 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7151926755905151 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q1201019 |
| concepts[0].display_name | Proof of concept |
| concepts[1].id | https://openalex.org/C109718341 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6819106936454773 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1385229 |
| concepts[1].display_name | Metaheuristic |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.6106033325195312 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C126980161 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6014840602874756 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q863783 |
| concepts[3].display_name | Simulated annealing |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5660206079483032 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C206880738 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5197274684906006 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q431667 |
| concepts[5].display_name | Automated theorem proving |
| concepts[6].id | https://openalex.org/C2318724 |
| concepts[6].level | 3 |
| concepts[6].score | 0.506524920463562 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q852732 |
| concepts[6].display_name | Proof theory |
| concepts[7].id | https://openalex.org/C8880873 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4619441628456116 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q187787 |
| concepts[7].display_name | Genetic algorithm |
| concepts[8].id | https://openalex.org/C80444323 |
| concepts[8].level | 1 |
| concepts[8].score | 0.351391077041626 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[8].display_name | Theoretical computer science |
| concepts[9].id | https://openalex.org/C33923547 |
| concepts[9].level | 0 |
| concepts[9].score | 0.28207260370254517 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[9].display_name | Mathematics |
| concepts[10].id | https://openalex.org/C108710211 |
| concepts[10].level | 2 |
| concepts[10].score | 0.2007562518119812 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q11538 |
| concepts[10].display_name | Mathematical proof |
| concepts[11].id | https://openalex.org/C119857082 |
| concepts[11].level | 1 |
| concepts[11].score | 0.16864433884620667 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2539 |
| concepts[11].display_name | Machine learning |
| concepts[12].id | https://openalex.org/C111919701 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[12].display_name | Operating system |
| concepts[13].id | https://openalex.org/C2524010 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[13].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/proof-of-concept |
| keywords[0].score | 0.7151926755905151 |
| keywords[0].display_name | Proof of concept |
| keywords[1].id | https://openalex.org/keywords/metaheuristic |
| keywords[1].score | 0.6819106936454773 |
| keywords[1].display_name | Metaheuristic |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.6106033325195312 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/simulated-annealing |
| keywords[3].score | 0.6014840602874756 |
| keywords[3].display_name | Simulated annealing |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.5660206079483032 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/automated-theorem-proving |
| keywords[5].score | 0.5197274684906006 |
| keywords[5].display_name | Automated theorem proving |
| keywords[6].id | https://openalex.org/keywords/proof-theory |
| keywords[6].score | 0.506524920463562 |
| keywords[6].display_name | Proof theory |
| keywords[7].id | https://openalex.org/keywords/genetic-algorithm |
| keywords[7].score | 0.4619441628456116 |
| keywords[7].display_name | Genetic algorithm |
| keywords[8].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[8].score | 0.351391077041626 |
| keywords[8].display_name | Theoretical computer science |
| keywords[9].id | https://openalex.org/keywords/mathematics |
| keywords[9].score | 0.28207260370254517 |
| keywords[9].display_name | Mathematics |
| keywords[10].id | https://openalex.org/keywords/mathematical-proof |
| keywords[10].score | 0.2007562518119812 |
| keywords[10].display_name | Mathematical proof |
| keywords[11].id | https://openalex.org/keywords/machine-learning |
| keywords[11].score | 0.16864433884620667 |
| keywords[11].display_name | Machine learning |
| language | en |
| locations[0].id | doi:10.18293/seke2022-103 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4220650826 |
| locations[0].source.issn | 2325-9000, 2325-9086 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 2325-9000 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | https://doi.org/10.18293/seke2022-103 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | proceedings-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | International Conferences on Software Engineering and Knowledge Engineering |
| locations[0].landing_page_url | http://doi.org/10.18293/seke2022-103 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5025418453 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-9856-2885 |
| authorships[0].author.display_name | M. Saqib Nawaz |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I180726961 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Computer Science and Software Engineering, Shenzhen University, China |
| authorships[0].institutions[0].id | https://openalex.org/I180726961 |
| authorships[0].institutions[0].ror | https://ror.org/01vy4gh70 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I180726961 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Shenzhen University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Saqib Nawaz |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | School of Computer Science and Software Engineering, Shenzhen University, China |
| authorships[1].author.id | https://openalex.org/A5103942608 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Muhammad Zohaib Nawaz |
| authorships[1].countries | PK |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I160968435 |
| authorships[1].affiliations[0].raw_affiliation_string | Department of Computer Science and IT, University of Sargodha, Sargodha, Pakistan |
| authorships[1].institutions[0].id | https://openalex.org/I160968435 |
| authorships[1].institutions[0].ror | https://ror.org/0086rpr26 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I160968435 |
| authorships[1].institutions[0].country_code | PK |
| authorships[1].institutions[0].display_name | University of Sargodha |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Muhammad Zohaib Nawaz |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Department of Computer Science and IT, University of Sargodha, Sargodha, Pakistan |
| authorships[2].author.id | https://openalex.org/A5066768973 |
| authorships[2].author.orcid | https://orcid.org/0000-0003-2562-2669 |
| authorships[2].author.display_name | Osman Hasan |
| authorships[2].countries | PK |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I929597975 |
| authorships[2].affiliations[0].raw_affiliation_string | School of Electrical Engineering and Computer Science, National University of Sciences and Technology (NUST), Islamabad, Pakistan |
| authorships[2].institutions[0].id | https://openalex.org/I929597975 |
| authorships[2].institutions[0].ror | https://ror.org/03w2j5y17 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I929597975 |
| authorships[2].institutions[0].country_code | PK |
| authorships[2].institutions[0].display_name | National University of Sciences and Technology |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Osman Hasan |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | School of Electrical Engineering and Computer Science, National University of Sciences and Technology (NUST), Islamabad, Pakistan |
| authorships[3].author.id | https://openalex.org/A5038682039 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-7680-9899 |
| authorships[3].author.display_name | Philippe Fournier‐Viger |
| authorships[3].countries | CN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I180726961 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Computer Science and Software Engineering, Shenzhen University, China |
| authorships[3].institutions[0].id | https://openalex.org/I180726961 |
| authorships[3].institutions[0].ror | https://ror.org/01vy4gh70 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I180726961 |
| authorships[3].institutions[0].country_code | CN |
| authorships[3].institutions[0].display_name | Shenzhen University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Philippe Fournier-Viger |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Computer Science and Software Engineering, Shenzhen University, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.18293/seke2022-103 |
| open_access.oa_status | bronze |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Metaheuristic Algorithms for Proof Searching in HOL4 |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10126 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9962000250816345 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Logic, programming, and type systems |
| related_works | https://openalex.org/W1939200287, https://openalex.org/W2082305040, https://openalex.org/W4381955380, https://openalex.org/W150166259, https://openalex.org/W4312475206, https://openalex.org/W4387322292, https://openalex.org/W4295538670, https://openalex.org/W1499822848, https://openalex.org/W2105747912, https://openalex.org/W2522499048 |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.18293/seke2022-103 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4220650826 |
| best_oa_location.source.issn | 2325-9000, 2325-9086 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 2325-9000 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://doi.org/10.18293/seke2022-103 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | proceedings-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | International Conferences on Software Engineering and Knowledge Engineering |
| best_oa_location.landing_page_url | http://doi.org/10.18293/seke2022-103 |
| primary_location.id | doi:10.18293/seke2022-103 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4220650826 |
| primary_location.source.issn | 2325-9000, 2325-9086 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 2325-9000 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Proceedings/Proceedings of the ... International Conference on Software Engineering and Knowledge Engineering |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | https://doi.org/10.18293/seke2022-103 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | proceedings-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | International Conferences on Software Engineering and Knowledge Engineering |
| primary_location.landing_page_url | http://doi.org/10.18293/seke2022-103 |
| publication_date | 2022-07-01 |
| publication_year | 2022 |
| referenced_works | https://openalex.org/W2933860896, https://openalex.org/W2801537935, https://openalex.org/W1533817411, https://openalex.org/W2731252258, https://openalex.org/W1576818901, https://openalex.org/W2938239299, https://openalex.org/W2414667537, https://openalex.org/W6770919378, https://openalex.org/W3131858178, https://openalex.org/W3091216184, https://openalex.org/W6768262080, https://openalex.org/W6775759412, https://openalex.org/W6676123022, https://openalex.org/W2276072209, https://openalex.org/W2101812529, https://openalex.org/W4238811042, https://openalex.org/W2962820807, https://openalex.org/W2360114527, https://openalex.org/W2991871724, https://openalex.org/W2963742580, https://openalex.org/W3014929039, https://openalex.org/W2963999609, https://openalex.org/W2297383263, https://openalex.org/W2106192381, https://openalex.org/W2974285614 |
| referenced_works_count | 25 |
| abstract_inverted_index.a | 9, 21, 53 |
| abstract_inverted_index.BA | 120 |
| abstract_inverted_index.SA | 127 |
| abstract_inverted_index.by | 124 |
| abstract_inverted_index.in | 4, 20, 133 |
| abstract_inverted_index.is | 8 |
| abstract_inverted_index.of | 55, 78, 91 |
| abstract_inverted_index.on | 34, 95 |
| abstract_inverted_index.to | 87 |
| abstract_inverted_index.we | 26 |
| abstract_inverted_index.(or | 81 |
| abstract_inverted_index.Bat | 40 |
| abstract_inverted_index.FDO | 101, 125 |
| abstract_inverted_index.and | 11, 18, 39, 102, 113, 126, 131 |
| abstract_inverted_index.are | 32, 49, 61, 69, 85, 107 |
| abstract_inverted_index.for | 128 |
| abstract_inverted_index.the | 76, 79, 89, 92, 99 |
| abstract_inverted_index.two | 28 |
| abstract_inverted_index.(SA) | 112 |
| abstract_inverted_index.HOL4 | 97 |
| abstract_inverted_index.User | 0 |
| abstract_inverted_index.both | 43 |
| abstract_inverted_index.from | 52 |
| abstract_inverted_index.show | 118 |
| abstract_inverted_index.that | 31, 60, 119 |
| abstract_inverted_index.then | 70 |
| abstract_inverted_index.till | 72 |
| abstract_inverted_index.time | 12 |
| abstract_inverted_index.with | 109 |
| abstract_inverted_index.(FDO) | 38 |
| abstract_inverted_index.HOL4. | 134 |
| abstract_inverted_index.based | 33 |
| abstract_inverted_index.best, | 122 |
| abstract_inverted_index.first | 50 |
| abstract_inverted_index.logic | 23 |
| abstract_inverted_index.proof | 2, 16, 24, 47, 58, 67, 83, 104, 129 |
| abstract_inverted_index.steps | 59 |
| abstract_inverted_index.their | 73 |
| abstract_inverted_index.using | 63 |
| abstract_inverted_index.guided | 1 |
| abstract_inverted_index.manual | 10 |
| abstract_inverted_index.mining | 65 |
| abstract_inverted_index.random | 46 |
| abstract_inverted_index.(BA).In | 42 |
| abstract_inverted_index.Fitness | 35 |
| abstract_inverted_index.Genetic | 114 |
| abstract_inverted_index.created | 51 |
| abstract_inverted_index.evolved | 71 |
| abstract_inverted_index.finding | 130 |
| abstract_inverted_index.fitness | 74, 77 |
| abstract_inverted_index.matches | 75 |
| abstract_inverted_index.pattern | 64 |
| abstract_inverted_index.provide | 27 |
| abstract_inverted_index.proving | 7 |
| abstract_inverted_index.target) | 82 |
| abstract_inverted_index.theorem | 6 |
| abstract_inverted_index.BA-based | 103 |
| abstract_inverted_index.compared | 108 |
| abstract_inverted_index.followed | 123 |
| abstract_inverted_index.original | 80 |
| abstract_inverted_index.performs | 121 |
| abstract_inverted_index.proposed | 93, 100 |
| abstract_inverted_index.(GA)based | 116 |
| abstract_inverted_index.Algorithm | 41, 115 |
| abstract_inverted_index.Annealing | 111 |
| abstract_inverted_index.Dependent | 36 |
| abstract_inverted_index.Optimizer | 37 |
| abstract_inverted_index.Simulated | 110 |
| abstract_inverted_index.consuming | 13 |
| abstract_inverted_index.different | 96 |
| abstract_inverted_index.occurring | 57 |
| abstract_inverted_index.performed | 86 |
| abstract_inverted_index.searching | 17, 105 |
| abstract_inverted_index.sequences | 48, 68 |
| abstract_inverted_index.algorithms | 30, 94 |
| abstract_inverted_index.approaches | 106 |
| abstract_inverted_index.assistant, | 25 |
| abstract_inverted_index.automating | 15 |
| abstract_inverted_index.discovered | 62 |
| abstract_inverted_index.frequently | 56 |
| abstract_inverted_index.population | 54 |
| abstract_inverted_index.algorithms, | 45 |
| abstract_inverted_index.development | 3 |
| abstract_inverted_index.interactive | 5 |
| abstract_inverted_index.investigate | 88 |
| abstract_inverted_index.performance | 90 |
| abstract_inverted_index.activity.For | 14 |
| abstract_inverted_index.higher-order | 22 |
| abstract_inverted_index.optimization | 19, 132 |
| abstract_inverted_index.metaheuristic | 29, 44 |
| abstract_inverted_index.methods.Results | 117 |
| abstract_inverted_index.techniques.Created | 66 |
| abstract_inverted_index.theories.Moreover, | 98 |
| abstract_inverted_index.sequences.Experiments | 84 |
| cited_by_percentile_year | |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.1032261 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |