{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T20:08:09Z","timestamp":1785528489702,"version":"3.56.0"},"reference-count":104,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"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,7]]},"abstract":"<jats:p>\n            Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express\n            <jats:italic>every<\/jats:italic>\n            property of finite structures that is decidable in the complexity class \u03a3\n            <jats:sup>\n              <jats:italic>P<\/jats:italic>\n            <\/jats:sup>\n            <jats:sub>2<\/jats:sub>\n            (NP\n            <jats:sup>NP<\/jats:sup>\n            ). Thus, under widely believed assumptions, DLP is strictly more expressive than\n            <jats:italic>normal<\/jats:italic>\n            (\n            <jats:italic>disjunction-free<\/jats:italic>\n            ) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing problems of lower complexity in a simpler and more natural fashion.This article presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as\n            <jats:italic>disjunctive datalog<\/jats:italic>\n            ), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to \u0394\n            <jats:sup>\n              <jats:italic>P<\/jats:italic>\n            <\/jats:sup>\n            <jats:sub>3<\/jats:sub>\n            -complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof.Furthermore, we illustrate the general architecture of the DLV system, which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.\n          <\/jats:p>","DOI":"10.1145\/1149114.1149117","type":"journal-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T18:11:32Z","timestamp":1161195092000},"page":"499-562","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":666,"title":["The DLV system for knowledge representation and reasoning"],"prefix":"10.1145","volume":"7","author":[{"given":"Nicola","family":"Leone","sequence":"first","affiliation":[{"name":"University of Calabria, Rende (CS), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gerald","family":"Pfeifer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Faber","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Eiter","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simona","family":"Perri","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende (CS), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francesco","family":"Scarcello","sequence":"additional","affiliation":[{"name":"University of Calabria, Rende (CS), Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2006,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01)","volume":"2173","author":"Anger C.","unstructured":"Anger , C. , Konczak , K. , and Linke , T . 2001. NoMoRe: A system for non-monotonic reasoning . In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01) , Vienna, Austria, T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence , vol. 2173 . Springer, Berlin, Germany, 406--410.]] Anger, C., Konczak, K., and Linke, T. 2001. NoMoRe: A system for non-monotonic reasoning. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Vienna, Austria, T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 2173. Springer, Berlin, Germany, 406--410.]]"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90024-8"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Apt K. R. Blair H. A. and Walker A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker Ed. Morgan Kaufmann San Francisco CA 89--148.]]   Apt K. R. Blair H. A. and Walker A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker Ed. Morgan Kaufmann San Francisco CA 89--148.]]","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"e_1_2_1_4_1","article-title":"Dislop: A research project on disjunctive logic programming","volume":"10","author":"Aravindan C.","year":"1997","unstructured":"Aravindan , C. , Dix , J. , and Niemel\u00e4 , I. 1997 . Dislop: A research project on disjunctive logic programming . AI Commun. Europ. J. Artific. Intell. 10 , 3\/4, 151--165.]] Aravindan, C., Dix, J., and Niemel\u00e4, I. 1997. Dislop: A research project on disjunctive logic programming. AI Commun. Europ. J. Artific. Intell. 10, 3\/4, 151--165.]]","journal-title":"AI Commun. Europ. J. Artific. Intell."},{"key":"e_1_2_1_5_1","unstructured":"Babovich Y. 2002. Cmodels homepage. http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html.]]  Babovich Y. 2002. Cmodels homepage. http:\/\/www.cs.utexas.edu\/users\/tag\/cmodels.html.]]"},{"key":"e_1_2_1_6_1","volume-title":"Reasoning and Declarative Problem Solving","author":"Baral C.","unstructured":"Baral , C. 2003. Knowledge Representation , Reasoning and Declarative Problem Solving . Cambridge University Press , Cambridge , U.K.]] Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, U.K.]]"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90025-6"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530761"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94)","author":"Ben-Eliyahu R.","unstructured":"Ben-Eliyahu , R. and Palopoli , L . 1994. Reasoning with minimal models: Efficient algorithms and applications . In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94) . 39--50.]] Ben-Eliyahu, R. and Palopoli, L. 1994. Reasoning with minimal models: Efficient algorithms and applications. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94). 39--50.]]"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 12th International Conference on Logic Programm.","author":"Brass S.","unstructured":"Brass , S. and Dix , J . 1995. Disjunctive semantics based upon partial and bottom-up evaluation . In Proceedings of the 12th International Conference on Logic Programm. , Tokyo, Japan, L. Sterling, Ed. MIT Press, Cambridge, MA, 199--213.]] Brass, S. and Dix, J. 1995. Disjunctive semantics based upon partial and bottom-up evaluation. In Proceedings of the 12th International Conference on Logic Programm., Tokyo, Japan, L. Sterling, Ed. MIT Press, Cambridge, MA, 199--213.]]"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00015-6"},{"key":"e_1_2_1_12_1","volume-title":"(organizers)","author":"Brewka G.","year":"2002","unstructured":"Brewka , G. , Niemel\u00e4 , I. , Schaub , T. , and Truszczy\u0144ski , M . (organizers) . 2002 . Dagstuhl Seminar Nr. 0238, Nonmonotonic Reasoning, Answer Set Programming and Constraints, September 15--20, 2002. System Competition. Go online to http:\/\/www.cs.uni-potsdam.de\/~canger\/dagstuhl.html.]] Brewka, G., Niemel\u00e4, I., Schaub, T., and Truszczy\u0144ski, M. (organizers). 2002. Dagstuhl Seminar Nr. 0238, Nonmonotonic Reasoning, Answer Set Programming and Constraints, September 15--20, 2002. System Competition. Go online to http:\/\/www.cs.uni-potsdam.de\/~canger\/dagstuhl.html.]]"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001394"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.877512"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.599933"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence (AI&ast;IA 97)","author":"Cadoli M.","unstructured":"Cadoli , M. , Giovanardi , A. , and Schaerf , M . 1997b. Experimental analysis of the computational cost of evaluating quantified boolean formulae . In Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence (AI&ast;IA 97) , Rome, Italy. Lecture Notes in Computer Science 1321, Springer, Berlin, Germany, 207--218.]] Cadoli, M., Giovanardi, A., and Schaerf, M. 1997b. Experimental analysis of the computational cost of evaluating quantified boolean formulae. In Proceedings of the 5th Congress of the Italian Association for Artificial Intelligence (AI&ast;IA 97), Rome, Italy. Lecture Notes in Computer Science 1321, Springer, Berlin, Germany, 207--218.]]"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002)","author":"Calimeri F.","unstructured":"Calimeri , F. , Faber , W. , Leone , N. , and Pfeifer , G . 2002. Pruning operators for answer set programming systems . In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002) . 200--209.]] Calimeri, F., Faber, W., Leone, N., and Pfeifer, G. 2002. Pruning operators for answer set programming systems. In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002). 200--209.]]"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.542027"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00053-3"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR '96)","author":"Cholewi\u0144ski P.","unstructured":"Cholewi\u0144ski , P. , Marek , V. W. , and Truszczy\u0144ski , M . 1996. Default reasoning system DeReS . In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR '96) , Cambridge, MA. Morgan Kaufmann, San Francisco, CA, 518--528.]] Cholewi\u0144ski, P., Marek, V. W., and Truszczy\u0144ski, M. 1996. Default reasoning system DeReS. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR '96), Cambridge, MA. Morgan Kaufmann, San Francisco, CA, 518--528.]]"},{"key":"e_1_2_1_21_1","volume-title":"Negation as failure","author":"Clark K.","unstructured":"Clark , K. 1978. Negation as failure . In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press , New York, NY , 293--322.]] Clark, K. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, 293--322.]]"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01)","volume":"2173","author":"Delgrande J.","unstructured":"Delgrande , J. , Schaub , T. , and Tompits , H . 2001. plp: A generic compiler for ordered logic programs . In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01) , T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science , vol. 2173 , Springer, Berlin, Germany, 411--415.]] Delgrande, J., Schaub, T., and Tompits, H. 2001. plp: A generic compiler for ordered logic programs. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-01), T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science, vol. 2173, Springer, Berlin, Germany, 411--415.]]"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI","author":"Dell'Armi T.","year":"2003","unstructured":"Dell'Armi , T. , Faber , W. , Ielpa , G. , Leone , N. , and Pfeifer , G . 2003. Aggregate functions in disjunctive logic programm: Semantics, complexity, and implementation in DLV . In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003 ), Acapulco, Mexico. Morgan Kaufmann, San Francisco, CA.]] Dell'Armi, T., Faber, W., Ielpa, G., Leone, N., and Pfeifer, G. 2003. Aggregate functions in disjunctive logic programm: Semantics, complexity, and implementation in DLV. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), Acapulco, Mexico. Morgan Kaufmann, San Francisco, CA.]]"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Konstanz Colloquium in Logic and Information (LogIn'92)","author":"Dix J.","year":"1995","unstructured":"Dix , J. 1995 . Semantics of logic programs: Their intuitions and formal properties. An overview. In Logic, Action and Information . Proceedings of the Konstanz Colloquium in Logic and Information (LogIn'92) . Walter de Gruyter, Berlin, Germany, 241--329.]] Dix, J. 1995. Semantics of logic programs: Their intuitions and formal properties. An overview. In Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn'92). Walter de Gruyter, Berlin, Germany, 241--329.]]"},{"key":"e_1_2_1_26_1","first-page":"89","article-title":"The DFG project DisLoP on disjunctive logic programming","volume":"2","author":"Dix J.","year":"1996","unstructured":"Dix , J. and Furbach , U. 1996 . The DFG project DisLoP on disjunctive logic programming . Computat. Logic 2 , 2, 89 -- 90 .]] Dix, J. and Furbach, U. 1996. The DFG project DisLoP on disjunctive logic programming. Computat. Logic 2, 2, 89--90.]]","journal-title":"Computat. Logic"},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1996-281205","article-title":"Reducing disjunctive to non-disjunctive semantics by shift-operations","volume":"28","author":"Dix J.","year":"1996","unstructured":"Dix , J. , Gottlob , G. , and Marek , V. W. 1996 . Reducing disjunctive to non-disjunctive semantics by shift-operations . Fundamenta Informaticae 28 , 87 -- 100 .]] Dix, J., Gottlob, G., and Marek, V. W. 1996. Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae 28, 87--100.]]","journal-title":"Fundamenta Informaticae"},{"key":"e_1_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Dix J. Kuter U. and Nau D. 2002. Planning in answer set programming using ordered task decomposition. Theo. Pract. Logic Programm. Revised paper submitted for publication.]]  Dix J. Kuter U. and Nau D. 2002. Planning in answer set programming using ordered task decomposition. Theo. Pract. Logic Programm. Revised paper submitted for publication.]]","DOI":"10.1007\/978-3-540-39451-8_36"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000)","author":"East D.","unstructured":"East , D. and Truszczy\u0144ski , M . 2000. dcs: An implementation of DATALOG with constraints . In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000) , Breckenridge, Colorado, USA, C. Baral and M. Truszczy\u0144ski, Eds.]] East, D. and Truszczy\u0144ski, M. 2000. dcs: An implementation of DATALOG with constraints. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000), Breckenridge, Colorado, USA, C. Baral and M. Truszczy\u0144ski, Eds.]]"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01)","volume":"2173","author":"East D.","unstructured":"East , D. and Truszczy\u0144ski , M . 2001a. System description: aspps---An implementation of answer-set programming with propositional schemata . In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01) , Vienna, Austria, T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Artificial Intelligence , vol. 2173 . Springer, Berlin, Germany, 402--405.]] East, D. and Truszczy\u0144ski, M. 2001a. System description: aspps---An implementation of answer-set programming with propositional schemata. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Vienna, Austria, T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Artificial Intelligence, vol. 2173. Springer, Berlin, Germany, 402--405.]]"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the Joint German\/Austrian Conference on Artificial Intelligence, KI'2001","volume":"2174","author":"East D.","unstructured":"East , D. and Truszczy\u0144ski , M . 2001b. Propositional satisfiability in answer-set programming . In Proceedings of the Joint German\/Austrian Conference on Artificial Intelligence, KI'2001 . Lecture Notes in Arificial Intelligence , vol. 2174 . Springer Verlag, Berlin, Germany, 138--153.]] East, D. and Truszczy\u0144ski, M. 2001b. Propositional satisfiability in answer-set programming. In Proceedings of the Joint German\/Austrian Conference on Artificial Intelligence, KI'2001. Lecture Notes in Arificial Intelligence, vol. 2174. Springer Verlag, Berlin, Germany, 138--153.]]"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'00)","author":"Egly U.","year":"2000","unstructured":"Egly , U. , Eiter , T. , Tompits , H. , and Woltran , S . 2000. Solving advanced reasoning tasks using quantified boolean formulas . In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'00) , July 30 -- August 3, 2000 , Austin, Texas USA. AAAI Press Stanford, CA\/MIT Press, Cambridge, MA, 417--422.]] Egly, U., Eiter, T., Tompits, H., and Woltran, S. 2000. Solving advanced reasoning tasks using quantified boolean formulas. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI'00), July 30--August 3, 2000, Austin, Texas USA. AAAI Press Stanford, CA\/MIT Press, Cambridge, MA, 417--422.]]"},{"key":"e_1_2_1_33_1","volume-title":"Workshop on Logic-Based Artificial Intelligence","author":"Eiter T.","unstructured":"Eiter , T. , Faber , W. , Gottlob , G. , Koch , C. , Leone , N. , Mateis , C. , Pfeifer , G. , and Scarcello , F . 1999. The DLV system . In Workshop on Logic-Based Artificial Intelligence , Washington, DC, J. Minker, Ed. Computer Science Department, University of Maryland, College Park, MD. Workshop notes.]] Eiter, T., Faber, W., Gottlob, G., Koch, C., Leone, N., Mateis, C., Pfeifer, G., and Scarcello, F. 1999. The DLV system. In Workshop on Logic-Based Artificial Intelligence, Washington, DC, J. Minker, Ed. Computer Science Department, University of Maryland, College Park, MD. Workshop notes.]]"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Eiter T. Faber W. Leone N. and Pfeifer G. 2000a. Declarative problem-solving using the DLV system. In Logic-Based Artificial Intelligence J. Minker Ed. Kluwer Academic Press New York NY 79--103.]]   Eiter T. Faber W. Leone N. and Pfeifer G. 2000a. Declarative problem-solving using the DLV system. In Logic-Based Artificial Intelligence J. Minker Ed. Kluwer Academic Press New York NY 79--103.]]","DOI":"10.1007\/978-1-4615-1567-8_4"},{"key":"e_1_2_1_35_1","volume-title":"Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, A. Provetti and S. T. Cao, Eds. AAAI Press","author":"Eiter T.","unstructured":"Eiter , T. , Faber , W. , Leone , N. , and Pfeifer , G . 2001a. Computing preferred and weakly preferred answer sets by meta-interpretation in answer set programming . In Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, A. Provetti and S. T. Cao, Eds. AAAI Press , Stanford, CA, 45--52.]] Eiter, T., Faber, W., Leone, N., and Pfeifer, G. 2001a. Computing preferred and weakly preferred answer sets by meta-interpretation in answer set programming. In Proceedings of the AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, A. Provetti and S. T. Cao, Eds. AAAI Press, Stanford, CA, 45--52.]]"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001753"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the First International Conference on Computational Logic (CL","volume":"1861","author":"Eiter T.","year":"2000","unstructured":"Eiter , T. , Faber , W. , Leone , N. , Pfeifer , G. , and Polleres , A . 2000b. Planning under incomplete knowledge . In Proceedings of the First International Conference on Computational Logic (CL 2000 ), London, UK, J. Lloyd et al., Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence , vol. 1861 . Springer, Berlin, Germany, 807--821.]] Eiter, T., Faber, W., Leone, N., Pfeifer, G., and Polleres, A. 2000b. Planning under incomplete knowledge. In Proceedings of the First International Conference on Computational Logic (CL 2000), London, UK, J. Lloyd et al., Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 1861. Springer, Berlin, Germany, 807--821.]]"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/976706.976708"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00367-3"},{"key":"e_1_2_1_40_1","volume-title":"Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science","volume":"2424","author":"Eiter T.","unstructured":"Eiter , T. , Faber , W. , Leone , N. , Pfeifer , G. , and Polleres , A . 2002b. Answer set planning under action costs . In Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science , vol. 2424 , Springer, Berlin, Germany, 186--197.]] Eiter, T., Faber, W., Leone, N., Pfeifer, G., and Polleres, A. 2002b. Answer set planning under action costs. In Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science, vol. 2424, Springer, Berlin, Germany, 186--197.]]"},{"key":"e_1_2_1_41_1","volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01)","author":"Eiter T.","year":"1843","unstructured":"Eiter , T. , Fink , M. , Sabbatini , G. , and Tompits , H . 2001d. A framework for declarative update specifications in logic programs . In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01) , B. Nebel, Ed. Morgan Kaufmann, San Francisco, CA, 649--654. See also Tech. rep. INFSYS RR- 1843 -02-07, TU Wien, Vienna, Austria, 2002.]] Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2001d. A framework for declarative update specifications in logic programs. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), B. Nebel, Ed. Morgan Kaufmann, San Francisco, CA, 649--654. See also Tech. rep. INFSYS RR-1843-02-07, TU Wien, Vienna, Austria, 2002.]]"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the 6th International Conference on Logic Programm. and Nonmonotonic Reasoning (LPNMR-01)","volume":"2173","author":"Eiter T.","unstructured":"Eiter , T. , Fink , M. , Sabbatini , G. , and Tompits , H . 2001e. An update front-end for extended logic programs . In Proceedings of the 6th International Conference on Logic Programm. and Nonmonotonic Reasoning (LPNMR-01) , T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science , vol. 2173 . Springer, Berlin, Germany, 397--401.]] Eiter, T., Fink, M., Sabbatini, G., and Tompits, H. 2001e. An update front-end for extended logic programs. In Proceedings of the 6th International Conference on Logic Programm. and Nonmonotonic Reasoning (LPNMR-01), T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science, vol. 2173. Springer, Berlin, Germany, 397--401.]]"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001247"},{"key":"e_1_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Eiter T. and Gottlob G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artificial Intelligence 15 3\/4 289--323.]]  Eiter T. and Gottlob G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artificial Intelligence 15 3\/4 289--323.]]","DOI":"10.1007\/BF01536399"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00179-X"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261126"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98)","author":"Eiter T.","unstructured":"Eiter , T. , Leone , N. , Mateis , C. , Pfeifer , G. , and Scarcello , F . 1998a. The KR System dlv: Progress report, comparisons and benchmarks . In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98) , A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 406--417.]] Eiter, T., Leone, N., Mateis, C., Pfeifer, G., and Scarcello, F. 1998a. The KR System dlv: Progress report, comparisons and benchmarks. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 406--417.]]"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018947420290"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00129-1"},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP'99)","author":"Faber W.","unstructured":"Faber , W. , Leone , N. , Mateis , C. , and Pfeifer , G . 1999. Using database optimization techniques for nonmonotonic reasoning . In Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP'99) , I. O. Committee, Ed. Prolog Association of Japan, Tokyo, Japan, 135--139.]] Faber, W., Leone, N., Mateis, C., and Pfeifer, G. 1999. Using database optimization techniques for nonmonotonic reasoning. In Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming (DDLP'99), I. O. Committee, Ed. Prolog Association of Japan, Tokyo, Japan, 135--139.]]"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI","author":"Faber W.","year":"2001","unstructured":"Faber , W. , Leone , N. , and Pfeifer , G . 2001. Experimenting with heuristics for answer set programming . In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001 ), Seattle, WA, USA. Morgan Kaufmann, San Francisco, CA, 635--640.]] Faber, W., Leone, N., and Pfeifer, G. 2001. Experimenting with heuristics for answer set programming. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, USA. Morgan Kaufmann, San Francisco, CA, 635--640.]]"},{"key":"e_1_2_1_52_1","unstructured":"Faber W. and Pfeifer G. 1996. DLV homepage. Go to http:\/\/www.dlvsystem.com\/.]]  Faber W. and Pfeifer G. 1996. DLV homepage. Go to http:\/\/www.dlvsystem.com\/.]]"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the 4th International Conference on Database Theory (ICDT-92)","author":"Fern\u00e1ndez J.","unstructured":"Fern\u00e1ndez , J. and Minker , J . 1992. Semantics of disjunctive deductive databases . In Proceedings of the 4th International Conference on Database Theory (ICDT-92) . 21--50.]] Fern\u00e1ndez, J. and Minker, J. 1992. Semantics of disjunctive deductive databases. In Proceedings of the 4th International Conference on Database Theory (ICDT-92). 21--50.]]"},{"key":"e_1_2_1_54_1","volume-title":"Logic Programming: Proceedings of the Fifth International Conference and Symposium. MIT Press","author":"Gelfond M.","unstructured":"Gelfond , M. and Lifschitz , V . 1988. The stable model semantics for logic programming . In Logic Programming: Proceedings of the Fifth International Conference and Symposium. MIT Press , Cambridge, MA, 1070--1080.]] Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming: Proceedings of the Fifth International Conference and Symposium. MIT Press, Cambridge, MA, 1070--1080.]]"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"e_1_2_1_56_1","first-page":"3","article-title":"Action languages","volume":"2","author":"Gelfond M.","year":"1998","unstructured":"Gelfond , M. and Lifschitz , V. 1998 . Action languages . Electron. Trans. Artificial Intelligence 2 , 3 - 4 , 193--210.]] Gelfond, M. and Lifschitz, V. 1998. Action languages. Electron. Trans. Artificial Intelligence 2, 3-4, 193--210.]]","journal-title":"Electron. Trans. Artificial Intelligence"},{"key":"e_1_2_1_57_1","volume-title":"Proceedings of the 16th National Conference on Artificial Intelligence (AAAI\/IAAI","author":"Gent I.","year":"1999","unstructured":"Gent , I. and Walsh , T . 1999. Beyond NP: The QSAT phase transition . In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI\/IAAI 1999 ), Orlando, Florida, USA. AAAI Press, Stanford, 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\/IAAI 1999), Orlando, Florida, USA. AAAI Press, Stanford, CA\/MIT Press, Cambridge, MA, 648--653.]]"},{"key":"e_1_2_1_58_1","volume-title":"Proceedings of the 15th National Conference on Artificial Intelligence (AAAI '98)","author":"Giunchiglia E.","unstructured":"Giunchiglia , E. and Lifschitz , V . 1998. An action language based on causal explanation: Preliminary report . In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI '98) . 623--630.]] Giunchiglia, E. and Lifschitz, V. 1998. An action language based on causal explanation: Preliminary report. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI '98). 623--630.]]"},{"key":"e_1_2_1_59_1","volume-title":"Proceedings of the International Logic Programming Symposium (ILPS '94)","author":"Gottlob G.","year":"1994","unstructured":"Gottlob , G. 1994 . Complexity and expressive power of disjunctive logic programming . In Proceedings of the International Logic Programming Symposium (ILPS '94) , Ithaca, NY, M. Bruynooghe, Ed. MIT Press, Cambridge, MA, 23--42.]] Gottlob, G. 1994. Complexity and expressive power of disjunctive logic programming. In Proceedings of the International Logic Programming Symposium (ILPS '94), Ithaca, NY, M. Bruynooghe, Ed. MIT Press, Cambridge, MA, 23--42.]]"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(98)00057-8"},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the 16th International Conference on Logic Programming (ICLP'99)","author":"Greco S.","year":"1999","unstructured":"Greco , S. 1999 . Optimization of disjunction queries . In Proceedings of the 16th International Conference on Logic Programming (ICLP'99) , Las Cruces, New Mexico, USA, D. D. Schreye, Ed. MIT Press, Cambridge, MA, 441--455.]] Greco, S. 1999. Optimization of disjunction queries. In Proceedings of the 16th International Conference on Logic Programming (ICLP'99), Las Cruces, New Mexico, USA, D. D. Schreye, Ed. MIT Press, Cambridge, MA, 441--455.]]"},{"key":"e_1_2_1_62_1","volume-title":"Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR","author":"Janhunen T.","year":"2000","unstructured":"Janhunen , T. , Niemela , I. , Simons , P. , and You , J . -H. 2000. Partiality and disjunctions in stable model semantics . In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000 ), Breckenridge, Colorado, USA, A. G. Cohn, F. Giunchiglia, and B. Selman, Eds. Morgan Kaufmann, San Francisco, CA, 411--419.]] Janhunen, T., Niemela, I., Simons, P., and You, J.-H. 2000. Partiality and disjunctions in stable model semantics. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), Breckenridge, Colorado, USA, A. G. Cohn, F. Giunchiglia, and B. Selman, Eds. Morgan Kaufmann, San Francisco, CA, 411--419.]]"},{"key":"e_1_2_1_63_1","volume-title":"-H","author":"Janhunen T.","year":"2003","unstructured":"Janhunen , T. , Niemel\u00e4 , I. , Seipel , D. , Simons , P. , and You , J . -H . 2003 . Unfolding partiality and disjunctions in stable model semantics. Tech. rep. cs.AI\/0303009. Go online to arXiv.org.]] Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., and You, J.-H. 2003. Unfolding partiality and disjunctions in stable model semantics. Tech. rep. cs.AI\/0303009. Go online to arXiv.org.]]"},{"key":"e_1_2_1_64_1","volume-title":"Handbook of Theoretical Computer Science","author":"Johnson D. S.","unstructured":"Johnson , D. S. 1990. A catalog of complexity classes . In Handbook of Theoretical Computer Science , J. van Leeuwen, Ed. Vol. A. Elsevier Science , Amsterdam, The Netherlands. Chapt. 2.]] Johnson, D. S. 1990. A catalog of complexity classes. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol. A. Elsevier Science, Amsterdam, The Netherlands. Chapt. 2.]]"},{"key":"e_1_2_1_65_1","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth D. E.","unstructured":"Knuth , D. E. 1994. The Stanford GraphBase: A Platform for Combinatorial Computing . ACM Press , New York, NY .]] Knuth, D. E. 1994. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, New York, NY.]]"},{"key":"e_1_2_1_66_1","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99","author":"Koch C.","unstructured":"Koch , C. and Leone , N . 1999. Stable model checking made easy . In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99 , Stockholm, Sweden, T. Dean, Ed. Morgan Kaufmann, San Francisco, CA, 70--75.]] Koch, C. and Leone, N. 1999. Stable model checking made easy. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI'99, Stockholm, Sweden, T. Dean, Ed. Morgan Kaufmann, San Francisco, CA, 70--75.]]"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(03)00078-X"},{"key":"e_1_2_1_68_1","volume-title":"Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01)","author":"Leone N.","year":"2001","unstructured":"Leone , N. , Perri , S. , and Scarcello , F . 2001. Improving ASP instantiators by join-ordering methods . In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01) , Vienna, Austria , September 2001 , T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 2173. Springer, Berlin, Germany.]] Leone, N., Perri, S., and Scarcello, F. 2001. Improving ASP instantiators by join-ordering methods. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'01), Vienna, Austria, September 2001, T. Eiter, W. Faber, and M. Truszczy\u0144ski, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 2173. Springer, Berlin, Germany.]]"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2630"},{"key":"e_1_2_1_70_1","volume-title":"Principles of Knowledge Representation","author":"Lifschitz V.","unstructured":"Lifschitz , V. 1996. Foundations of logic programming . In Principles of Knowledge Representation , G. Brewka, Ed. CSLI Publications, Stanford , CA , 69--127.]] Lifschitz, V. 1996. Foundations of logic programming. In Principles of Knowledge Representation, G. Brewka, Ed. CSLI Publications, Stanford, CA, 69--127.]]"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"e_1_2_1_73_1","volume-title":"Proceedings of the 11th International Conference on Logic Programming (ICLP'94)","author":"Lifschitz V.","unstructured":"Lifschitz , V. and Turner , H . 1994. Splitting a logic program . In Proceedings of the 11th International Conference on Logic Programming (ICLP'94) , Santa Margherita Ligure, Italy, P. Van Hentenryck, Ed. MIT Press, Cambridge, MA, 23--37.]] Lifschitz, V. and Turner, H. 1994. Splitting a logic program. In Proceedings of the 11th International Conference on Logic Programming (ICLP'94), Santa Margherita Ligure, Italy, P. Van Hentenryck, Ed. MIT Press, Cambridge, MA, 23--37.]]"},{"key":"e_1_2_1_74_1","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2002)","author":"Lin F.","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-2002) , Edmonton, Alberta, Canada. AAAI Press, Stanford, CA\/MIT Press, Cambridge, MA.]] 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-2002), Edmonton, Alberta, Canada. AAAI Press, Stanford, CA\/MIT Press, Cambridge, MA.]]"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Lobo J. Minker J. and Rajasekar A. 1992. Foundations of Disjunctive Logic Programming. MIT Press Cambridge MA.]]   Lobo J. Minker J. and Rajasekar A. 1992. Foundations of Disjunctive Logic Programming. MIT Press Cambridge MA.]]","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116836"},{"key":"e_1_2_1_77_1","volume-title":"Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98)","author":"McCain N.","unstructured":"McCain , N. and Turner , H . 1998. Satisfiability planning with causal theories . In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98) , A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 212--223.]] McCain, N. and Turner, H. 1998. Satisfiability planning with causal theories. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), A. G. Cohn, L. Schubert, and S. C. Shapiro, Eds. Morgan Kaufmann, San Francisco, CA, 212--223.]]"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.5555\/648225.749138"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530759"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.5555\/648050.746043"},{"key":"e_1_2_1_81_1","volume-title":"Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science","volume":"2424","author":"Nicolas P.","unstructured":"Nicolas , P. , Saubion , F. , and St\u00e9phan , I . 2002. Answer Set Programming by ant colony optimization . In Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science , vol. 2424 . Springer, Berlin, Germany, 186--197.]] Nicolas, P., Saubion, F., and St\u00e9phan, I. 2002. Answer Set Programming by ant colony optimization. In Proceedings of the 8th Europ. Conference on Artificial Intelligence (JELIA), S. Flesca, S. Greco, G. Ianni, and N. Leone, Eds. Lecture Notes in Computer Science, vol. 2424. Springer, Berlin, Germany, 186--197.]]"},{"key":"e_1_2_1_82_1","volume-title":"Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97)","volume":"1265","author":"Niemel\u00e4 I.","unstructured":"Niemel\u00e4 , I. and Simons , P . 1997. Smodels---an implementation of the stable model and well-founded semantics for normal logic programs . In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97) , J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence , vol. 1265 . Springer, Berlin, Germany, 420--429.]] Niemel\u00e4, I. and Simons, P. 1997. Smodels---an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97), J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 1265. Springer, Berlin, Germany, 420--429.]]"},{"key":"e_1_2_1_83_1","volume-title":"Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000)","author":"Niemel\u00e4 I.","unstructured":"Niemel\u00e4 , I. , Simons , P. , and Syrj\u00e4nen , T . 2000. Smodels: A system for Answer Set Programming . In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000) , Breckenridge, Colorado, USA, C. Baral and M. Truszczy\u0144ski, Eds.]] Niemel\u00e4, I., Simons, P., and Syrj\u00e4nen, T. 2000. Smodels: A system for Answer Set Programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning (NMR'2000), Breckenridge, Colorado, USA, C. Baral and M. Truszczy\u0144ski, Eds.]]"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/62.322435"},{"key":"e_1_2_1_85_1","volume-title":"Computational Complexity","author":"Papadimitriou C. H.","unstructured":"Papadimitriou , C. H. 1994. Computational Complexity . Addison-Wesley , Reading, MA .]] Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley, Reading, MA.]]"},{"key":"e_1_2_1_86_1","volume-title":"Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002)","author":"Pearce D.","unstructured":"Pearce , D. , Sarsakov , V. , Schaub , T. , Tompits , H. , and Woltran , S . 2002. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report . In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002) , Toulouse, France.]] Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., and Woltran, S. 2002. A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR'2002), Toulouse, France.]]"},{"key":"e_1_2_1_87_1","volume-title":"Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7), V. Lifschitz and I. Niemel\u00e4, Eds. Lecture Notes in Computer Science","volume":"2923","author":"Pfeifer G.","year":"2004","unstructured":"Pfeifer , G. 2004 . Improving the model generation\/checking interplay to enhance the evaluation of disjunctive programs . In Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7), V. Lifschitz and I. Niemel\u00e4, Eds. Lecture Notes in Computer Science , vol. 2923 . Springer, Berlin, Germany, 220--233.]] Pfeifer, G. 2004. Improving the model generation\/checking interplay to enhance the evaluation of disjunctive programs. In Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR-7), V. Lifschitz and I. Niemel\u00e4, Eds. Lecture Notes in Computer Science, vol. 2923. Springer, Berlin, Germany, 220--233.]]"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1989.tb00319.x"},{"key":"e_1_2_1_89_1","volume-title":"Proceedings of the North American Conference on Logic Programming. 40--62","author":"Przymusinski T.","year":"1990","unstructured":"Przymusinski , T. 1990 . Stationary semantics for disjunctive logic programs and deductive databases . In Proceedings of the North American Conference on Logic Programming. 40--62 .]] Przymusinski, T. 1990. Stationary semantics for disjunctive logic programs and deductive databases. In Proceedings of the North American Conference on Logic Programming. 40--62.]]"},{"key":"e_1_2_1_90_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530826"},{"key":"e_1_2_1_91_1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"Przymusinski T. C.","unstructured":"Przymusinski , T. C. 1988. On the declarative semantics of deductive databases and logic programs . In Foundations of Deductive Databases and Logic Programming , J. Minker, Ed. Morgan Kaufmann , San Francisco, CA , 193--216.]] Przymusinski, T. C. 1988. On the declarative semantics of deductive databases and logic programs. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, San Francisco, CA, 193--216.]]"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037171"},{"key":"e_1_2_1_93_1","volume-title":"Small RAMSEY numbers. Electron. J. Combinatorics 1. Revision 9","author":"Radziszowski S. P.","year":"2002","unstructured":"Radziszowski , S. P. 1994. Small RAMSEY numbers. Electron. J. Combinatorics 1. Revision 9 : July 15, 2002 .]] Radziszowski, S. P. 1994. Small RAMSEY numbers. Electron. J. Combinatorics 1. Revision 9: July 15, 2002.]]"},{"key":"e_1_2_1_94_1","volume-title":"Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97)","volume":"1265","author":"Rao P.","unstructured":"Rao , P. , Sagonas , K. F. , Swift , T. , Warren , D. S. , and Freire , J . 1997. XSB: A system for efficiently computing well-founded semantics . In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97) , J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence , vol. 1265 . Springer, Berlin, Germany, 2--17.]] Rao, P., Sagonas, K. F., Swift, T., Warren, D. S., and Freire, J. 1997. XSB: A system for efficiently computing well-founded semantics. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), J. Dix, U. Furbach, and A. Nerode, Eds. Lecture Notes in Computer Science\/Lecture Notes in Artificial Intelligence, vol. 1265. Springer, Berlin, Germany, 2--17.]]"},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(87)90062-2"},{"key":"e_1_2_1_96_1","volume-title":"Deductive and Object-Oriented Databases, W. Kim, J.-M","author":"Ross K.","unstructured":"Ross , K. 1990. The well-founded semantics for Disjunctive Logic Programs . In Deductive and Object-Oriented Databases, W. Kim, J.-M . Nicolas, and S. Nishio, Eds. Elsevier Science, Amsterdam, The Netherlands , 385--402.]] Ross, K. 1990. The well-founded semantics for Disjunctive Logic Programs. In Deductive and Object-Oriented Databases, W. Kim, J.-M. Nicolas, and S. Nishio, Eds. Elsevier Science, Amsterdam, The Netherlands, 385--402.]]"},{"key":"e_1_2_1_97_1","volume-title":"Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89)","author":"Sakama C.","year":"1989","unstructured":"Sakama , C. 1989 . Possible model semantics for disjunctive databases . In Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89) . North-Holland, Amsterdam, The Netherlands, 369--383.]] Sakama, C. 1989. Possible model semantics for disjunctive databases. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases (DOOD-89). North-Holland, Amsterdam, The Netherlands, 369--383.]]"},{"key":"e_1_2_1_98_1","volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI","author":"Schaub T.","year":"2001","unstructured":"Schaub , T. and Wang , K . 2001. A comparative study of logic programs with preference . In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001 ). Morgan Kaufmann, San Francisco, CA, 597--602.]] Schaub, T. and Wang, K. 2001. A comparative study of logic programs with preference. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001). Morgan Kaufmann, San Francisco, CA, 597--602.]]"},{"key":"e_1_2_1_99_1","volume-title":"Proceedings of the International Workshop on the Deductive Approach to Information Systems and Databases (DAISD'94)","author":"Seipel D.","unstructured":"Seipel , D. and Th\u00f6ne , H . 1994. DisLog---A system for reasoning in disjunctive deductive databases . In Proceedings of the International Workshop on the Deductive Approach to Information Systems and Databases (DAISD'94) , A. Oliv\u00e9, Ed. Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, 325--343.]] Seipel, D. and Th\u00f6ne, H. 1994. DisLog---A system for reasoning in disjunctive deductive databases. In Proceedings of the International Workshop on the Deductive Approach to Information Systems and Databases (DAISD'94), A. Oliv\u00e9, Ed. Universitat Politecnica de Catalunya (UPC), Barcelona, Spain, 325--343.]]"},{"key":"e_1_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"e_1_2_1_102_1","unstructured":"Syrj\u00e4nen T. 2002. Lparse 1.0 user's manual. Go online to &lt;URL:http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz&gt;.]]  Syrj\u00e4nen T. 2002. Lparse 1.0 user's manual. Go online to &lt;URL:http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz&gt;.]]"},{"key":"e_1_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"e_1_2_1_104_1","volume-title":"Workshop: Disjunctive Logic Programming and Disjunctive Databases Proceedings, 13th IFIP World Computer Congress","author":"Wolfinger B., Ed.","year":"1994","unstructured":"Wolfinger , B., Ed. 1994 . Workshop: Disjunctive Logic Programming and Disjunctive Databases Proceedings, 13th IFIP World Computer Congress , Hamburg, Germany. German Society for Computer Science (GI) Springer, Berlin, Germany.]] Wolfinger, B., Ed. 1994. Workshop: Disjunctive Logic Programming and Disjunctive Databases Proceedings, 13th IFIP World Computer Congress, Hamburg, Germany. German Society for Computer Science (GI) Springer, Berlin, Germany.]]"},{"key":"e_1_2_1_105_1","unstructured":"Zhao Y. 2002. ASSAT homepage. Go online to http:\/\/assat.cs.ust.hk\/.]]  Zhao Y. 2002. ASSAT homepage. Go online to http:\/\/assat.cs.ust.hk\/.]]"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1149114.1149117","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1149114.1149117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:13Z","timestamp":1750264273000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1149114.1149117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":104,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["10.1145\/1149114.1149117"],"URL":"https:\/\/doi.org\/10.1145\/1149114.1149117","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7]]},"assertion":[{"value":"2006-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}