{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:49:57Z","timestamp":1725490197891},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74610-2_6","type":"book-chapter","created":{"date-parts":[[2007,8,24]],"date-time":"2007-08-24T02:33:31Z","timestamp":1187922811000},"page":"76-88","source":"Crossref","is-referenced-by-count":14,"title":["Logic Programming for Knowledge Representation"],"prefix":"10.1007","author":[{"given":"Miros\u0142aw","family":"Truszczy\u0144ski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","first-page":"3","volume":"4","author":"H. Andr\u00e9ka","year":"1978","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I.: The generalized completeness of Horn predicate logic as a programming language. Acta Cybernetica\u00a04(1), 3\u201310 (1978\/79)","journal-title":"Acta Cybernetica"},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of deductive databases and logic programming","author":"K. Apt","year":"1988","unstructured":"Apt, K., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of deductive databases and logic programming, pp. 89\u2013142. Morgan Kaufmann, San Francisco (1988)"},{"key":"6_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","volume":"19\/20","author":"C. Baral","year":"1994","unstructured":"Baral, C., Gelfond, M.: Logic programming and knowledge representation. Journal of Logic Programming\u00a019\/20, 73\u2013148 (1994)","journal-title":"Journal of Logic Programming"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Negation as failure, Logic and data bases","author":"K.L. Clark","year":"1978","unstructured":"Clark, K.L.: Negation as failure, Logic and data bases, pp. 293\u2013322. Plenum Press, New York, London (1978)"},{"key":"6_CR6","unstructured":"Colmerauer, A., Kanoui, H., Pasero, R., Roussel, P.: Un systeme de communication homme-machine en francais, Tech. report, University of Marseille (1973)"},{"key":"6_CR7","first-page":"847","volume-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003)","author":"T. Dell\u2019Armi","year":"2003","unstructured":"Dell\u2019Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate functions in disjunctive logic programming: semantics, complexity, and implementation in DLV. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 847\u2013852. Morgan Kaufmann, San Francisco (2003)"},{"key":"6_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49545-2_1","volume-title":"Logics in Artificial Intelligence","author":"M. Denecker","year":"1998","unstructured":"Denecker, M.: The well-founded semantics is the principle of inductive definition. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 1\u201316. Springer, Heidelberg (1998)"},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","volume-title":"Logic-Based Artificial Intelligence","author":"M. Denecker","year":"2000","unstructured":"Denecker, M., Marek, V., Truszczy\u0144ski, M.: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Logic-Based Artificial Intelligence, pp. 127\u2013144. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45635-X_22","volume-title":"Logic Programming","author":"M. Denecker","year":"2001","unstructured":"Denecker, M., Pelov, N., Bruynooghe, M.: Ultimate well-founded and stable semantics for logic programs with aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 212\u2013226. Springer, Heidelberg (2001)"},{"key":"6_CR11","first-page":"545","volume-title":"Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004)","author":"M. Denecker","year":"2004","unstructured":"Denecker, M., Ternovska, E.: Inductive situation calculus. In: Proceedings of the 9th International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 545\u2013553. AAAI Press, Stanford (2004)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Denecker, M., Ternovska, E.: A logic for non-monotone inductive definitions, ACM Transactions on Computational Logic (to appear, 2008)","DOI":"10.1145\/1342991.1342998"},{"key":"6_CR13","first-page":"163","volume-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000)","author":"D. East","year":"2000","unstructured":"East, D., Truszczy\u0144ski, M.: Datalog with constraints. In: Proceedings of the 17th National Conference on Artificial Intelligence (AAAI 2000), pp. 163\u2013168. AAAI Press, Stanford (2000)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/1119439.1119441","volume":"7","author":"D. East","year":"2006","unstructured":"East, D., Truszczy\u0144ski, M.: Predicate-calculus based logics for modeling and solving search problems. ACM Transactions on Computational Logic\u00a07, 38\u201383 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"key":"6_CR16","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and uniform equivalence in answer-set programming: Characterizations and complexity results for the non-ground case. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 695\u2013700 (2005)"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming, ACM Transactions on Computational Logic (to appear, 2006)","DOI":"10.1145\/1243996.1244000"},{"issue":"3-4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: propositional case. Annals of Mathematics and Artificial Intelligence\u00a015(3-4), 289\u2013323 (1995)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR19","first-page":"97","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 97\u2013102. Morgan Kaufmann, San Francisco (2005)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-27775-0_6","volume-title":"Logic Programming","author":"I. Elkabani","year":"2004","unstructured":"Elkabani, I., Pontelli, E., Son, T.C.: Smodels with CLP and its applications: a simple and effective approach to aggregates in ASP. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 73\u201389. Springer, Heidelberg (2004)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-540-30570-5_21","volume-title":"Database Theory - ICDT 2005","author":"W. Faber","year":"2004","unstructured":"Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.\u00a03363, pp. 306\u2013320. Springer, Heidelberg (2004)"},{"key":"6_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS(LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"6_CR23","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-72200-7_12","volume-title":"Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007)","author":"M. Fink","year":"2007","unstructured":"Fink, M., Pichler, R., Tompits, H., Woltran, S.: Complexity of rule redundancy in non-ground answer-set programming over finite domains. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007). LNCS (LNAI), vol.\u00a04483, pp. 123\u2013135. Springer, Heidelberg (2007)"},{"key":"6_CR24","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","volume-title":"Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007)","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczy\u0144ski, M.: The first answer set programming system competition. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007). LNCS (LNAI), vol.\u00a04483, pp. 3\u201317. Springer, Heidelberg (2007)"},{"key":"6_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS(LNAI), vol.\u00a02408, pp. 413\u2013451. Springer, Heidelberg (2002)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic programming and knowledge representation \u2013 the A-prolog perspective. Artificial Intelligence\u00a0138, 3\u201338 (2002)","journal-title":"Artificial Intelligence"},{"key":"6_CR27","first-page":"1070","volume-title":"Proceedings of the 5th International Conference on Logic Programming (ICLP 1988)","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable semantics for logic programs. In: Proceedings of the 5th International Conference on Logic Programming (ICLP 1988), pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"6_CR28","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":"6_CR29","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik, Sitzungsberichte der Preussischen Akademie von Wissenschaften. Physikalisch-mathematische Klasse, pp. 42\u201356 (1930)"},{"key":"6_CR30","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-72200-7_16","volume-title":"Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007)","author":"T. Janhunen","year":"2007","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Wotran, S.: Modularity aspects of disjunctive stable models. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007). LNCS(LNAI), vol.\u00a04483, pp. 175\u2013187. Springer, Heidelberg (2007)"},{"key":"6_CR31","unstructured":"Kowalski, R.: Predicate logic as a programming language. In: Proceedings of the Congress of the International Federation for Information Processing (IFIP-1974) (Amsterdam), North Holland, pp.\u00a0569\u2013574 (1974)"},{"key":"6_CR32","volume-title":"Logic for problem solving","author":"R. Kowalski","year":"1979","unstructured":"Kowalski, R.: Logic for problem solving. North Holland, Amsterdam (1979)"},{"issue":"4","key":"6_CR33","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR34","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-72200-7_17","volume-title":"Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007)","author":"V. Lifschitz","year":"2007","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: A characterization of strong equivalence for logic programs with variables. In: Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007). LNCS(LNAI), vol.\u00a04483, pp. 188\u2013200. Springer, Heidelberg (2007)"},{"key":"6_CR35","unstructured":"Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming (ICLP 1994), pp. 23\u201337 (1994)"},{"key":"6_CR36","volume-title":"Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002)","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), Morgan Kaufmann, San Francisco (2002)"},{"key":"6_CR37","first-page":"112","volume-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002)","author":"F. Lin","year":"2002","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. In: Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002), pp. 112\u2013117. AAAI Press, Stanford (2002)"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007)","author":"L. Liu","year":"2007","unstructured":"Liu, L., Pontelli, E., Son, T.C., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms: the role of computations. In: Proceedings of the 23rd International Conference on Logic Programming (ICLP 2007). LNCS, Springer, Heidelberg (2007) (this volume)"},{"key":"6_CR39","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11546207_37","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"L. Liu","year":"2005","unstructured":"Liu, L., Truszczy\u0144ski, M.: Pbmodels - software to compute stable models by pseudoboolean solvers. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS(LNAI), vol.\u00a03662, pp. 410\u2013415. Springer, Heidelberg (2005)"},{"key":"6_CR40","first-page":"701","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005)","author":"L. Liu","year":"2005","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties of programs with monotone and convex constraints. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 701\u2013706. AAAI Press, Stanford (2005)"},{"key":"6_CR41","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"27","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties and applications of programs with monotone and convex constraints. Journal of Artificial Intelligence Research\u00a027, 299\u2013334 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"6_CR42","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/978-3-540-24609-1_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V.W. Marek","year":"2003","unstructured":"Marek, V.W., Remmel, J.B.: Set constraints in logic programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Logic Programming and Nonmonotonic Reasoning. LNCS(LNAI), vol.\u00a02923, pp. 167\u2013179. Springer, Heidelberg (2003)"},{"key":"6_CR43","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Berlin (1999)"},{"key":"6_CR44","first-page":"86","volume-title":"Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004)","author":"V.W. Marek","year":"2004","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Logic programs with abstract constraint atoms. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI 2004), pp. 86\u201391. AAAI Press, Stanford (2004)"},{"issue":"3","key":"6_CR45","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W., Truszczy\u0144ski, M.: Autoepistemic logic. Journal of the ACM\u00a038(3), 588\u2013619 (1991)","journal-title":"Journal of the ACM"},{"key":"6_CR46","unstructured":"McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence, Machine Intelligence 4, pp. 463\u2013502. Edinburgh University Press (1969)"},{"key":"6_CR47","first-page":"430","volume-title":"Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005)","author":"D.G. Mitchell","year":"2005","unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 430\u2013435. AAAI Press, Stanford (2005)"},{"issue":"3-4","key":"6_CR48","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR49","unstructured":"Pelov, N.: Semantics of logic programs with aggregates, PhD Thesis. Department of Computer Science, K.U. Leuven, Leuven, Belgium (2004)"},{"key":"6_CR50","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on resolution principle. Journal of the ACM\u00a012, 23\u201341 (1965)","journal-title":"Journal of the ACM"},{"key":"6_CR51","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":"6_CR52","doi-asserted-by":"crossref","unstructured":"Son, T., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming, Theory and Practice of Logic Programming (accepted 2007), available at http:\/\/arxiv.org\/abs\/cs.AI\/0601051","DOI":"10.1017\/S1471068406002936"},{"key":"6_CR53","first-page":"129","volume-title":"Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006)","author":"T. Son","year":"2006","unstructured":"Son, T., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. In: Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), pp. 129\u2013134. AAAI Press, Stanford (2006)"},{"key":"6_CR54","first-page":"389","volume-title":"Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006)","author":"M. Truszczy\u0144ski","year":"2006","unstructured":"Truszczy\u0144ski, M.: Strong and uniform equivalence of nonmonotonic theories \u2014 an algebraic approach. In: Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 389\u2013399. AAAI Press, Stanford (2006)"},{"key":"6_CR55","volume-title":"Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007)","author":"M. Truszczy\u0144ski","year":"2007","unstructured":"Truszczy\u0144ski, M.: The modal logic S4F, the default logic, and the logic here-and-there. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), AAAI Press, Stanford (2007)"},{"key":"6_CR56","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming\u00a03, 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"4","key":"6_CR57","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden van","year":"1976","unstructured":"van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM\u00a023(4), 733\u2013742 (1976)","journal-title":"Journal of the ACM"},{"issue":"3","key":"6_CR58","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A. Gelder Van","year":"1991","unstructured":"Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM\u00a038(3), 620\u2013650 (1991)","journal-title":"Journal of the ACM"},{"key":"6_CR59","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/11546207_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. Vennekens","year":"2005","unstructured":"Vennekens, J., Denecker, M.: An algebraic account of modularity in ID-logic. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 291\u2013303. Springer, Heidelberg (2005)"},{"key":"6_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-540-27775-0_14","volume-title":"Logic Programming","author":"J. Vennekens","year":"2004","unstructured":"Vennekens, J., Gilis, D., Denecker, M.: Splitting an operator: an algebraic modularity result and its applications to logic programming. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 195\u2013209. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74610-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:30:23Z","timestamp":1619519423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74610-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746089"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74610-2_6","relation":{},"subject":[]}}