On inductive inference of cyclic structures

DOI10.1007/BF01534454zbMath0855.68023OpenAlexW2026438102MaRDI QIDQ1924733

Peter J. Stuckey, Michael J. Maher

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01534454

zbMATH Keywords

inductive inferencelogic programming languagespointer-based data structures

Mathematics Subject Classification ID

Data structures (68P05) Logic programming (68N17)

Related Items (1)

Explicit versus implicit representations of subsets of the Herbrand universe.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamental properties of infinite trees
• Properties of substitutions and unifications
• Semantics of infinite tree logic programming
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• Explicit representation of terms defined by counter examples
• Equational problems and disunification
• The description identification problem
• Negation in logic programming
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems

This page was built for publication: On inductive inference of cyclic structures