{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:21:36Z","timestamp":1762100496252,"version":"3.41.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2006,1]]},"abstract":"<jats:p>This article studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementation of stable models for normal (disjunction-free) programs can be used as the core inference engine. The unfolding is done in two separate steps. First, it is shown that partial stable models can be captured by total stable models using a simple linear and modular program transformation. Hence, reasoning tasks concerning partial stable models can be solved using an implementation of total stable models. Disjunctive partial stable models have been lacking implementations which now become available as the translation handles also the disjunctive case. Second, it is shown how total stable models of disjunctive programs can be determined by computing stable models for normal programs. Thus an implementation of stable models of normal programs can be used as a core engine for implementing disjunctive programs. The feasibility of the approach is demonstrated by constructing a system for computing stable models of disjunctive programs using the SMODELS system as the core engine. The performance of the resulting system is compared to that of DLV, which is a state-of-the-art system for disjunctive programs.<\/jats:p>","DOI":"10.1145\/1119439.1119440","type":"journal-article","created":{"date-parts":[[2006,5,8]],"date-time":"2006-05-08T16:09:20Z","timestamp":1147104560000},"page":"1-37","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":56,"title":["Unfolding partiality and disjunctions in stable model semantics"],"prefix":"10.1145","volume":"7","author":[{"given":"Tomi","family":"Janhunen","sequence":"first","affiliation":[{"name":"Helsinki University of Technology, TKK, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[{"name":"Helsinki University of Technology, TKK, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dietmar","family":"Seipel","sequence":"additional","affiliation":[{"name":"University of W\u00fcrzburg, W\u00fcrzburg, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrik","family":"Simons","sequence":"additional","affiliation":[{"name":"Neotide Oy, Vaasa, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[{"name":"University of Alberta, Alberta, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,1]]},"reference":[{"unstructured":"Babovich Y. 2003. CMODELS---a tool for computing answer sets using SAT solvers. Computer program available online at http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html.]]  Babovich Y. 2003. CMODELS---a tool for computing answer sets using SAT solvers. Computer program available online at http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html.]]","key":"e_1_2_1_1_1"},{"volume-title":"Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages. Springer-Verlag","author":"Balduccini M.","unstructured":"Balduccini , M. , Barry , M. , Gelfond , M. , Nogueira , M. , and Watson , R . 2001. An A-Prolog decision support system for the space shuttle . In Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages. Springer-Verlag , Berlin, Germany, 169--183.]] Balduccini, M., Barry, M., Gelfond, M., Nogueira, M., and Watson, R. 2001. An A-Prolog decision support system for the space shuttle. In Proceedings of the 3rd International Symposium on Practical Aspects of Declarative Languages. Springer-Verlag, Berlin, Germany, 169--183.]]","key":"e_1_2_1_2_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.1016\/S0743-1066(96)00115-X"},{"key":"e_1_2_1_4_1","first-page":"167","article-title":"Semantics of (disjunctive) logic programs based on partial evaluation","volume":"38","author":"Brass S.","year":"1999","unstructured":"Brass , S. and Dix , J. 1999 . Semantics of (disjunctive) logic programs based on partial evaluation . J. Logic Program. 38 , 3, 167 -- 213 .]] Brass, S. and Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. J. Logic Program. 38, 3, 167--213.]]","journal-title":"J. Logic Program."},{"volume-title":"Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning. Springer-Verlag","author":"Buccafurri F.","unstructured":"Buccafurri , F. , Leone , N. , and Rullo , P . 1997. Strong and weak constraints in disjunctive datalog . In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning. Springer-Verlag , Berlin, Germany, 2--17.]] Buccafurri, F., Leone, N., and Rullo, P. 1997. Strong and weak constraints in disjunctive datalog. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning. Springer-Verlag, Berlin, Germany, 2--17.]]","key":"e_1_2_1_5_1"},{"volume-title":"Proceedings of the 15th National Conference on Artificial Intelligence. AAAI, Menlo Park, CA\/MIT Press","author":"Cadoli M.","unstructured":"Cadoli , M. , Giovanardi , A. , and Schaerf , M . 1998. An algorithm to evaluate quantified Boolean formulae . In Proceedings of the 15th National Conference on Artificial Intelligence. AAAI, Menlo Park, CA\/MIT Press , Cambridge, MA, 262--267.]] Cadoli, M., Giovanardi, A., and Schaerf, M. 1998. An algorithm to evaluate quantified Boolean formulae. In Proceedings of the 15th National Conference on Artificial Intelligence. AAAI, Menlo Park, CA\/MIT Press, Cambridge, MA, 262--267.]]","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1016\/0004-3702(95)00046-1"},{"volume-title":"Proceedings of the 4th European Conference on Planning. Springer-Verlag","author":"Dimopoulos Y.","unstructured":"Dimopoulos , Y. , Nebel , B. , and Koehler , J . 1997. Encoding planning problems in non-monotonic logic programs . In Proceedings of the 4th European Conference on Planning. Springer-Verlag , Berlin, Germany, 169--181.]] Dimopoulos, Y., Nebel, B., and Koehler, J. 1997. Encoding planning problems in non-monotonic logic programs. In Proceedings of the 4th European Conference on Planning. Springer-Verlag, Berlin, Germany, 169--181.]]","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1996-281205","article-title":"Reducing disjunctive to nondisjunctive semantics by shift-operations","volume":"28","author":"Dix J.","year":"1996","unstructured":"Dix , J. , Gottlob , G. , and Marek , M. 1996 . Reducing disjunctive to nondisjunctive semantics by shift-operations . Fundamenta Informaticae 28 , 87 -- 100 .]] Dix, J., Gottlob, G., and Marek, M. 1996. Reducing disjunctive to nondisjunctive semantics by shift-operations. Fundamenta Informaticae 28, 87--100.]]","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1016\/0743-1066(95)94697-X"},{"volume-title":"Proceedings of the 1st International Conference on Computational Logic. Springer-Verlag","author":"Eiter T.","unstructured":"Eiter , T. , Faber , W. , Leone , N. , Pfeifer , G. , and Polleres , A . 2000. Planning under incomplete knowledge . In Proceedings of the 1st International Conference on Computational Logic. Springer-Verlag , Berlin, Germany, 807--821.]] Eiter, T., Faber, W., Leone, N., Pfeifer, G., and Polleres, A. 2000. Planning under incomplete knowledge. In Proceedings of the 1st International Conference on Computational Logic. Springer-Verlag, Berlin, Germany, 807--821.]]","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1007\/BF01536399"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.1145\/261124.261126"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1023\/A:1018947420290"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1016\/S0304-3975(97)00129-1"},{"volume-title":"Proceedings of the 6th International Conference on Logic Programming. MIT Press","author":"Eshghi K.","unstructured":"Eshghi , K. and Kowalski , R . 1989. Abduction compared with negation by failure . In Proceedings of the 6th International Conference on Logic Programming. MIT Press , Cambridge, MA, 234--254.]] Eshghi, K. and Kowalski, R. 1989. Abduction compared with negation by failure. In Proceedings of the 6th International Conference on Logic Programming. MIT Press, Cambridge, MA, 234--254.]]","key":"e_1_2_1_16_1"},{"volume-title":"Proceedings of the 5th International Conference on Logic Programming. MIT Press","author":"Gelfond M.","unstructured":"Gelfond , M. and Lifschitz , V . 1988. The stable model semantics for logic programming . In Proceedings of the 5th International Conference on Logic Programming. MIT Press , Cambridge, MA, 1070--1080.]] Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming. MIT Press, Cambridge, MA, 1070--1080.]]","key":"e_1_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1007\/BF03037169"},{"volume-title":"Proceedings of the 16th National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA\/MIT Press","author":"Gent I.","unstructured":"Gent , I. and Walsh , T . 1999. Beyond NP: The QSAT phase transition . In Proceedings of the 16th National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA\/MIT Press , Cambridge, MA, 648--653.]] Gent, I. and Walsh, T. 1999. Beyond NP: The QSAT phase transition. In Proceedings of the 16th National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA\/MIT Press, Cambridge, MA, 648--653.]]","key":"e_1_2_1_19_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/FI-1999-37304","article-title":"Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets","volume":"37","author":"Heljanko K.","year":"1999","unstructured":"Heljanko , K. 1999 . Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets . Fundamenta Informaticae 37 , 3, 247 -- 268 .]] Heljanko, K. 1999. Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37, 3, 247--268.]]","journal-title":"Fundamenta Informaticae"},{"doi-asserted-by":"publisher","key":"e_1_2_1_21_1","DOI":"10.1017\/S1471068403001790"},{"volume-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, A. Cohn, F. Giunchiglia, and S. B., Eds. Morgan Kaufmann","author":"Janhunen T.","unstructured":"Janhunen , T. , Niemel\u00e4 , I. , Simons , P. , and You , J . -H. 2000. Unfolding partiality and disjunctions in stable model semantics . In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, A. Cohn, F. Giunchiglia, and S. B., Eds. Morgan Kaufmann , San Francisco, CA, 411--419.]] Janhunen, T., Niemel\u00e4, I., Simons, P., and You, J.-H. 2000. Unfolding partiality and disjunctions in stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, A. Cohn, F. Giunchiglia, and S. B., Eds. Morgan Kaufmann, San Francisco, CA, 411--419.]]","key":"e_1_2_1_22_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1016\/S0004-3702(03)00078-X"},{"doi-asserted-by":"publisher","key":"e_1_2_1_24_1","DOI":"10.2307\/2024634"},{"key":"e_1_2_1_25_1","volume-title":"et al","author":"Leone N.","year":"2003","unstructured":"Leone , N. et al . 2003 . A disjunctive datalog system DLV ( 2003-05-16). Available online at http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/.]] Leone, N. et al. 2003. A disjunctive datalog system DLV (2003-05-16). Available online at http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/.]]"},{"doi-asserted-by":"publisher","key":"e_1_2_1_26_1","DOI":"10.1145\/1149114.1149117"},{"doi-asserted-by":"publisher","key":"e_1_2_1_27_1","DOI":"10.1006\/inco.1997.2630"},{"doi-asserted-by":"publisher","key":"e_1_2_1_28_1","DOI":"10.5555\/341176.341179"},{"volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence. Morgan Kaufmann","author":"Lin F.","unstructured":"Lin , F. and You , J . 2001. Abduction in logic programming: A new definition and an abductive procedure based on rewriting . In Proceedings of the 17th International Joint Conference on Artificial Intelligence. Morgan Kaufmann , Cambridge, MA, 655--661.]] Lin, F. and You, J. 2001. Abduction in logic programming: A new definition and an abductive procedure based on rewriting. In Proceedings of the 17th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, Cambridge, MA, 655--661.]]","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","volume-title":"ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence","author":"Lin F.","year":"2002","unstructured":"Lin , F. and Zhao , Y . 2002 . ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence . AAAI Press , Menlo Park, CA , 112--117.]] Lin, F. and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proceedings of the 18th National Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA, 112--117.]]"},{"volume-title":"Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, B. Steffen, Ed. Springer-Verlag","author":"Liu X.","unstructured":"Liu , X. , Ramakrishnan , R. , and Smolka , S . 1998. Fully local and efficient evaluation of alternating fixed points . In Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, B. Steffen, Ed. Springer-Verlag , Berlin, Germany, 5--19.]] Liu, X., Ramakrishnan, R., and Smolka, S. 1998. Fully local and efficient evaluation of alternating fixed points. In Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, B. Steffen, Ed. Springer-Verlag, Berlin, Germany, 5--19.]]","key":"e_1_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_32_1","DOI":"10.1145\/116825.116836"},{"doi-asserted-by":"crossref","unstructured":"Marek W. and Truszczy\u0144ski M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Springer-Verlag Berlin Germany 375--398.]]  Marek W. and Truszczy\u0144ski M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective. Springer-Verlag Berlin Germany 375--398.]]","key":"e_1_2_1_33_1","DOI":"10.1007\/978-3-642-60085-2_17"},{"doi-asserted-by":"publisher","key":"e_1_2_1_34_1","DOI":"10.5555\/646887.708953"},{"doi-asserted-by":"publisher","key":"e_1_2_1_35_1","DOI":"10.1023\/A:1018930122475"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the 7th International Conference on Logic Programming. MIT Press","author":"Przymusinski T.","year":"1990","unstructured":"Przymusinski , T. 1990 a. Extended stable semantics for normal and disjunctive logic programs . In Proceedings of the 7th International Conference on Logic Programming. MIT Press , Cambridge, MA, 459--477.]] Przymusinski, T. 1990a. Extended stable semantics for normal and disjunctive logic programs. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, Cambridge, MA, 459--477.]]"},{"doi-asserted-by":"publisher","key":"e_1_2_1_37_1","DOI":"10.5555\/107720.107722"},{"key":"e_1_2_1_38_1","volume-title":"Nonmonotonic Extensions of Logic Programming. Lecture Notes in Computer Science","volume":"927","author":"Ruiz C.","unstructured":"Ruiz , C. and Minker , J . 1995. Computing stable and partial stable models of extended disjunctive logic programs . In Nonmonotonic Extensions of Logic Programming. Lecture Notes in Computer Science , vol. 927 . Springer, Berlin, Germany, 205--229.]] Ruiz, C. and Minker, J. 1995. Computing stable and partial stable models of extended disjunctive logic programs. In Nonmonotonic Extensions of Logic Programming. Lecture Notes in Computer Science, vol. 927. Springer, Berlin, Germany, 205--229.]]"},{"doi-asserted-by":"publisher","key":"e_1_2_1_39_1","DOI":"10.1006\/jcss.1997.1446"},{"doi-asserted-by":"publisher","key":"e_1_2_1_40_1","DOI":"10.1145\/298514.298572"},{"volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, Ed. MIT Press","author":"Sagonas K.","unstructured":"Sagonas , K. , Swift , T. , and Warren , D . 1996. An abstract machine for computing the well-founded semantics . In Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, Ed. MIT Press , Cambridge, MA, 274--288.]] Sagonas, K., Swift, T., and Warren, D. 1996. An abstract machine for computing the well-founded semantics. In Proceedings of the Joint International Conference and Symposium on Logic Programming, M. Maher, Ed. MIT Press, Cambridge, MA, 274--288.]]","key":"e_1_2_1_41_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_42_1","DOI":"10.1016\/S0743-1066(96)00120-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_43_1","DOI":"10.1006\/jcss.1995.1053"},{"volume-title":"International Logic Programming Symposium. MIT Press","author":"Seipel D.","unstructured":"Seipel , D. , Minker , J. , and Ruiz , C . 1997. A characterization of the partial stable models for disjunctive databases . In International Logic Programming Symposium. MIT Press , Cambridge, MA, 245--259.]] Seipel, D., Minker, J., and Ruiz, C. 1997. A characterization of the partial stable models for disjunctive databases. In International Logic Programming Symposium. MIT Press, Cambridge, MA, 245--259.]]","key":"e_1_2_1_44_1"},{"unstructured":"Simons P. and Janhunen T. 2003. GNT1 and GNT2---solvers for disjunctive logic programs. Available on the World Wide Web at http:\/\/www.tcs.hut.fi\/Software\/gnt\/.]]  Simons P. and Janhunen T. 2003. GNT1 and GNT2---solvers for disjunctive logic programs. Available on the World Wide Web at http:\/\/www.tcs.hut.fi\/Software\/gnt\/.]]","key":"e_1_2_1_45_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_46_1","DOI":"10.1016\/S0004-3702(02)00187-X"},{"unstructured":"Simons P. and Syrj\u00e4nen T. 2003. SMODELS (version 2.27) and LPARSE (version 1.0.13)---a solver and a grounder for normal logic programs. Available on the World Wide Web at http:\/\/www.tcs.hut.fi\/Software\/smodels\/.]]  Simons P. and Syrj\u00e4nen T. 2003. SMODELS (version 2.27) and LPARSE (version 1.0.13)---a solver and a grounder for normal logic programs. Available on the World Wide Web at http:\/\/www.tcs.hut.fi\/Software\/smodels\/.]]","key":"e_1_2_1_47_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_48_1","DOI":"10.1016\/0304-3975(76)90061-X"},{"doi-asserted-by":"publisher","key":"e_1_2_1_49_1","DOI":"10.1145\/800125.804029"},{"doi-asserted-by":"publisher","key":"e_1_2_1_50_1","DOI":"10.5555\/647482.728266"},{"doi-asserted-by":"publisher","key":"e_1_2_1_51_1","DOI":"10.1016\/S0022-0000(05)80053-4"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1119439.1119440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1119439.1119440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:18Z","timestamp":1750262898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1119439.1119440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1]]}},"alternative-id":["10.1145\/1119439.1119440"],"URL":"https:\/\/doi.org\/10.1145\/1119439.1119440","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2006,1]]},"assertion":[{"value":"2006-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}