{"doi":"10.4230/lipics.fscd.2016.33","title":"Unknown","abstract":null,"journal":"Leibniz-Zentrum für Informatik (Schloss Dagstuhl)","year":null,"id":22971,"datarank":0.6495347627502324,"base_score":1.791759469228055,"endowment":1.791759469228055,"self_citation_contribution":0.26876392038420827,"citation_network_contribution":0.3807708423660241,"self_endowment_contribution":0.26876392038420827,"citer_contribution":0.3807708423660241,"corpus_percentile":null,"corpus_rank":null,"citation_count":5,"citer_count":5,"citers_with_citation_signal":4,"citers_with_endowment":4,"datacite_reuse_total":3,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":1.791759469228055,"endowment":1.791759469228055,"datacite_reuse_total":3,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2491573813","authors":[],"funders":[],"total_grants":0,"fwci":0.8834,"citation_percentile":0.84158494,"influential_citations":0,"citation_trend":[{"year":2017,"count":1},{"year":2018,"count":1},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2023,"count":1}],"oa_status":"green","license":"cc-by","oa_locations":[{"url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.33","host_type":"repository"},{"url":"https://doi.org/10.4230/lipics.fscd.2016.33","host_type":"repository"}],"fields_of_study":["Natural Language Processing Techniques","Semantic Web and Ontologies","Logic, programming, and type systems","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Ground Confluence","Rewriting Induction","Non-Orientable Equations","Term Rewriting Systems","Confluence","Rewriting","Gas meter prover","Term (time)","Automated theorem proving","Computer science","Focus (optics)","Programming language","Mathematics","Calculus (dental)","Mathematical proof","Physics","Geometry"],"sdg_mappings":[],"linked_datasets":[{"doi":"10.4230/lipics.fscd.2024.27","title":"A Verified Algorithm for Deciding Pattern Completeness","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.fscd.2017.7","title":"Improving Rewriting Induction Approach for Proving Ground Confluence","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferencePaper"},{"doi":"10.4230/lipics.fscd.2016","title":"LIPIcs, Volume 52, FSCD'16, Complete Volume","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","resource_type":"ConferenceProceeding"}],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-07T17:20:43.807821Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}