{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:24:41Z","timestamp":1762100681467},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540721994"},{"type":"electronic","value":"9783540722007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72200-7_14","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T16:54:47Z","timestamp":1181062487000},"page":"149-161","source":"Crossref","is-referenced-by-count":5,"title":["Head-Elementary-Set-Free Logic Programs"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gebser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joohyung","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuliya","family":"Lierler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Proceedings of International Logic Programming Symposium, pp. 266\u2013278 (1993)","key":"14_CR1"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R. Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu, R., Dechter, R.: Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence\u00a012, 53\u201387 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"unstructured":"Gelfond, M., et al.: Disjunctive defaults. In: Proceedings of International Conference on Principles of Knowledge Representation and Reasoning, pp. 230\u2013237 (1991)","key":"14_CR3"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic\u00a07, 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"14_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/11546207_44","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Lierler","year":"2005","unstructured":"Lierler, Y.: Cmodels: SAT-based disjunctive answer set solver. In: Baral, C., et al. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 447\u2013451. Springer, Heidelberg (2005)"},{"unstructured":"Gebser, M., Lee, J., Lierler, Y.: Elementary sets for logic programs. In: Proceedings of National Conference on Artificial Intelligence (2006)","key":"14_CR6"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157, 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"unstructured":"Lin, F., Zhao, J.: On tight logic programs and yet another translation from normal logic programs to propositional logic. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 853\u2013858 (2003)","key":"14_CR8"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2630","volume":"135","author":"N. Leone","year":"1997","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation\u00a0135, 69\u2013112 (1997)","journal-title":"Information and Computation"},{"unstructured":"Anger, C., Gebser, M., Schaub, T.: Approaching the core of unfounded sets. In: Proceedings of International Workshop on Nonmonotonic Reasoning, pp. 58\u201366 (2006)","key":"14_CR10"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0004-3702(03)00078-X","volume":"151","author":"C. Koch","year":"2003","unstructured":"Koch, C., Leone, N., Pfeifer, G.: Enhancing disjunctive logic programming systems by SAT checkers. Artificial Intelligence\u00a0151, 177\u2013212 (2003)","journal-title":"Artificial Intelligence"},{"key":"14_CR12","series-title":"Lecture Notes in Artificial Intelligence","first-page":"53","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Schaub","year":"2005","unstructured":"Schaub, T., Gebser, M.: Loops: Relevant or Redundant? In: Baral, C., et al. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 53\u201365. Springer, Heidelberg (2005)"},{"unstructured":"Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 503\u2013508 (2005)","key":"14_CR13"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10472-006-9025-2","volume":"47","author":"P. Ferraris","year":"2006","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence\u00a047, 79\u2013101 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"14_CR15","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1017\/S1471068403001765","volume":"3","author":"E. Erdem","year":"2003","unstructured":"Erdem, E., Lifschitz, V.: Tight logic programs. Theory and Practice of Logic Programming\u00a03, 499\u2013518 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"unstructured":"You, J.H., Yuan, L.Y., Zhang, M.: On the equivalence between answer sets and models of completion for nested logic programs. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 859\u2013866 (2003)","key":"14_CR17"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K. Apt","year":"1988","unstructured":"Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89\u2013148. Morgan Kaufmann, San Francisco (1988)"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","volume":"19\/20","author":"C. Baral","year":"1994","unstructured":"Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming\u00a019\/20, 73\u2013148 (1994)","journal-title":"Journal of Logic Programming"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"K. Inoue","year":"1998","unstructured":"Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming\u00a035, 39\u201378 (1998)","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"Sacc\u00e1, D., Zaniolo, C.: Stable models and non-determinism in logic programs with negation. In: Proceedings of ACM Symposium on Principles of Database Systems, pp. 205\u2013217 (1990)","key":"14_CR21","DOI":"10.1145\/298514.298572"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1131313.1131316","volume":"7","author":"V. Lifschitz","year":"2006","unstructured":"Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic\u00a07, 261\u2013268 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W. Dowling","year":"1984","unstructured":"Dowling, W., Gallier, J.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming\u00a01, 267\u2013284 (1984)","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72200-7_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:29:31Z","timestamp":1605763771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72200-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540721994","9783540722007"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72200-7_14","relation":{},"subject":[]}}