Anti-unification in Constraint Logic Programming

DOI10.1017/S1471068419000188zbMath1434.68076arXiv1907.10333WikidataQ127225768 ScholiaQ127225768MaRDI QIDQ5108501

Wim Vanhoof, Gonzague Yernaux

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.10333

zbMATH Keywords

program analysisanti-unificationCLP(most specific) generalization

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Generalization-Driven Semantic Clone Detection in CLP

Uses Software

• ECCE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The subgraph isomorphism problem for outerplanar graphs
• E-generalization using grammars
• The subsumption lattice and query learning
• Controlling Polyvariance for Specialization-based Verification
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Horn clauses as an intermediate representation for program analysis and transformation
• Conjunctive partial deduction: foundations, control, algorithms, and experiments

This page was built for publication: Anti-unification in Constraint Logic Programming