ITERATIVE AND RECURSIVE ALGORITHMS FOR TREE SEARCH AND PARTITION SEARCH OF THE LATTICE OF STRUCTURE MODELS

DOI10.1080/03081079208945035zbMath0757.93008OpenAlexW1996294744MaRDI QIDQ4008491

Roger E. Cavallo, John de Voy

Publication date: 27 September 1992

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079208945035

zbMATH Keywords

modellingrecursive Boolean latticesimplest models

Mathematics Subject Classification ID

Related Items (1)

BIBLIOGRAPHY OF RECONSTRUCTABILITY ANALYSIS

Cites Work

• Unnamed Item
• Reconstructability analysis: Aims, results, open problems
• PROCEDURES FOR GENERATING RECONSTRUCTION HYPOTHESES IN THE RECONSTRUCTABILITY ANALYSIS
• Theoretical duration and amplitude of an FM click (Corresp.)
• RECONSTRUCTABILITY ANALYSIS OF MULTI-DIMENSIONAL RELATIONS: A Theoretical Basis for Computer-Aided Determination of Acceptable Systems Models †
• RECONSTRUCTABILITY† ANALYSIS: Evaluation of Reconstruction Hypotheses‡

This page was built for publication: ITERATIVE AND RECURSIVE ALGORITHMS FOR TREE SEARCH AND PARTITION SEARCH OF THE LATTICE OF STRUCTURE MODELS