A New Algorithm for Computing Least Generalization of a Set of Atoms

DOI10.1007/978-3-030-49210-6_8OpenAlexW3032943227MaRDI QIDQ5041770

Chiaki Sakama, Hien D. Nguyen

Publication date: 14 October 2022

Published in: Inductive Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-49210-6_8

zbMATH Keywords

anti-unificationanti-combinationleast generalization

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• A note on the parallel complexity of anti-unification
• Efficient parallel term matching and anti-unification
• Properties of substitutions and unifications
• A fixpoint semantics of Horn sentences based on substitution sets
• Foundations of inductive logic programming
• Encyclopedia of Parallel Computing
• On complexity of the anti-unification problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A New Algorithm for Computing Least Generalization of a Set of Atoms