{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:42:03Z","timestamp":1750308123275,"version":"3.41.0"},"reference-count":17,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1981,2,1]],"date-time":"1981-02-01T00:00:00Z","timestamp":349833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGSAM Bull."],"published-print":{"date-parts":[[1981,2]]},"abstract":"<jats:p>In this paper we intend to discuss some methods for solving a crucial problem in formula manipulation. This problem arises when a tree is elected -- as the best-fitting data structure - for the representation of a formula.<\/jats:p>","DOI":"10.1145\/1089242.1089246","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"33-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["State-space sets, state-space graphs and n-prefix expressions"],"prefix":"10.1145","volume":"15","author":[{"given":"Victor","family":"K\u00f6falusi","sequence":"first","affiliation":[{"name":"CSO International Computer Education and Information Centre, Hungary"}]},{"given":"Edit","family":"Halmay","sequence":"additional","affiliation":[{"name":"CSO International Computer Education and Information Centre, Hungary"}]}],"member":"320","published-online":{"date-parts":[[1981,2]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"R. Kowalski Logic for problem solving North-Holland New York (1979)   R. Kowalski Logic for problem solving North-Holland New York (1979)"},{"issue":"3","key":"e_1_2_1_2_1","first-page":"5","author":"Szeredi P.","year":"1977","journal-title":"Journal SZAMOL\u00d3G\u00c9P"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"A. T. Berztiss Data structure theory and practice Academic Press New York and London (1971)   A. T. Berztiss Data structure theory and practice Academic Press New York and London (1971)","DOI":"10.1016\/B978-0-12-093550-5.50006-8"},{"volume-title":"Prec. of Logic Programming Workshop","year":"1980","author":"S\u00e1nth\u00e1n\u00e9-T\u00f3th E.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","unstructured":"J. Bendl K. Varga M. K\u00f3sa K. Balogh The specification of an interpreter of a modular PROLOG (Hungarian) NIM IG\u00dcSZI report SOFTTECH D20 SZAMKI (1978)  J. Bendl K. Varga M. K\u00f3sa K. Balogh The specification of an interpreter of a modular PROLOG (Hungarian) NIM IG\u00dcSZI report SOFTTECH D20 SZAMKI (1978)"},{"key":"e_1_2_1_6_1","unstructured":"J. Bendl J-n\u00e9 Boda G. Bogd\u00e1nfy M. K\u00f3sa L. Naszvadi J. Visnyovszky A user's documentation of the system MPROLOG (Hungarian) NIM IG\u00dcSZI report for SZAMKI (1979)  J. Bendl J-n\u00e9 Boda G. Bogd\u00e1nfy M. K\u00f3sa L. Naszvadi J. Visnyovszky A user's documentation of the system MPROLOG (Hungarian) NIM IG\u00dcSZI report for SZAMKI (1979)"},{"key":"e_1_2_1_7_1","unstructured":"V. K\u00f6falusi A PROLOG program for generating the first a formal derivates of given real multivariate analytic functions of greath complexity (Hungarian) SOFTTECH D42 SZAMKI (1979) 104--127  V. K\u00f6falusi A PROLOG program for generating the first a formal derivates of given real multivariate analytic functions of greath complexity (Hungarian) SOFTTECH D42 SZAMKI (1979) 104--127"},{"key":"e_1_2_1_8_1","unstructured":"R. S. Boyer J. S. Moore The sharing of structure in theorem-Proving programs DAI memo no 47 Univ. of Edinburgh (1972)  R. S. Boyer J. S. Moore The sharing of structure in theorem-Proving programs DAI memo no 47 Univ. of Edinburgh (1972)"},{"key":"e_1_2_1_9_1","unstructured":"V. K\u00f6falusi State-space set -- mathematical foundation (Hungarian) Manuscript (1980)  V. K\u00f6falusi State-space set -- mathematical foundation (Hungarian) Manuscript (1980)"},{"key":"e_1_2_1_10_1","unstructured":"D. H. D. Warren WARPLAN--a system for generating plans DAI memo No. 76 Univ. of Edinburgh (1974)  D. H. D. Warren WARPLAN--a system for generating plans DAI memo No. 76 Univ. of Edinburgh (1974)"},{"key":"e_1_2_1_11_1","unstructured":"G. M\u00e1trai The application of PROLOG for search of similar structures of enzym sequences (Hungarian) MTA SZBK report (1979)  G. M\u00e1trai The application of PROLOG for search of similar structures of enzym sequences (Hungarian) MTA SZBK report (1979)"},{"key":"e_1_2_1_12_1","unstructured":"E. Halmay P. Ger\u00f6 PROGART a computerized assistant for the programming instructor Res. report CSO--ICEIC (1980)  E. Halmay P. Ger\u00f6 PROGART a computerized assistant for the programming instructor Res. report CSO--ICEIC (1980)"},{"key":"e_1_2_1_13_1","unstructured":"V. K\u00f6falusi Simplification in mathematical structures (Hungarian) SOFTTECH D42 SZAMKI (1979) 12--86  V. K\u00f6falusi Simplification in mathematical structures (Hungarian) SOFTTECH D42 SZAMKI (1979) 12--86"},{"key":"e_1_2_1_14_1","unstructured":"V. K\u00f6falusi An extended unifier (Hungarian) Manuscript (1980)  V. K\u00f6falusi An extended unifier (Hungarian) Manuscript (1980)"},{"key":"e_1_2_1_15_1","unstructured":"F. Bartha V. K\u00f6falusi Numeric analysis of ligand-bonding systems (Hungarian) MTA SZBK report SOFTTECH D42 SZAMKI (1979) 128--132  F. Bartha V. K\u00f6falusi Numeric analysis of ligand-bonding systems (Hungarian) MTA SZBK report SOFTTECH D42 SZAMKI (1979) 128--132"},{"key":"e_1_2_1_16_1","unstructured":"V. K\u00f6falusi The state-space set and its applicability in PROLOG language appearing in CL & CL (1980)  V. K\u00f6falusi The state-space set and its applicability in PROLOG language appearing in CL & CL (1980)"},{"key":"e_1_2_1_17_1","unstructured":"E. Halmay Problem-reduction approach of the program designing process Res. report CSO--ICEIC (1980)  E. Halmay Problem-reduction approach of the program designing process Res. report CSO--ICEIC (1980)"}],"container-title":["ACM SIGSAM Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089242.1089246","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1089242.1089246","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:22Z","timestamp":1750262902000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1089242.1089246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,2]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,2]]}},"alternative-id":["10.1145\/1089242.1089246"],"URL":"https:\/\/doi.org\/10.1145\/1089242.1089246","relation":{},"ISSN":["0163-5824"],"issn-type":[{"type":"print","value":"0163-5824"}],"subject":[],"published":{"date-parts":[[1981,2]]},"assertion":[{"value":"1981-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}