×

Pruning external minimality checking for answer set programs using semantic dependencies. (English) Zbl 07382239

Summary: Answer set programming (ASP) has become an increasingly popular approach for declarative problem solving. In order to address the needs of applications, ASP has been extended in different approaches with means for interfacing the outside world, of which hex programs are one of the most powerful such extension that provides API-style interfaces to access arbitrary external sources of information and computation, respectively. Adhering to the principle of founded derivation, computing answer sets of hex programs requires an external (e-) minimality check for answer set candidates in order to prevent cyclic justifications via external sources. Due to the generic nature of external sources, the check can be a bottleneck in practice. To mitigate this, various optimizations have been developed previously, including the use of syntactic information about atom dependencies in order to detect cases when an e-minimality check can be avoided. However, the approach largely over-approximates the real dependencies due to the black-box nature of external sources. We thus consider in this work the use of semantic information for achieving better approximations. To this end, we introduce input-output (io-) dependencies for external sources, which intuitively link the occurrence of values in the result of a call to an external source to the occurrence of values in the input provided to this call. It appears that disposing of information about io-dependencies significantly increases the potential for pruning e-minimality checks, and an empirical evaluation exhibits a clear benefit of this approach. Moreover, we study semantic and computational properties of io-dependencies and provide algorithms for constructing and optimizing sets of io-dependencies. Our work aims at laying some foundations for the use of semantic dependency information in external source access from ASP. The results are not limited to hex programs, but may analogously be deployed to other approaches that integrate external sources into ASP, such as clingo or wasp with external propagators. Furthermore, the results may be applied in other parts of the hex program evaluation pipeline as well.

MSC:

68Txx Artificial intelligence
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Abiteboul, S.; Hull, R.; Vianu, V., Foundations of Databases (1995), Addison-Wesley
[2] Allen, F. E., Control flow analysis, SIGPLAN Not., 5, 7, 1-19 (Jul. 1970)
[3] Balabanov, V.; Chiang, H. K.; Jiang, J. R., Henkin quantifiers and boolean formulae: a certification perspective of DQBF, Theor. Comput. Sci., 523, 86-100 (2014) · Zbl 1283.03032
[4] Barrett, C. W.; Sebastiani, R.; Seshia, S. A.; Tinelli, C., Satisfiability modulo theories, (Biere, A.; Heule, M.; van Maaren, H.; Walsh, T., Handbook of Satisfiability. Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185 (2009), IOS Press), 825-885
[5] Bessiere, C., Constraint propagation, (Rossi, F.; van Beek, P.; Walsh, T., Handbook of Constraint Programming. Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2 (2006), Elsevier), 29-83
[6] Bogaerts, B.; Erdem, E.; Harrison, A., Guest editorial: special issue on answer set programming and other computing paradigms, Ann. Math. Artif. Intell., 86, 1-3, 1-2 (2019) · Zbl 1476.00088
[7] Boutilier, C.; Brafman, R. I.; Domshlak, C.; Hoos, H. H.; Poole, D., CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements, J. Artif. Intell. Res., 21, 135-191 (2004) · Zbl 1080.68685
[8] Brewka, G.; Eiter, T.; Truszczynski, M., Answer set programming at a glance, Commun. ACM, 54, 12, 92-103 (2011)
[9] Brewka, G.; Eiter, T.; Truszczynski, M., Answer set programming: an introduction to the special issue, AI Mag., 37, 3, 5-6 (2016)
[10] Cadoli, M.; Eiter, T.; Gottlob, G., Default logic as a query language, IEEE Trans. Knowl. Data Eng., 9, 3, 448-463 (1997)
[11] Calimeri, F.; Cozza, S.; Ianni, G., External sources of knowledge and value invention in logic programming, Ann. Math. Artif. Intell., 50, 3-4, 333-361 (2007) · Zbl 1125.68026
[12] Calimeri, F.; Cozza, S.; Ianni, G.; Leone, N., Computable functions in ASP: theory and implementation, (de la Banda, M. G.; Pontelli, E., Logic Programming, Proceedings of 24th International Conference. Logic Programming, Proceedings of 24th International Conference, ICLP 2008, Udine, Italy, December 9-13, 2008. Logic Programming, Proceedings of 24th International Conference. Logic Programming, Proceedings of 24th International Conference, ICLP 2008, Udine, Italy, December 9-13, 2008, Lecture Notes in Computer Science, vol. 5366 (2008), Springer), 407-424 · Zbl 1185.68150
[13] Calimeri, F.; Fink, M.; Germano, S.; Humenberger, A.; Ianni, G.; Redl, C.; Stepanova, D.; Tucci, A.; Wimmer, A., Angry-HEX: an artificial player for angry birds based on declarative knowledge bases, IEEE Trans. Comput. Intell. AI Games, 8, 2, 128-139 (2016)
[14] Calimeri, F.; Fuscà, D.; Germano, S.; Perri, S.; Zangari, J., Fostering the use of declarative formalisms for real-world applications: the EmbASP framework, New Gener. Comput., 37, 1, 29-65 (2019)
[15] Chandra, A.; Merlin, P., Optimal implementation of conjunctive queries in relational databases, (Proceedings of the Ninth ACM Symposium on the Theory of Computing. Proceedings of the Ninth ACM Symposium on the Theory of Computing, STOC-77 (1977), Boulder: Boulder Colorado), 77-89
[16] Chekuri, C.; Rajaraman, A., Conjunctive query containment revisited, (Afrati, F. N.; Kolaitis, P. G., Database Theory - ICDT ’97, Proceedings of 6th International Conference. Database Theory - ICDT ’97, Proceedings of 6th International Conference, Delphi, Greece, January 8-10, 1997. Database Theory - ICDT ’97, Proceedings of 6th International Conference. Database Theory - ICDT ’97, Proceedings of 6th International Conference, Delphi, Greece, January 8-10, 1997, Lecture Notes in Computer Science, vol. 1186 (1997), Springer), 56-70 · Zbl 0944.68046
[17] de Alfaro, L.; Henzinger, T. A.; Mang, F. Y.C., The control of synchronous systems, (Palamidessi, C., CONCUR 2000 - Concurrency Theory, Proceedings of 11th International Conference. CONCUR 2000 - Concurrency Theory, Proceedings of 11th International Conference, University Park, PA, USA, August 22-25, 2000. CONCUR 2000 - Concurrency Theory, Proceedings of 11th International Conference. CONCUR 2000 - Concurrency Theory, Proceedings of 11th International Conference, University Park, PA, USA, August 22-25, 2000, Lecture Notes in Computer Science., vol. 1877 (2000), Springer), 458-473 · Zbl 0999.68531
[18] Dodaro, C.; Ricca, F., The external interface for extending WASP, TPLP, 1-24 (2018)
[19] Dodaro, C.; Ricca, F.; Schüller, P., External propagators in WASP: preliminary report, (Bistarelli, S.; Formisano, A.; Maratea, M., Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2016, Genova, Italy, November 28, 2016. Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, RCRA 2016, Genova, Italy, November 28, 2016, CEUR Workshop Proceedings, vol. 1745 (2016), CEUR-WS.org), 1-9
[20] Doyen, L.; Henzinger, T. A.; Jobstmann, B.; Petrov, T., Interface theories with component reuse, (de Alfaro, L.; Palsberg, J., Proceedings of the 8th ACM & IEEE International Conference on Embedded Software. Proceedings of the 8th ACM & IEEE International Conference on Embedded Software, EMSOFT 2008, Atlanta, GA, USA, October 19-24, 2008 (2008), ACM), 79-88
[21] Eiter, T.; Faber, W.; Fink, M.; Woltran, S., Complexity results for answer set programming with bounded predicate arities and implications, Ann. Math. Artif. Intell., 51, 2-4, 123-165 (2007) · Zbl 1138.68017
[22] Eiter, T.; Fink, M.; Krennwallner, T., Decomposition of declarative knowledge bases with external functions, (Boutilier, C., IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence. IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009 (2009)), 752-758
[23] Eiter, T.; Fink, M.; Krennwallner, T.; Redl, C., Domain expansion for ASP-programs with external sources, Artif. Intell., 233, 84-121 (2016) · Zbl 1351.68265
[24] Eiter, T.; Fink, M.; Krennwallner, T.; Redl, C.; Schüller, P., Efficient hex-program evaluation based on unfounded sets, J. Artif. Intell. Res., 49, 269-321 (2014) · Zbl 1361.68031
[25] Eiter, T.; Germano, S.; Ianni, G.; Kaminski, T.; Redl, C.; Schüller, P.; Weinzierl, A., The DLVHEX system, Künstl. Intell., 32, 2-3, 187-189 (2018)
[26] Eiter, T.; Gottlob, G.; Mannila, H., Disjunctive datalog, ACM Trans. Database Syst., 22, 3, 364-418 (1997)
[27] Eiter, T.; Kaminski, T.; Redl, C.; Schüller, P.; Weinzierl, A., Answer set programming with external source access, (Ianni, G.; Lembo, D.; Bertossi, L. E.; Faber, W.; Glimm, B.; Gottlob, G.; Staab, S., Reasoning Web. Semantic Interoperability on the Web - 13th International Summer School 2017. Reasoning Web. Semantic Interoperability on the Web - 13th International Summer School 2017, London, UK, July 7-11, 2017, Tutorial Lectures. Reasoning Web. Semantic Interoperability on the Web - 13th International Summer School 2017. Reasoning Web. Semantic Interoperability on the Web - 13th International Summer School 2017, London, UK, July 7-11, 2017, Tutorial Lectures, Lecture Notes in Computer Science, vol. 10370 (2017), Springer), 204-275
[28] Eiter, T.; Kaminski, T.; Redl, C.; Weinzierl, A., Exploiting partial assignments for efficient evaluation of answer set programs with external source access, J. Artif. Intell. Res., 62, 665-727 (2018) · Zbl 1448.68398
[29] Eiter, T.; Redl, C.; Schüller, P., Problem solving using the HEX family, (Beierle, C.; Brewka, G.; Thimm, M., Computational Models of Rationality, Essays dedicated to Gabriele Kern-Isberner on the occasion of her 60th birthday (2016), College Publications), 150-174
[30] Erdem, E.; Gelfond, M.; Leone, N., Applications of answer set programming, AI Mag., 37, 3, 53-68 (2016)
[31] Erdem, E.; Öztok, U., Generating explanations for biomedical queries, Theory Pract. Log. Program., 15, 1, 35-78 (2015) · Zbl 1379.68059
[32] Erdem, E.; Patoglu, V., Applications of ASP in robotics, Künstl. Intell., 32, 2-3, 143-149 (2018)
[33] Faber, W.; Pfeifer, G.; Leone, N., Semantics and complexity of recursive aggregates in answer set programming, Artif. Intell., 175, 1, 278-298 (2011) · Zbl 1216.68263
[34] Falkner, A. A.; Friedrich, G.; Schekotihin, K.; Taupe, R.; Teppan, E. C., Industrial applications of answer set programming, Künstl. Intell., 32, 2-3, 165-176 (2018)
[35] Febbraro, O.; Leone, N.; Grasso, G.; Ricca, F., JASP: a framework for integrating answer set programming with java, (Brewka, G.; Eiter, T.; McIlraith, S. A., Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference. Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012 (2012), AAAI Press), 541-551
[36] Fuscà, D.; Germano, S.; Zangari, J.; Anastasio, M.; Calimeri, F.; Perri, S., A framework for easing the development of applications embedding answer set programming, (Cheney, J.; Vidal, G., Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming. Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Edinburgh, United Kingdom, September 5-7, 2016 (2016), ACM), 38-49
[37] Gebser, M.; Kaminski, R.; Kaufmann, B.; Ostrowski, M.; Schaub, T.; Wanko, P., Theory solving made easy with Clingo 5, (Carro, M.; King, A.; Saeedloei, N.; Vos, M. D., Technical Communications of the 32nd International Conference on Logic Programming. Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA. Technical Communications of the 32nd International Conference on Logic Programming. Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA, OASICS, vol. 52 (2016), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik), 2:1-2:15
[38] Gebser, M.; Kaminski, R.; Kaufmann, B.; Schaub, T., Answer Set Solving in Practice, Synthesis Lectures on Artificial Intelligence and Machine Learning (2012), Morgan & Claypool Publishers
[39] Gebser, M.; Kaminski, R.; Kaufmann, B.; Schaub, T., Clingo = ASP + control (2014), CoRR abs/1405.3694
[40] Gebser, M.; Kaminski, R.; Schaub, T., aspcud: a Linux package configuration tool based on answer set programming, (Drescher, C.; Lynce, I.; Treinen, R., Proceedings Second Workshop on Logics for Component Configuration. Proceedings Second Workshop on Logics for Component Configuration, LoCoCo 2011, Perugia, Italy, 12th September 2011. Proceedings Second Workshop on Logics for Component Configuration. Proceedings Second Workshop on Logics for Component Configuration, LoCoCo 2011, Perugia, Italy, 12th September 2011, EPTCS, vol. 65 (2011)), 12-25
[41] Gebser, M.; Kaufmann, B.; Kaminski, R.; Ostrowski, M.; Schaub, T.; Schneider, M. T., Potassco: the Potsdam answer set solving collection, AI Commun., 24, 2, 107-124 (2011) · Zbl 1215.68214
[42] (Gelfond, M.; Kahl, Y., Knowledge Representation, Reasoning, and the Design of Intelligent Agents: The Answer-Set Programming Approach (2014), Cambridge University Press)
[43] Gelfond, M.; Lifschitz, V., The stable model semantics for logic programming, (Kowalski, R. A.; Bowen, K. A., Logic Programming, Proceedings of the Fifth International Conference and Symposium. Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes) (1988), MIT Press), 1070-1080
[44] Gelfond, M.; Lifschitz, V., Classical negation in logic programs and disjunctive databases, New Gener. Comput., 9, 3/4, 365-386 (1991) · Zbl 0735.68012
[45] Ghahramani, Z., Probabilistic machine learning and artificial intelligence, Nature, 521, 7553, 452-459 (2015)
[46] Ghezzi, C.; Jazayeri, M.; Mandrioli, D., Fundamentals of Software Engineering (2002), Prentice Hall
[47] Goldsmith, J.; Lang, J.; Truszczynski, M.; Wilson, N., The computational complexity of dominance and consistency in CP-nets, J. Artif. Intell. Res., 33, 403-432 (2008) · Zbl 1182.68089
[48] Hintikka, J.; Sandu, G., Informational independence as a semantical phenomenon, (Fenstad; et al., J. E., Logic, Methodology and Philosophy of Science VIII. Logic, Methodology and Philosophy of Science VIII, Studies in Logic and the Foundations of Mathematics, vol. 126 (1989), North-Holland Publishing Company), 571-589 · Zbl 0683.03004
[49] Hoehndorf, R.; Loebe, F.; Kelso, J.; Herre, H., Representing default knowledge in biomedical ontologies: application to the integration of anatomy and phenotype ontologies, BMC Bioinform., 8 (2007)
[50] Immerman, N., Number of quantifiers is better than number of tape cells, J. Comput. Syst. Sci., 22, 3, 384-406 (1981) · Zbl 0486.03019
[51] Janhunen, T.; Liu, G.; Niemelä, I., Tight integration of non-ground answer set programming and satisfiability modulo theories, (Cabalar, P.; Mitchell, D.; Pearce, D.; Ternovska, E., Informal Proceedings of the 1st Workshop on Grounding and Transformations for Theories with Variables. Informal Proceedings of the 1st Workshop on Grounding and Transformations for Theories with Variables, GTTV’11, LPNMR, Vancouver, BC, Canada May 16th, 2011 (2013)), 1-14, available online at
[52] Janhunen, T.; Oikarinen, E.; Tompits, H.; Woltran, S., Modularity aspects of disjunctive stable models, J. Artif. Intell. Res., 35, 813-857 (2009) · Zbl 1192.68129
[53] Kalinowski, T.; Narodytska, N.; Walsh, T.; Xia, L., Strategic behavior when allocating indivisible goods sequentially, (desJardins, M.; Littman, M. L., Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence. Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, Bellevue, Washington, USA, July 14-18, 2013 (2013), AAAI Press)
[54] Koller, D.; Friedman, N., Probabilistic Graphical Models - Principles and Techniques (2009), MIT Press
[55] Lee, J.; Meng, Y., Answer set programming modulo theories and reasoning about continuous changes, (Rossi, F., IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence. IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013 (2013), IJCAI/AAAI), 990-996
[56] Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; Scarcello, F., The DLV system for knowledge representation and reasoning, ACM Trans. Comput. Log., 7, 3, 499-562 (2006) · Zbl 1367.68308
[57] Lierler, Y., Relating constraint answer set programming languages and algorithms, Artif. Intell., 207, 1-22 (2014) · Zbl 1334.68041
[58] Lierler, Y.; Lifschitz, V., One more decidable class of finitely ground programs, (Hill, P. M.; Warren, D. S., Logic Programming, Proceedings of 25th International Conference. Logic Programming, Proceedings of 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009. Logic Programming, Proceedings of 25th International Conference. Logic Programming, Proceedings of 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Lecture Notes in Computer Science, vol. 5649 (2009), Springer), 489-493 · Zbl 1251.68064
[59] Lierler, Y.; Maratea, M.; Ricca, F., Systems, engineering environments, and competitions, AI Mag., 37, 3, 45-52 (2016)
[60] Lifschitz, V.; Turner, H., Splitting a logic program, (Hentenryck, P. V., Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming. Logic Programming, Proceedings of the Eleventh International Conference on Logic Programming, Santa Marherita Ligure, Italy, June 13-18, 1994 (1994), MIT Press), 23-37
[61] Maher, M. J., Constrained dependencies, Theor. Comput. Sci., 173, 1, 113-149 (1997) · Zbl 0902.68042
[62] Maier, D., The Theory of Relational Databases (1983), Computer Science Press · Zbl 0519.68082
[63] Ostrowski, M.; Schaub, T., ASP modulo CSP: the clingcon system, Theory Pract. Log. Program., 12, 4-5, 485-503 (2012) · Zbl 1260.68066
[64] Papadimitriou, C.; Yannakakis, M., A note on succinct representations of graphs, Inf. Comput., 71, 181-185 (1985) · Zbl 0616.68041
[65] Polleres, A., From SPARQL to rules (and back), (Williamson, C. L.; Zurko, M. E.; Patel-Schneider, P. F.; Shenoy, P. J., Proceedings of the 16th International Conference on World Wide Web. Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007 (2007), ACM), 787-796
[66] Redl, C., The DLVHEX system for knowledge representation: recent advances (system description) (2016), CoRR abs/1607.08864 · Zbl 1379.68304
[67] Ricca, F., The DLV Java wrapper, (Buccafurri, F., Joint Conference on Declarative Programming. Joint Conference on Declarative Programming, AGP-2003, Reggio Calabria, Italy, September 3-5, 2003 (2003)), 263-274
[68] Ricca, F.; Gallucci, L.; Schindlauer, R.; Dell’Armi, T.; Grasso, G.; Leone, N., OntoDLV: an ASP-based system for enterprise ontologies, J. Log. Comput., 19, 4, 643-670 (2009) · Zbl 1192.68132
[69] Samer, M., Variable dependencies of quantified CSPs, (Cervesato, I.; Veith, H.; Voronkov, A., Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of 15th International Conference. Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of 15th International Conference. Logic for Programming, Artificial Intelligence, and Reasoning, Proceedings of 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008, Lecture Notes in Computer Science, vol. 5330 (2008), Springer), 512-527 · Zbl 1182.68268
[70] Samer, M.; Szeider, S., Backdoor sets of quantified boolean formulas, J. Autom. Reason., 42, 1, 77-97 (2009) · Zbl 1191.68353
[71] Schaub, T.; Woltran, S., Answer set programming unleashed!, Künstl. Intell., 32, 2-3, 105-108 (2018), editorial, Special Issue on Answer Set Programming
[72] Schüller, P., The hexlite solver - lightweight and efficient evaluation of HEX programs, (Calimeri, F.; Leone, N.; Manna, M., Logics in Artificial Intelligence - Proceedings of 16th European Conference. Logics in Artificial Intelligence - Proceedings of 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019. Logics in Artificial Intelligence - Proceedings of 16th European Conference. Logics in Artificial Intelligence - Proceedings of 16th European Conference, JELIA 2019, Rende, Italy, May 7-11, 2019, Lecture Notes in Computer Science, vol. 11468 (2019), Springer), 593-607 · Zbl 07169133
[73] Schüller, P.; Weinzierl, A., Answer set application programming: a case study on Tetris, (Vos, M. D.; Eiter, T.; Lierler, Y.; Toni, F., Proceedings of the Technical Communications of the 31st International Conference on Logic Programming. Proceedings of the Technical Communications of the 31st International Conference on Logic Programming, ICLP 2015, Cork, Ireland, August 31 - September 4, 2015. Proceedings of the Technical Communications of the 31st International Conference on Logic Programming. Proceedings of the Technical Communications of the 31st International Conference on Logic Programming, ICLP 2015, Cork, Ireland, August 31 - September 4, 2015, CEUR Workshop Proceedings, vol. 1433 (2015), CEUR-WS.org)
[74] Strode, D. E., A dependency taxonomy for agile software development projects, Inf. Syst. Front., 18, 1, 23-46 (2016)
[75] Susman, B.; Lierler, Y., SMT-based constraint answer set solver EZSMT (system description), (Carro, M.; King, A.; Saeedloei, N.; Vos, M. D., Technical Communications of the 32nd International Conference on Logic Programming. Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA. Technical Communications of the 32nd International Conference on Logic Programming. Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA, OASICS, vol. 52 (2016), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik), 1:1-1:15
[76] Syrjänen, T., Including diagnostic information in configuration models, (Lloyd, J. W.; Dahl, V.; Furbach, U.; Kerber, M.; Lau, K.; Palamidessi, C.; Pereira, L. M.; Sagiv, Y.; Stuckey, P. J., Computational Logic - CL 2000, First International Conference. Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings. Computational Logic - CL 2000, First International Conference. Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings, Lecture Notes in Computer Science, vol. 1861 (2000), Springer), 837-851 · Zbl 0983.68653
[77] Terracina, G.; Leone, N.; Lio, V.; Panetta, C., Experimenting with recursive queries in database and logic programming systems, Theory Pract. Log. Program., 8, 2, 129-165 (2008) · Zbl 1142.68338
[78] Wolf, M., Program design and analysis, (Wolf, M., Computers as Components. Computers as Components, The Morgan Kaufmann Series in Computer Architecture and Desi (2017), Morgan Kaufmann), 221-319
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.