{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:22Z","timestamp":1725575242380},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_20","type":"book-chapter","created":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T03:31:31Z","timestamp":1294975891000},"page":"220-233","source":"Crossref","is-referenced-by-count":3,"title":["Improving the Model Generation\/Checking Interplay to Enhance the Evaluation of Disjunctive Programs"],"prefix":"10.1007","author":[{"given":"Gerald","family":"Pfeifer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Babovich, Y.: Cmodels homepage, http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html"},{"key":"20_CR2","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2002","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2002)"},{"key":"20_CR3","unstructured":"Calimeri, F., Faber, W., Leone, N., Pfeifer, G.: Pruning Operators for Answer Set Programming Systems. In: NMR 2002, April 2002, pp. 200\u2013209 (2002)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time Algorithms for Testing the Satisfability of Propositional Horn Formulae. JLP\u00a03, 267\u2013284 (1984)","journal-title":"JLP"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. JACM\u00a07, 201\u2013215 (1960)","journal-title":"JACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: A Logic Programming Approach to Knowledge-State Planning: Semantics and Complexity. To appear in ACM TOCL (2003)","DOI":"10.1145\/976706.976708"},{"issue":"3\/4","key":"20_CR7","first-page":"289","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the Computational Cost of Disjunctive Logic Programming: Propositional Case. AMAI\u00a015(3\/4), 289\u2013323 (1995)","journal-title":"AMAI"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM TODS\u00a022(3), 364\u2013418 (1997)","journal-title":"ACM TODS"},{"key":"20_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/BFb0055998","volume-title":"Flexible Query Answering Systems","author":"T. Eiter","year":"1998","unstructured":"Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: Progress Report on the Disjunctive Deductive Database System dlv. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol.\u00a01495, pp. 148\u2013163. Springer, Heidelberg (1998)"},{"key":"20_CR10","series-title":"Lecture Notes in Artificial Intelligence","first-page":"402","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D. East","year":"2001","unstructured":"East, D., Truszczy\u0144ski, M.: aspps \u2013 An Implementation of Answer-Set Programming with Propositional Schemata. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 402\u2013405. Springer, Heidelberg (2001)"},{"key":"20_CR11","first-page":"635","volume-title":"IJCAI 2001","author":"W. Faber","year":"2001","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Experimenting with Heuristics for Answer Set Programming. In: IJCAI 2001, pp. 635\u2013640. Morgan Kaufmann, San Francisco (2001)"},{"key":"20_CR12","unstructured":"Faber, W., Pfeifer, G.: DLV homepage (since 1996), http:\/\/www.dlvsystem.com\/"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"20_CR14","unstructured":"Gent, I., Walsh, T.: The QSAT Phase Transition. In: AAAI (1999)"},{"key":"20_CR15","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.-H.: Unfolding Partiality and Disjunctions in Stable Model Semantics. Tech. Report cs.AI\/0303009, arXiv.org"},{"key":"20_CR16","first-page":"411","volume-title":"KR 2000","author":"T. Janhunen","year":"2000","unstructured":"Janhunen, T., Niemel\u00e4, I., Simons, P., You, J.-H.: Partiality and Disjunctions in Stable Model Semantics. In: KR 2000, April 12-15, pp. 411\u2013419. Morgan Kaufmann, San Francisco (2000)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Koch, C., Leone, N., Pfeifer, G.: Using SAT Checkers for Disjunctive Logic Programming Systems. Artificial Intelligence (2003) (to appear)","DOI":"10.1016\/S0004-3702(03)00078-X"},{"key":"20_CR18","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"V. Lifschitz","year":"1996","unstructured":"Lifschitz, V.: Foundations of Logic Programming. In: Principles of Knowledge Representation, pp. 69\u2013127. CSLI Publications, Stanford (1996)"},{"key":"20_CR19","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. Tech. Report cs.AI\/0211004, arXiv.org (November 2002) (submitted to ACM TOCL)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Leone, N., Rullo, P., Scarcello, F.: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation\u00a0135(2), 69\u2013112","DOI":"10.1006\/inco.1997.2630"},{"key":"20_CR21","unstructured":"Leone, N., Rosati, R., Scarcello, F.: Enhancing Answer Set Planning. In: IJCAI 2001, Workshop on Planning under Uncertainty and Incomplete Information, pp. 33\u201342 (2001)"},{"key":"20_CR22","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: AAAI 2002. AAAI Press \/ MIT Press (2002)"},{"key":"20_CR23","unstructured":"McCain, N.: The Causal Calculator (1999), http:\/\/www.cs.utexas.edu\/users\/tag\/cc\/"},{"key":"20_CR24","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"20_CR25","doi-asserted-by":"crossref","first-page":"445","DOI":"10.3233\/FI-1990-13404","volume":"13","author":"T.C. Przymusinski","year":"1990","unstructured":"Przymusinski, T.C.: Well-founded Semantics Coincides with Three-valued Stable Semantics. Fundamenta Informaticae\u00a013, 445\u2013464 (1990)","journal-title":"Fundamenta Informaticae"},{"key":"20_CR26","unstructured":"Simons, P.: Smodels Homepage (since 1996), http:\/\/www.tcs.hut.fi\/Software\/smodels\/"},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and Implementing the Stable Model Semantics. Artificial Intelligence\u00a0138, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"20_CR28","unstructured":"Syrj\u00e4nen, T.: Lparse User\u2019s Manual (2002), http:\/\/www.tcs.hut.fi\/Software\/smodels\/"},{"key":"20_CR29","unstructured":"Zhao, Y.: ASSAT homepage, http:\/\/assat.cs.ust.hk\/"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T10:16:52Z","timestamp":1637144212000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}