{"entities":{"Q4470511":{"pageid":6500110,"ns":120,"title":"Item:Q4470511","lastrevid":109345730,"modified":"2026-11-12T05:14:03Z","type":"item","id":"Q4470511","labels":{"en":{"language":"en","value":"Solving a unification problem under constrained substitutions using tree automata"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2077127"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$30F3292B-EDDB-43FA-866E-187CC8E0BF05","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8a7aaba9544e9ce6f1cd06ad92d9c411a7f60951","datavalue":{"value":"1044.68649","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4470511$F188EFF0-6DA0-4D79-929D-0990D1FADEAA","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2fddf6bcfaedb5ef2538a195463523105ec6a10a","datavalue":{"value":{"entity-type":"item","numeric-id":1355758,"id":"Q1355758"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$145C78D5-37F3-499B-B56A-6E54F4D75567","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a91c70728c74c182012bfdf88c53b046e8724be7","datavalue":{"value":{"entity-type":"item","numeric-id":1355759,"id":"Q1355759"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$A5653022-DE61-4906-83DC-722D74929B49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5ac8477c8571818916759218f885a65ca2902ef6","datavalue":{"value":{"entity-type":"item","numeric-id":1060027,"id":"Q1060027"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$EB70D5D6-FA7E-49DB-9450-FF3E6DF9C2EC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7f1c91819e1068c0617e66c7ecdafdccd99ae8ff","datavalue":{"value":{"time":"+2004-07-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4470511$F1D1EE0B-8D51-4C26-B991-5B49ED8C1DA9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"c636094cc8b933189eabd7c009d327f829bc6ac4","datavalue":{"value":"68Q42","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4470511$5A15CA31-49D0-412E-B7D8-FECDF08CA407","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9b78776a56fc28cdd893baa47605a105412b838a","datavalue":{"value":"68Q45","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4470511$CD5C0212-CE9C-4440-83F2-A50F5017C90A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3d264d28086a1b6c6c9726fb59e8f8271697af7a","datavalue":{"value":"2077127","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4470511$404A8A45-32BE-439D-A37C-74E9EF82B124","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$3E6121E4-BA99-4125-9B68-DBF78FF53E5A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c1c624d6ffb1434702fbcd380a00a901a76b1022","datavalue":{"value":{"text":"Solving a unification problem under constrained substitutions using tree automata","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4470511$53481D97-6033-430D-9706-61EE0F355743","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d2df78f0ff931ce687f3246f26a997d63182ca90","datavalue":{"value":"10.1007/3-540-58715-2_131","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4470511$27142A21-5CE7-4220-A6C5-FC827EEFE179","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4470511$445C9ADD-C77F-4A0B-9E2E-2BCDBB8FA202","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solving a unification problem under constrained substitutions using tree automata (scientific article; zbMATH DE number 2077127)","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Solving_a_unification_problem_under_constrained_substitutions_using_tree_automata_(scientific_article;_zbMATH_DE_number_2077127)"}}}}}