{"entities":{"Q1430287":{"pageid":1441027,"ns":120,"title":"Item:Q1430287","lastrevid":70385508,"modified":"2026-04-13T14:25:07Z","type":"item","id":"Q1430287","labels":{"en":{"language":"en","value":"Locally determined logic programs and recursive stable models"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2069239"}},"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":"Q1430287$065DF05E-FD99-46DC-A9E8-AC1232DA5F44","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3498ad2c97c237fe10f9bbb4a5da26057945f40e","datavalue":{"value":{"text":"Locally determined logic programs and recursive stable models","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1430287$28828D80-365E-4931-80F9-C2E32741048F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"014149c857006a38c7e4685c915c495e18aa17eb","datavalue":{"value":"1049.68035","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$56326802-3A39-4913-9DFA-6B50BC0F5C9C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"145c03530c940241521ed95376f4dbe1797e1d36","datavalue":{"value":{"entity-type":"item","numeric-id":524277,"id":"Q524277"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1430287$5F161B1C-3753-44F6-9E9D-C6E7E80EE6A0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b0f6fdf4f3f465df0e05c2d6acbae14205cc86ce","datavalue":{"value":{"entity-type":"item","numeric-id":1430286,"id":"Q1430286"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1430287$09E013E4-6B71-4C26-A170-D2CA220A93EC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5dc30c87ee90e636f091c198a5b55721665c69f9","datavalue":{"value":{"entity-type":"item","numeric-id":698606,"id":"Q698606"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1430287$C3D1D376-82E9-459B-96F2-BC67C8CA675B","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"7346dc34d1d50fea46ec345fbc7e3214530889ab","datavalue":{"value":{"entity-type":"item","numeric-id":276517,"id":"Q276517"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1430287$BFC41193-3D85-45BD-A55F-571F423B9AD1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"4ba9d052c1c742a2c2f9206a1b4282a8f44ef61e","datavalue":{"value":{"time":"+2004-05-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1430287$6019BA86-8445-4B6C-B350-4AB06F89CB36","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"52e601c6089e2216a87f6c4b6bb05e90d10418d3","datavalue":{"value":"The logic program {\\textit{P}} is a finite set of clauses of the form \\(C = p \\leftarrow q_{1},\\dots ,q_{n},\\neg r_{1},\\dots ,\\neg r_{m}\\), where {\\textit{p}}\\(,{q_{1}},\\dots , {q_{n}},{r_{1}},\\dots ,{r_{m}}\\) are atomic formulas possibly with variables in some first-order logic. The authors consider Herbrand's type models of logic programs and recursive logic programs connected with G\u00f6del numbering of the elements of the Herbrand base. Theorem 1. If {\\textit{T}} is a highly recursive tree contained in \\(\\omega^{\\omega}\\), then there exists an effectively locally determined recursive logic program {\\textit{P}} such that there is an effective one-to-one degree preserving correspondence between the set of infinite paths through {\\textit{T}} and the set of all stable models of the program {\\textit{P}}. Theorem 2. If {\\textit{P}} is a recursive logic program which has witnesses with effective delay and has at least one stable model, then the lexicographically least stable model of {\\textit{P}} is recursive. The authors define a polynomial-time version of effectively locally determined recursive logic programs and recursive logic programs with effective witnesses which ensure that a logic program {\\textit{P}} has models which are NP, EXPTIME, etc. They characterize the set of stable models of locally determined logic programs.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$AA267CFA-45D8-4215-A3E1-2E29515F8CF3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b492f281b8f52c724f2bc547e7e570cccf4bd5e0","datavalue":{"value":"68N17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$F2B05D7B-32E3-4797-A15C-5730B792F9FB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"62ae2f4e9717dc72a20d2c4f17bdde30d85a417c","datavalue":{"value":"68T27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$A3C53299-0FE4-4265-A116-7E767615F3BE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d53cd5ab715340bbfc507bf5b4aac1b907f4465d","datavalue":{"value":"03B70","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$2F3202D1-DBA2-4DAC-A861-DA608B92420F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"cfb1cd31a5028e73d9016599222b5f8dd89ebfc1","datavalue":{"value":"2069239","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$2630711A-F302-4424-8E65-A751FA519A31","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f29a21056659ddd61d90d54babdf84724b9ceb18","datavalue":{"value":"logic program","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$56893A4C-0AEF-4B2F-822A-E2D6D0ADD742","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e0e192ad0ff7f8fee5044f9a2dd1204612aab5b4","datavalue":{"value":"model of recursive logic program","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$DD09B8AC-0F8A-46FF-A6D4-BB045B47D734","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e5f330fb0a96988399b2cad6e13eaac2b7823f0d","datavalue":{"value":"stable model","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$0A5E523D-6766-4F7C-986F-C729E28F2BA9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0edbd8242aba263ef2cbcc8ca1c96b373f7e693b","datavalue":{"value":"complexity of model","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$3579704B-8FBC-4548-A2BA-81A4F907E077","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"17d6f2354e4b2e7a2da468d62f5e979d9061519e","datavalue":{"value":"non-monotonic logic","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$BACD5E68-B8FA-427A-B1DB-0836635960CB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"91993be004af1453cf4fd79c07e1ba49b9211805","datavalue":{"value":"logic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1430287$9D15752A-B0ED-4D68-99D2-66FD3F619020","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":"Q1430287$56595422-1212-4510-B57E-F219C55DE3AA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ab82f865e72dc4e0c34a41baf4aa1017b2d43b72","datavalue":{"value":"https://doi.org/10.1023/b:amai.0000012868.41613.e7","type":"string"},"datatype":"url"},"type":"statement","id":"Q1430287$6B5B61CB-44D5-4E07-92FA-C08B32280BE6","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"21f451b248ce1b80ecd929865a01446631352ac1","datavalue":{"value":"W2003857631","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$8E006122-1EC3-42A5-8A63-668F5C250214","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"a157cfd86bcb64424848a426de62b86ae3f8eb26","datavalue":{"value":"10.1023/B:AMAI.0000012868.41613.E7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1430287$0314042B-62F5-4711-9652-148FCC4C10E1","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c6c2f65d9516fcb234678f49c21646ce00feaf61","datavalue":{"value":{"entity-type":"item","numeric-id":4955327,"id":"Q4955327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"219ea0288bfe22523837297289868d029b5d2191","datavalue":{"value":{"amount":"+0.9112787246704102","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1430287$B466FDD6-67F8-4AE5-8AA7-3E49885FE25C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5a0a202090ff978fec8e15b924c92627c7ef2d39","datavalue":{"value":{"entity-type":"item","numeric-id":3608648,"id":"Q3608648"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"219ea0288bfe22523837297289868d029b5d2191","datavalue":{"value":{"amount":"+0.9112787246704102","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1430287$BA9998E9-36F5-4D0E-9919-CBFBA08A7947","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3e18d9616d7baac58d459bd46b36c66d83001643","datavalue":{"value":{"entity-type":"item","numeric-id":1192346,"id":"Q1192346"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"fd02ade970d27508cf88045910aa17a929796d54","datavalue":{"value":{"amount":"+0.8647363185882568","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1430287$8E73FB4A-B151-402D-8189-C7EB22C6F7AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6c12e453d11a389c47897f0553e6007a77670f20","datavalue":{"value":{"entity-type":"item","numeric-id":4245929,"id":"Q4245929"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5192671ce39b690c25b816956a44e7706c95d592","datavalue":{"value":{"amount":"+0.8529270887374878","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1430287$894A2279-364E-48F7-A479-40329EC0761F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0c3d505f96ed8ee77ec771f6339d22613dc2f73d","datavalue":{"value":{"entity-type":"item","numeric-id":4318872,"id":"Q4318872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"289cba9f483836961d36718d49a53648103627bf","datavalue":{"value":{"amount":"+0.847409725189209","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1430287$4869EA0A-7D0C-4446-BBB1-2A310E97DDF1","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Locally determined logic programs and recursive stable models","badges":[]}}}}}