Algorithmic Compression of Finite Tree Languages by Rigid Acyclic Grammars

Author:

Eberhard Sebastian1,Ebner Gabriel1,Hetzl Stefan1ORCID

Affiliation:

1. TU Wien, Wien, Austria

Abstract

We present an algorithm to optimally compress a finite set of terms using a vectorial totally rigid acyclic tree grammar. This class of grammars has a tight connection to proof theory, and the grammar compression problem considered in this article has applications in automated deduction. The algorithm is based on a polynomial-time reduction to the MaxSAT optimization problem. The crucial step necessary to justify this reduction consists of applying a term rewriting relation to vectorial totally rigid acyclic tree grammars. Our implementation of this algorithm performs well on a large real-world dataset.

Funder

Vienna Science Fund

FWF project

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference39 articles.

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Anti-unification and the theory of semirings;Theoretical Computer Science;2020-12

2. Higher-order pattern generalization modulo equational theories;Mathematical Structures in Computer Science;2020-05-20

3. QED at Large: A Survey of Engineering of Formally Verified Software;Foundations and Trends® in Programming Languages;2019

4. On the Generation of Quantified Lemmas;Journal of Automated Reasoning;2018-03-23

5. Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars;Developments in Language Theory;2018

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3