
Antiunification in Constraint Logic Programming
Antiunification refers to the process of generalizing two (or more) goa...
read it

Some Geometric Applications of AntiChains
We present an algorithmic framework for computing antichains of maximum...
read it

Complexity of computing the antiRamsey numbers
The antiRamsey numbers are a fundamental notion in graph theory, introd...
read it

Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
For the General Factor problem we are given an undirected graph G and fo...
read it

On the Complexity of Verification of TimeSensitive Distributed Systems: Technical Report
This paper develops a Multiset Rewriting language with explicit time for...
read it

Computing Betweenness Centrality in Link Streams
Betweeness centrality is one of the most important concepts in graph ana...
read it

EGeneralization Using Grammars
We extend the notion of antiunification to cover equational theories an...
read it
Technical Report: Antiunification of Unordered Goals
Antiunification in logic programming refers to the process of capturing common syntactic structure among given goals, computing as such a single new goal that is more general and hence called a generalization of the given goals. Finding an arbitrary common generalization for two goals is trivial, but looking for those common generalizations that are either as large as possible (called largest common generalizations) or as specific as possible (called most specific generalizations) is a nontrivial optimization problem, in particular when goals are considered to be unordered sets of atoms. In this work we provide an indepth study of the problem by defining two different generalization relations. We formulate a characterization of what constitutes a most specific generalization in both settings. While these generalizations can be computed in polynomial time, we show that when the number of variables in the generalization needs to be minimized, the problem becomes NPhard. We subsequently revisit an abstraction of the largest common generalization when antiunification is based on injective variable renamings, and prove that it can be computed in polynomially bounded time.
READ FULL TEXT
Comments
There are no comments yet.