{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:53:28Z","timestamp":1794336808645,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540628439","type":"print"},{"value":"9783540687023","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023808","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:12:36Z","timestamp":1132366356000},"page":"202-224","source":"Crossref","is-referenced-by-count":4,"title":["Computation of non-ground disjunctive well-founded semantics with constraint logic programming"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Dix","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frieder","family":"Stolzenburg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF03038308","volume":"13","author":"C. Aravindan","year":"1994","unstructured":"Chandrabose Aravindan and Phan Minh Dung. Partial deduction of logic programs wrt well-founded semantics. New Generation Computing, 13:45\u201374, 1994.","journal-title":"New Generation Computing"},{"key":"10_CR2","volume-title":"Technical Report TR 1\/97","author":"C. Aravindan","year":"1997","unstructured":"Chandrabose Aravindan, J\u00fcrgen Dix, and Ilkka Niemel\u00e4. The DisLoP-project. Technical Report TR 1\/97, University of Koblenz, Department of Computer Science, Rheinau 1, January 1997."},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-642-51136-3_13","volume-title":"Innovationen bei Rechen-und Kommunikationssystemen","author":"S. Brass","year":"1994","unstructured":"Stefan Brass and J\u00fcrgen Dix. A disjunctive semantics based on unfolding and bottom-up evaluation. In Bernd Wolfinger, editor, Innovationen bei Rechen-und Kommunikationssystemen, (IFIP '94-Congress, Workshop FG2: Disjunctive Logic Programming and Disjunctive Databases), pages 83\u201391, Berlin, 1994. Springer."},{"key":"10_CR4","series-title":"LNAI 927","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0030663","volume-title":"Nonmonotonic Extensions of Logic Programming","author":"S. Brass","year":"1995","unstructured":"Stefan Brass and J\u00fcrgen Dix. A General Approach to Bottom-Up Computation of Disjunctive Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 127\u2013155. Springer, Berlin, 1995."},{"key":"10_CR5","first-page":"199","volume-title":"Disjunctive Semantics based upon Partial and Bottom-Up Evaluation","author":"S. Brass","year":"1995","unstructured":"Stefan Brass and J\u00fcrgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo, pages 199\u2013213. MIT Press, June 1995."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Stefan Brass and J\u00fcrgen Dix. Characterizing D-WFS: Confluence and Iterated GCWA. In L.M. Pereira J.J. Alferes and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 268\u2013283. Springer, 1996. (Extended version will appear in the Journal of Automated Reasoning in 1997.).","DOI":"10.1007\/3-540-61630-6_19"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Stefan Brass and J\u00fcrgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, forthcoming, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85\u201398, 1995. Springer.).","DOI":"10.1016\/S0743-1066(96)00115-X"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Stefan Brass and J\u00fcrgen Dix. Semantics of Disjunctive Logic Programs Based on Partial Evaluation. Journal of Logic Programming, accepted for publication, 1997. (Extended abstract appeared in: Disjunctive Semantics Based upon Partial and Bottom-Up Evaluation, Proceedings of the 12-th International Logic Programming Conference, Tokyo, pages 199\u2013213, 1995. MIT Press.).","DOI":"10.7551\/mitpress\/4298.003.0027"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/S0747-7171(89)80017-3","volume":"7","author":"H. Comon","year":"1989","unstructured":"Hubert Comon and Pierre Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7:371\u2013425, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR10","first-page":"3","volume-title":"Logic programming and its applications","author":"A. Colmerauer","year":"1986","unstructured":"Alain Colmerauer. Theoretical model of Prolog II. In Michel van Canegham and David H.D. Warren, editors, Logic programming and its applications, pages 3\u201331. Ablex Publishing Corporation, Norwood, NJ, 1986."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0743-1066(94)00028-5","volume":"24","author":"W. Chen","year":"1995","unstructured":"Weidong Chen, Terrance Swift, and David S. Warren. Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming, 24(3):219\u2013245, 1995.","journal-title":"Journal of Logic Programming"},{"key":"10_CR12","first-page":"279","volume":"17","author":"W. Chen","year":"1995","unstructured":"Weidong Chen and David S. Warren. Computing of Stable Models and its Integration with Logical Query Processing. IEEE Transactions on Knowledge and Data Engineering, 17:279\u2013300, 1995.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/227595.227597","volume":"43","author":"W. Chen","year":"1996","unstructured":"Weidong Chen and David S. Warren. Tabled Evaluation with Delaying for General Logic Programs. Journal of the ACM, 43(1):20\u201374, January 1996.","journal-title":"Journal of the ACM"},{"key":"10_CR14","first-page":"89","volume":"2","author":"J. Dix","year":"1996","unstructured":"J. Dix and U. Furbach. The DFG-Project DisLoP on Disjunctive Logic Programming. Computational Logic, 2:89\u201390, 1996.","journal-title":"Computational Logic"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"J\u00fcrgen Dix, Donald Loveland, Jack Minker, and David. S. Warren. Disjunctive Logic Programming and databases: Nonmonotonic Aspects. Technical Report Dagstuhl Seminar Report 150, IBFI GmbH, Schlo\u00df Dagstuhl, 1996.","DOI":"10.1007\/3-540-63255-7"},{"key":"10_CR16","unstructured":"ECRC GmbH, M\u00fcnchen. ECLiPSe 3.5: User Manual \u2014 Extensions User Manual, 1995."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob, J. Lu, and V. S. Subrahmanian. Computing Non-Ground Representations of Stable Models. Technical report, University of Maryland, 1996.","DOI":"10.1007\/3-540-63255-7_14"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19","author":"J. Jaffar","year":"1994","unstructured":"Joxan Jaffar and Michael J. Maher. Constraint logic programming: a survey. Journal of Logic Programming, 19, 20:503\u2013581, 1994.","journal-title":"Journal of Logic Programming"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(94)00216-9","volume":"155","author":"V. Kagan","year":"1995","unstructured":"Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing Minimal Models by Partial Instantiation. Theoretical Computer Science, 155:157\u2013177, 1995.","journal-title":"Theoretical Computer Science"},{"key":"10_CR20","unstructured":"David B. Kemp, Peter J. Stuckey, and Divesh Srivastava. Magic Sets and Bottom-Up Evaluation of Well-Founded Models. In Vijay Saraswat and Kazunori Ueda, editors, Proceedings of the 1991 Int. Symposium on Logic Programming, pages 337\u2013351. MIT, June 1991."},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Michael J. Maher. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, pages 348\u2013359. Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5132"},{"key":"10_CR22","first-page":"737","volume-title":"A logic programming view of CLP","author":"M. J. Maher","year":"1993","unstructured":"Michael J. Maher. A logic programming view of CLP. In David S. Warren, editor, Proceedings of the 10th International Conference on Logic Programming, pages 737\u2013753. MIT Press, Cambridge, MA, London, England, 1993. Budapest, 1993."},{"key":"10_CR23","series-title":"LNCS 883","first-page":"170","volume-title":"Logic Program Synthesis and Transformation \u2014 Meta Programming in Logic","author":"C. Sakama","year":"1995","unstructured":"Chiaki Sakama and Hirohisa Seki. Partial Deduction of Disjunctive Logic Programs: A Declarative Approach. In Logic Program Synthesis and Transformation \u2014 Meta Programming in Logic, LNCS 883, pages 170\u2013182, Berlin, 1995. Springer. Extended version to appear in Journal of Logic Programming."},{"key":"10_CR24","first-page":"269","volume-title":"Analysing rule sets for the calculation of banking fees by a theorem prover with constraints","author":"F. Stolzenburg","year":"1996","unstructured":"Frieder Stolzenburg and Bernd Thomas. Analysing rule sets for the calculation of banking fees by a theorem prover with constraints. In Proceedings of the 2nd International Conference on Practical Application of Constraint Technology, pages 269\u2013282, London, 1996. Practical Application Company."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Peter J. Stuckey. Constructive negation for constraint logic programming. In Proceedings of the 6th Annual Symposium on Logic in Computer Science, pages 328\u2013339, 1991.","DOI":"10.1109\/LICS.1991.151657"}],"container-title":["Lecture Notes in Computer Science","Non-Monotonic Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T18:00:30Z","timestamp":1706724030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628439","9783540687023"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0023808","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0023798","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}