OURANO$ I$-MOTHgR-OF HIPEHION OR OURz~IOS IS-FATHER-OF HYPERION GAVE ME THE ~JqSIVER: YES DO YOU MANT MORE INFOPJ4ATIOM? YES OUIfANOS IS-IdOTHER-OF Hâ¢PERI'ON GAVE ME THE A21SWER: NO AND BESIDES OURANOS IS-FATHER-OF HYPERION GAVE ME THE ANSWER YES Trees and Networks Using APL2 Z. K Ji zba Nested arrays in APL together with other enhancements make it possible to build LISP-like (and PROLOGlike) applications. This paper describes some of the techniques for dealing with structures such as TREES and NETWORKS. Examples illustrate possible applications in the field of artificial intelligence. TREES A vector can be thought of as a rooted tree (for definitions of these terms, see a textbook on graph theory such as [11). For example, the vector of integers could be represented by a tree diagram: VECTOR: 1 2 3 4 TREE: Conclusion As described before, the system is now complete and performs logic inferences according to expectations. The syntax is more compact than PROLOG's, and the number of rules and axioms for a given system is somewhat smaller. In the case of our example, a total of 24 rules and 174 axioms contain all the information. Quite complicated questions on genealogy and relationship of the Greek gods
End of preview. The entire article is 5 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/trees-and-networks-using-apl2-NRktW9zilc
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Trees and networks using APL2
Jizba, Z V
Follow ACM SIGAPL APL Quote Quad
, Volume 16 (3)
Association for Computing Machinery – Mar 1, 1986
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
