{"entities":{"Q1198441":{"pageid":1209190,"ns":120,"title":"Item:Q1198441","lastrevid":66853563,"modified":"2026-04-12T13:18:07Z","type":"item","id":"Q1198441","labels":{"en":{"language":"en","value":"Approximation logic of programs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 92879"}},"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":"Q1198441$FE68C8E3-0F38-4E6F-AD48-48EC55D1C3A1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3d4f3b7a0e7a5dc83988d92be7686bcef042df69","datavalue":{"value":{"text":"Approximation logic of programs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1198441$42A29095-C16E-4157-9F06-8A8381D4E0BE","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"ffe9d144b07e819c904b4da46702454529895b3d","datavalue":{"value":"0755.03013","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1198441$26F8D012-AB84-4FD0-A1A0-0B5748954E2C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"6f688c626666a61a04994f95e80bd9fe082b947f","datavalue":{"value":{"entity-type":"item","numeric-id":190801,"id":"Q190801"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1198441$DA89D26B-E8EF-4136-A085-ED7BCAFE717F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"be1a65edbb43ce1fc59464f99e70afbd93e8e2a0","datavalue":{"value":{"time":"+1993-01-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1198441$23B9325F-EDD3-44D0-92E5-4BCE9319B3A9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d53cd5ab715340bbfc507bf5b4aac1b907f4465d","datavalue":{"value":"03B70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1198441$6AC3EBFE-9850-48C6-B21C-B6DCE0D18A4B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"517ace4a4f9c45a5475b4a8927a567447dbdb293","datavalue":{"value":"68N99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1198441$C092A647-FB3C-4619-B96A-E4E9D824C95F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"33fabe40de11e5ede3c641328c4ceda90fe8bb65","datavalue":{"value":"92879","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1198441$3EA6DB83-F345-470F-95B9-4643EFAE6536","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bbe46657715cc6096ab87d19893dd8e5bc0b0ea2","datavalue":{"value":"rough sets","type":"string"},"datatype":"string"},"type":"statement","id":"Q1198441$C5C8AC2B-7771-42FA-BA01-88E77C1CC56D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"443a1dae8affafea1e7bae54ad28e03c09e45318","datavalue":{"value":"program approximation","type":"string"},"datatype":"string"},"type":"statement","id":"Q1198441$B96521B3-A7D9-475F-BC75-1AB8952E53B4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"34b529f0d8067582ac69a5e5c2e03bde6559f12f","datavalue":{"value":"propositional dynamic logic with approximate programs","type":"string"},"datatype":"string"},"type":"statement","id":"Q1198441$8A91C0B1-B06F-40C6-9FBB-945BF2981A4C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f6816fdf79dd11ac09d9af4886c02baab03d2cf9","datavalue":{"value":"completeness","type":"string"},"datatype":"string"},"type":"statement","id":"Q1198441$0B53B3C7-EAC1-4AB7-8DF3-195E49074FF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48fe5da30f2000a910dd1a06f280ea2b3174328d","datavalue":{"value":"decidability","type":"string"},"datatype":"string"},"type":"statement","id":"Q1198441$9C31DF3C-681D-4174-873A-440D5F24EF4F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"cc52878cce9528ee2498539b4d2ac0abd413625a","datavalue":{"value":{"entity-type":"item","numeric-id":938783,"id":"Q938783"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1198441$7CB4F7A5-F3B3-40C8-ADE0-943A503AC130","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":"Q1198441$A5F91A4F-19D9-4388-A586-F44CFE0AAD09","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximation logic of programs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximation_logic_of_programs"}}}}}