An Improved Algorithm for E-Generalization

09/03/2017
by   Jochen Burghardt, et al.
0

E-generalization computes common generalizations of given ground terms w.r.t. a given equational background theory E. In 2005 [arXiv:1403.8118], we had presented a computation approach based on standard regular tree grammar algorithms, and a Prolog prototype implementation. In this report, we present algorithmic improvements, prove them correct and complete, and give some details of an efficiency-oriented implementation in C that allows us to handle problems larger by several orders of magnitude.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2019

On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions

The grammar representation of a narrowing tree for a syntactically deter...
research
12/12/2018

On the unavoidability of oriented trees

A digraph is n-unavoidable if it is contained in every tournament of or...
research
08/28/2017

A Type System for Privacy Properties (Technical Report)

Mature push button tools have emerged for checking trace properties (e.g...
research
07/25/2017

Speeding-up ProbLog's Parameter Learning

ProbLog is a state-of-art combination of logic programming and probabili...
research
07/28/2022

Implementing the Diverting Fast Radix Algorithm

This paper presents ThielSort, a practical implementation of the Diverti...
research
04/06/2021

Young Flattenings in the Schur module basis

There are several isomorphic constructions for the irreducible polynomia...
research
05/05/2023

Reduction of Class Activation Uncertainty with Background Information

Multitask learning is a popular approach to training high-performing neu...

Please sign up or login with your details

Forgot password? Click here to reset