{"entities":{"Q1606970":{"pageid":1617710,"ns":120,"title":"Item:Q1606970","lastrevid":68027283,"modified":"2026-04-12T20:56:54Z","type":"item","id":"Q1606970","labels":{"en":{"language":"en","value":"A constraint-based approach to narrow search trees for satisfiability"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1771697"}},"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":"Q1606970$680CEA21-B3AC-44C5-A682-54F5789D1119","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"5989e78301465eeb521d2dffdd0e0eca2a5a61c1","datavalue":{"value":{"text":"A constraint-based approach to narrow search trees for satisfiability","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1606970$DEDF9AFC-7A94-411C-B6E2-C43E2E57A984","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c1801fedc04665025e1459bbe33a776aa99674e7","datavalue":{"value":"1015.68518","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$C6E92996-73FF-439D-88A1-825FD55089BC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2825bf265459c62bf33ce6f8d8bdb991ad3df40c","datavalue":{"value":"10.1016/S0020-0190(99)00088-5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$BF187160-3735-4F43-8381-6DF59370FD16","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":"Q1606970$E4923571-1322-4CE3-A588-B3088C9FC078","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"da39a7fd1a76a539516fc1c6fcfdf3ed355f9814","datavalue":{"value":{"time":"+2002-07-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1606970$77B8CB25-87F6-483B-B963-9BD8FE68FAC9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$95B81FDF-FA9C-4C49-8174-16FE11CD986C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"10eaeaf8bbf8231bbfc812aab8956e260b5a9f12","datavalue":{"value":"03B35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$070D1FEE-C66E-486B-9E2A-1E5FC238A51C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d7656d1c841701431b0b3d99d23720089a267cbb","datavalue":{"value":"03D15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$C28A58FA-0F4B-43AC-A98F-70B477E187AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e6e7c2e9d67f9590a26e18c734f34db53ce5ec87","datavalue":{"value":"68T15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$D365F6C2-62D1-4EEC-A2DB-941764CC5E0E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"419d6f2b09c39920e34f63114ff159a2f0a01812","datavalue":{"value":"03B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$7260670A-071C-4D9F-A341-137BB617509C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f323bb7208bad71b5adfadf19d76ff4a07407fab","datavalue":{"value":"1771697","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$57D668F8-DFCE-41FE-9684-6EF940E5751B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7986c1376ee4e29177d07fbf4a702c20a602731c","datavalue":{"value":{"entity-type":"item","numeric-id":337151,"id":"Q337151"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1606970$651E4F76-FB8A-4152-8AD2-D4D08A5B6A66","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":"Q1606970$E9EC4C8E-5DFD-46D8-8912-7BB6A8AE5AC1","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a000be7124fb2a3fb1a2724a00cacd4e8eb6b435","datavalue":{"value":"https://doi.org/10.1016/s0020-0190(99)00088-5","type":"string"},"datatype":"url"},"type":"statement","id":"Q1606970$103FF8FD-DA49-4726-8C84-E4987A828FF5","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"bd2f05698badaf450c1a5e908767963fc64dc24a","datavalue":{"value":"W2021144815","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1606970$AE9AD534-1B6F-4356-9E58-ECACB90C58E8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A constraint-based approach to narrow search trees for satisfiability","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_constraint-based_approach_to_narrow_search_trees_for_satisfiability"}}}}}