{"entities":{"Q672662":{"pageid":674511,"ns":120,"title":"Item:Q672662","lastrevid":63600225,"modified":"2026-04-11T14:15:27Z","type":"item","id":"Q672662","labels":{"en":{"language":"en","value":"A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 985121"}},"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":"Q672662$88439D6D-3901-404C-B27B-3D2436910349","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9f0ead1ad0d4e8df96b806e036bf9a01fa9bba1e","datavalue":{"value":{"text":"A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q672662$4A6078F5-8F13-4501-ABE4-DDB62F7E3AE3","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0746e3a7d3d4b84822c7883504f2103b287bf42f","datavalue":{"value":"0998.68522","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q672662$7FFD9F30-BD60-45A2-8543-02F947BFBE23","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9b24b61c32df9d73e643dd87dd2aa70601c3e3c7","datavalue":{"value":"10.1016/0020-0190(95)00097-V","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q672662$8396E939-C74B-4F5B-B2CC-25A67B894C8D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"03146bb8e17b3d6cc14817a371f8c48ba30cf452","datavalue":{"value":{"entity-type":"item","numeric-id":624377,"id":"Q624377"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$75CCB6F6-7BDF-4118-BF91-D600D2DDD749","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$254C0983-6031-4C31-A1EE-A008FBAC19B0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"00d109e26a7fcb906853bbbede91db350c2b0258","datavalue":{"value":{"time":"+1997-02-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q672662$A5A63235-C68B-4DC7-B772-8BEE86C0778E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"bf2726c5c2109371cc10358eaa69bc4df711caf7","datavalue":{"value":"68P15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q672662$AE618CA8-9DDF-4D44-8BC1-26EB989DB7B4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6a3f8069aae692c811510f2bd18022ea6e731238","datavalue":{"value":"985121","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q672662$94BD9901-A8CC-4C9C-9040-B796AC24FAD2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d3caa368fb737eb1105119315dd6a8b87518cf9c","datavalue":{"value":"Databases","type":"string"},"datatype":"string"},"type":"statement","id":"Q672662$CC0D516D-D079-4885-A489-041682D7EE95","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e39807ce65c97d0e0263e18a3816f84213a6ec1e","datavalue":{"value":"Theory of computation","type":"string"},"datatype":"string"},"type":"statement","id":"Q672662$0354DBAD-5BC4-4FAB-AF9B-2BDB2B6222B5","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"7545068a6822e4e652ce3b521c8f6365c7bdc7b9","datavalue":{"value":{"entity-type":"item","numeric-id":31846,"id":"Q31846"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$FEF6A42B-BAC0-48AD-B548-9F183755A966","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":"Q672662$2B1B91BC-8367-489B-81EA-F9865E5D301E","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"f55d8e9e513e18f865fb488ac9b15306f0f42c0f","datavalue":{"value":{"entity-type":"item","numeric-id":1151060,"id":"Q1151060"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$61D6D524-DC9D-4DB7-926F-8AECE8F91346","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"04199e03d1d3ec0d2b5fbfff526a164b91654871","datavalue":{"value":{"entity-type":"item","numeric-id":1838840,"id":"Q1838840"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$0FE52282-8924-44E9-A0C6-8937288BE83D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d5da8d98d4ec041299354c76626f2915e28b7732","datavalue":{"value":{"entity-type":"item","numeric-id":753477,"id":"Q753477"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$E7CB1055-16E7-4E6E-A5B3-DBB026E91013","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3bb49bca774ef958b14c319951e48162cbd7fa98","datavalue":{"value":{"entity-type":"item","numeric-id":4199578,"id":"Q4199578"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$A3C149A6-DB55-4E22-A977-516D1133A2F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4a675fab4321817783597d6a1b8160efcb24c4ec","datavalue":{"value":{"entity-type":"item","numeric-id":3753525,"id":"Q3753525"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$ADC8544F-0725-4D0F-A7C4-3ADDAD00E1B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b97aae996047866e201e0764a961d1290615bba0","datavalue":{"value":{"entity-type":"item","numeric-id":4385543,"id":"Q4385543"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$47B63B65-397C-462B-A22C-D57382A66A61","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ef56960fae4b4e9a29f90c815f212e84b21a1ff2","datavalue":{"value":{"entity-type":"item","numeric-id":3833657,"id":"Q3833657"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$1BFFAD22-EF7A-49DF-858A-E39F97C341C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"6a32bc0ef00c31c61a800b19fbaf8e0898507642","datavalue":{"value":{"entity-type":"item","numeric-id":3477931,"id":"Q3477931"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q672662$6559297A-3DF1-48D0-BBB4-95A37251FF2C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"dfb9d0e6c8d1c863b1326e096b5ca249600fc01f","datavalue":{"value":"https://doi.org/10.1016/0020-0190(95)00097-v","type":"string"},"datatype":"url"},"type":"statement","id":"Q672662$CAC599C6-7837-4BC9-BCFE-988417ED17FD","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"d72ed10b2f26d89c453237cdf0bb92a875705b06","datavalue":{"value":"W2089031578","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q672662$76CD1A5A-6F99-41A2-A383-9E33D3A57FA8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_simple_proof_on_the_decidability_of_equivalence_between_recursive_and_nonrecursive_Datalog_programs"}}}}}