{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:08:29Z","timestamp":1759147709169},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,8]]},"abstract":"<jats:p> A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NP-complete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter. <\/jats:p>","DOI":"10.1142\/s0129054105003261","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T10:52:13Z","timestamp":1120560733000},"page":"743-753","source":"Crossref","is-referenced-by-count":6,"title":["AN NP-COMPLETE FRAGMENT OF LTL"],"prefix":"10.1142","volume":"16","author":[{"given":"ANCA","family":"MUSCHOLL","sequence":"first","affiliation":[{"name":"LIAFA, Universit\u00e9 Paris 7,  2, pl. Jussieu, case 7014, F-75251 Paris cedex 05, France"}]},{"given":"IGOR","family":"WALUKIEWICZ","sequence":"additional","affiliation":[{"name":"LaBRI, Universit\u00e9 Bordeaux-1,  351, Cours de la Lib\u00e9ration, F-33 405, Talence cedex, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90005-H"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3094"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9586-5_21"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(87)90036-0"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-003-0136-5"},{"key":"rf10","first-page":"437","volume":"4","author":"Schnoebelen Ph.","journal-title":"Advances in Modal Logic"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:38:43Z","timestamp":1565123923000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,8]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,8]]}},"alternative-id":["10.1142\/S0129054105003261"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003261","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,8]]}}}