{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:11:51Z","timestamp":1712301111935},"reference-count":9,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,6,28]],"date-time":"2015-06-28T00:00:00Z","timestamp":1435449600000},"content-version":"vor","delay-in-days":1488,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1016\/j.disc.2011.02.029","type":"journal-article","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T04:17:29Z","timestamp":1301026649000},"page":"966-977","source":"Crossref","is-referenced-by-count":4,"title":["On graph equivalences preserved under extensions"],"prefix":"10.1016","volume":"311","author":[{"given":"Zbigniew","family":"Lonc","sequence":"first","affiliation":[]},{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2011.02.029_br000005","series-title":"Prolog Programming for Artificial Intelligence","author":"Bratko","year":"2001"},{"key":"10.1016\/j.disc.2011.02.029_br000010","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/j.disc.2011.02.029_br000015","series-title":"Graph Theory","author":"Diestel","year":"2000"},{"key":"10.1016\/j.disc.2011.02.029_br000020","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1145\/1243996.1244000","article-title":"Semantical characterizations and complexity of equivalences in answer set programming","volume":"8","author":"Eiter","year":"2007","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/j.disc.2011.02.029_br000025","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.disc.2011.02.029_br000030","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"2","author":"Lifschitz","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"key":"10.1016\/j.disc.2011.02.029_br000035","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010","first-page":"123","article-title":"Characterizing strong equivalence for argumentation frameworks","author":"Oikarinen","year":"2010"},{"key":"10.1016\/j.disc.2011.02.029_br000040","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1017\/S1471068403001819","article-title":"Strong equivalence made easy: nested expressions and weight constraints","volume":"3","author":"Turner","year":"2003","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/j.disc.2011.02.029_br000045","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1017\/S1471068407003250","article-title":"A common view on strong, uniform, and other notions of equivalence in answer-set programming","volume":"8","author":"Woltran","year":"2008","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X11000859?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X11000859?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,3]],"date-time":"2018-12-03T22:50:15Z","timestamp":1543877415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X11000859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":9,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["S0012365X11000859"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2011.02.029","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2011,6]]}}}