AppLP: A Dialogue on Applications of Logic Programming

04/07/2017 ∙ by David S. Warren, et al. ∙ 0

This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Conference on Logic Programming (ICLP) in Flushing, New York City.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References

  • [1] M. P. Ashley-Rollman et al. A Language for Large Ensembles of Independently Executing Nodes. In ICLP’09, pages 265–280. Springer LNCS 5649, 2009.
  • [2] I. Cervesato and E. S. Lam. Modular Multiset Rewriting. In Proceedings of LPAR’15, pages 1–17, Suva, Fiji, mber. Springer LNCS 9450.
  • [3] T. Frühwirth. Constraint Handling Rules. Cambridge University Press, 2009.
  • [4] Google Inc. Google Web Toolkit. Available at http://code.google.com/webtoolkit/.
  • [5] S. Grumbach and F. Wang. Netlog, a Rule-based Language for Distributed Programming. In PADL’10, pages 88–103. Springer LNCS 5937, 2010.
  • [6] K. Honda. Types for dyadic interaction. In Proceedings of CONCUR’93, pages 509––523. Springer LNCS 715, 1993.
  • [7] E. S. Lam. CoMingle: Distributed Logic Programming Language for Android Mobile Ensembles. Download at https://github.com/sllam/comingle, 2014.
  • [8] E. S. Lam and I. Cervesato. Comingle: Distributed Logic Programming for Decentralized Android Applications. Technical Report CMU-CS-15-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 2015.
  • [9] E. S. Lam, I. Cervesato, and N. F. Haque. Comingle: Distributed Logic Programming for Decentralized Mobile Ensembles. In COORDINATION’15. Springer LNCS 9037, 2015.
  • [10] B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. Declarative Networking: Language, Execution and Optimization. In SIGMOD’06, pages 97–108, 2006.
  • [11] D. McAllester. On the complexity analysis of static analyses. Journal of the ACM, 49(4):512–537, July 2002.

References

  • [1] A. K. Bandara, A. C. Kakas, E. C. Lupu, and A. Russo. Using argumentation logic for firewall configuration management. In Integrated Network Management, IM 2009. 11th IFIP/IEEE International Symposium on Integrated Network Management, Hofstra University, Long Island, NY, USA, June 1-5, 2009, pages 180–187. IEEE, 2009.
  • [2] A. K. Bandara, E. C. Lupu, J. Moffett, and A. Russo. Goal-based approach to policy refinement. In IEEE International Workshop on Policies for Distributed Systems and Networks, 2004.
  • [3] A. K. Bandara, E. C. Lupu, and A. Russo. Using event calculus to formalise policy specification and analysis. In IEEE International Workshop on Policies for Distributed Systems and Networks, 2003.
  • [4] C. Baral, M. Gelfond, and A. Provetti. Representing actions: Laws, observations and hypothesis. Journal of Logic Programming, 31, 1997.
  • [5] M. Y. Becker, C. Fournet, and A. D. Gordon. Secpal: Design and semantics of a decentralized authorization language. Journal of Computer Security, 18(4):619–665, 2010.
  • [6] M. Y. Becker, A. Russo, and N. Sultana. Foundations of logic-based trust management. In 2012 IEEE Symposium on Security and Privacy, pages 161–175. IEEE, 2012.
  • [7] J. Chomicki, J. Lobo, and S. Naqvi. Conflict resolution using logic programming. IEEE Transaction on Knowledge and Data Engineering, 2003.
  • [8] R. Craven, J. Lobo, J. Ma, A. Russo, E. Lupu, and A. Bandara. Expressive policy analysis with enhanced system dynamicity. In Proceedings on ASIACCS, 2009.
  • [9] M. Gelfond and V. Lifschitz. Action languages. Electron. Trans. Artificial Intelligence, 2, 1998.
  • [10] Y. Gurevich and I. Neeman. Dkal: Distributed-knowledge authorization language. In Computer Security Foundations Symposium, 2008. CSF’08. IEEE 21st, pages 149–162. IEEE, 2008.
  • [11] J. Lobo, R. Bhatia, and S. Naqvi. A policy description language. In Proceedings of AAAI, 1999.
  • [12] J. Ma, F. Le, A. Russo, and J. Lobo. Declarative framework for specification, simulation and analysis of distributed applications. IEEE Transaction on Knowledge and Data Engineering, 2016.
  • [13] J. Ma, F. Le, D. Wood, A. Russo, and J. Lobo. A declarative approach to distributed computing: Specification, execution and analysis. Theory and Practice of Logic Programming, 2013.
  • [14] J. Ma, A. Russo, K. Broda, and K. Clark. Dare: a system for distributed abductive reasoning. autonomous agents and multi-agent systems. 16:271–297, 2008.
  • [15] M.S.Sloman. Policy driven management for distributed systems. Journal of network and Systems Management, 2:333–360, 1994.
  • [16] E. Pasarella and J. Lobo. Reasoning about policy behavior in logic-based trust management systems: Some complexity results and an operational framework. In 2015 IEEE 28th Computer Security Foundations Symposium, pages 232–242. IEEE, 2015.
  • [17] A. Russo, R. Miller, B. Nuseibeh, and J. Kramer. An abductive approach for analysing event-based requirements specifications. In Proceedings of International Conference of Logic Programming, 2002.

References

  • [1] Alvianoi, M., Dodaro, C., Leone, N., Ricca, F.: Advances in WASP, In: In: LPNMR. LNCS, vol. 9345, pp. 40–54. Springer (2015)
  • [2] Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-Advisor: A Case Study in Answer Set Planning. In: LPNMR. LNCS, vol. 2173, pp. 439–442. Springer (2001)
  • [3] Baral, C., Uyan, C.: Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming. In: LPNMR. LNCS, vol. 2173, pp. 186–199. Springer (2001)
  • [4] Bravo, L., Bertossi, L.E.: Logic programs for consistently querying data integration systems. In: IJCAI-03, pp. 10–15. Morgan Kaufmann (2003)
  • [5] Bravo, L., Bertossi, L.E.: Deductive databases for computing certain and consistent answers from mediated data integration systems. J. Applied Logic 3(1), 329–367 (2005)
  • [6] Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92–103 (2011)
  • [7] Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: Design and results of the Fifth Answer Set Programming Competition. Artif. Intell. 231, 151–181 (2016)
  • [8] Campeotto, F., Dovier, A., Pontelli, E.: A declarative concurrent system for protein structure prediction on GPU. J. Exp. Theor. Artif. Intell. 27(5), 503–541 (2015)
  • [9] Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. In: IEEE Conference on Computational Complexity. pp. 82–101 (1997)
  • [10] Dodaro, C., Gasteiger, P., Leone, N., Musitsch, B., Ricca F. and Shchekotykhin K.: Combining Answer Set Programming and Domain Heuristics for Solving Hard Industrial Problems (Application Paper). TPLP 16(5-6), 612–625, Special issue of ICLP 2016.
  • [11] Dodaro, C., Leone, N., Nardi, B., Ricca, F.: Allotment problem in travel industry: A solution based on ASP. In: RR 2015, LNCS, vol. 9209, pp. 77–92. Springer (2015)
  • [12] Eiter, T., Gottlob, G., Mannila, H.: Disjunctive datalog. ACM Trans. Database Syst. 22(3), 364–418 (1997)
  • [13] Erdem, E., Öztok, U.: Generating explanations for biomedical queries. TPLP 15(1), 35–78 (2015)
  • [14] Erdem, E., Patoglu, V., Saribatur, Z.G., Schüller, P., Uras, T.: Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach. TPLP 13(4-5), 831–846 (2013)
  • [15] Febbraro, O., Leone, N., Grasso, G., Ricca, F.: JASP: A framework for integrating answer set programming with java. In: KR 2012. AAAI Press (2012)
  • [16] Febbraro, O., Reale, K., Ricca, F.: ASPIDE: integrated development environment for answer set programming. In: LPNMR 2011, LNCS, vol. 6645, pp. 317–330. Springer (2011)
  • [17] Friedrich, G.: Industrial success stories of ASP and CP: What’s still open? (2015), joint invited talk at ICLP and CP 2015 - http://booleconferences.ucc.ie/iclp2015speakers
  • [18] Gaggl, S.A., Manthey, N., Ronca, A., Wallner, J.P., Woltran, S.: Improved answer-set programming encodings for abstract argumentation. TPLP 15(4-5), 434–448 (2015)
  • [19] Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Comput. 9(3/4), 365–386 (1991)
  • [20] Grasso, G., Leone, N., Manna, M., Ricca, F.: ASP at Work: Spin-off and Applications of the DLV System. In: Festschrift in Honor of Michael Gelfond. LNCS, vol. 6565, pp. 432–451. Springer (2011)
  • [21] Koponen, L., Oikarinen, E., Janhunen, T., Säilä, L.: Optimizing phylogenetic supertrees using answer set programming. TPLP 15(4-5), 604–619 (2015)
  • [22] Leone, N., et. al: The INFOMIX system for advanced integration of incomplete and inconsistent data. In: ACM SIGMOD, pp. 915–917. ACM (2005)
  • [23] 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)
  • [24] Manna, M., Ricca, F., Terracina, G.: Taming primary key violations to query large inconsistent data via ASP. TPLP 15(4-5), 696–710 (2015)
  • [25] Marileo, M.C., Bertossi, L.E.: The consistency extractor system: Answer set programs for consistent query answering in databases. Data Knowl. Eng. 69(6), 545–572 (2010)
  • [26] Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the gioia-tauro seaport. TPLP 12(3), 361–381 (2012)
  • [27] Terracina, G., Martello, A., Leone, N.: Logic-based techniques for data cleaning: An application to the italian national healthcare system. In: LPNMR 2013, LNCS, vol. 8148, pp. 524–529. Springer (2013)

References

  • [1] Baral, C. 2003. Knowledge Representation - Reasoning & Declarative Problem Solving. Cambridge Univ. Press.
  • [2] Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In International Conference and Symposium, 1070–1080.
  • [3] K. Marple, G. Gupta Goal-directed execution of answer set programs. Proc. PPDP 2012: 35-44
  • [4] K. Marple, G. Gupta. Dynamic Consistency Checking in Goal-Directed Answer Set Programming. TPLP 14(4-5): 415-427 (2014)
  • [5] K. Marple, E. Salazar, G. Gupta. The s(ASP) system. https://sourceforge.net/projects/sasp-system/
  • [6] K. Marple, E. Salazar, G. Gupta. Computing Stable Models of Normal Logic Programs without Grounding. Forthcoming paper. March 2017.
  • [7] Zhuo Chen, Kyle Marple, Elmer Salazar, Gopal Gupta, Lakshman Tamil. A Physician Advisory System for Chronic Heart Failure management based on knowledge patterns. TPLP 16(5-6):604-618, 2016.
  • [8] Martin Gebser, Benjamin Kaufmann, André Neumann, Torsten Schaub. clasp: A Conflict-Driven Answer Set Solver, LPNMR 07, 2007. https://potassco.org/.

References

  • [1] N. Bjørner, A. Gurfinkel, K. L. McMillan, and A. Rybalchenko. Horn clause solvers for program verification. In L. D. Beklemishev, A. Blass, N. Dershowitz, B. Finkbeiner, and W. Schulte, editors, Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday, volume 9300 of Lecture Notes in Computer Science, pages 24–51. Springer, 2015.
  • [2] L. de Moura and N. Bjørner. Z3: an efficient SMT solver. In TACAS, 2008.
  • [3] A. Fogel, S. Fung, L. Pedrosa, M. Walraed-Sullivan, R. Govindan, R. Mahajan, and T. D. Millstein. A general approach to network configuration analysis. In 12th USENIX Symposium on Networked Systems Design and Implementation, NSDI 15, Oakland, CA, USA, May 4-6, 2015, pages 469–483. USENIX Association, 2015.
  • [4] S. Grebenshchikov, N. P. Lopes, C. Popeea, and A. Rybalchenko. Synthesizing software verifiers from proof rules. In J. Vitek, H. Lin, and F. Tip, editors, ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI ’12, Beijing, China - June 11 - 16, 2012, pages 405–416. ACM, 2012.
  • [5] A. Gurfinkel. Algorithmic logic-based verification with seahorn. In L. Kovács, V. Negru, T. Ida, T. Jebelean, D. Petcu, S. M. Watt, and D. Zaharie, editors, 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2015, Timisoara, Romania, September 21-24, 2015, pages 12–15. IEEE Computer Society, 2015.
  • [6] K. Hoder and N. Bjørner. Generalized property directed reachability. In SAT, 2012.
  • [7] K. Hoder, N. Bjørner, and L. M. de Moura. Z- an efficient engine for fixed points with constraints. In G. Gopalakrishnan and S. Qadeer, editors, Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings, volume 6806 of Lecture Notes in Computer Science, pages 457–462. Springer, 2011.
  • [8] T. Koponen, K. Amidon, P. Balland, M. Casado, A. Chanda, B. Fulton, I. Ganichev, J. Gross, P. Ingram, E. J. Jackson, A. Lambeth, R. Lenglet, S. Li, A. Padmanabhan, J. Pettit, B. Pfaff, R. Ramanathan, S. Shenker, A. Shieh, J. Stribling, P. Thakkar, D. Wendlandt, A. Yip, and R. Zhang. Network virtualization in multi-tenant datacenters. In R. Mahajan and I. Stoica, editors, Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2014, Seattle, WA, USA, April 2-4, 2014, pages 203–216. USENIX Association, 2014.
  • [9] B. T. Loo, J. M. Hellerstein, I. Stoica, and R. Ramakrishnan. Declarative routing: extensible routing with declarative queries. In R. Guérin, R. Govindan, and G. Minshall, editors, Proceedings of the ACM SIGCOMM 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Philadelphia, Pennsylvania, USA, August 22-26, 2005, pages 289–300. ACM, 2005.
  • [10] N. Lopes, N. Bjørner, P. Godefroid, K. Jayaraman, and G. Varghese. Checking beliefs in dynamic networks. In NSDI, 2015.
  • [11] K. L. McMillan. Lazy annotation revisited. In A. Biere and R. Bloem, editors, Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, volume 8559 of Lecture Notes in Computer Science, pages 243–259. Springer, 2014.
  • [12] G. D. Plotkin, N. Bjørner, N. P. Lopes, A. Rybalchenko, and G. Varghese. Scaling network verification using symmetry and surgery. In R. Bodík and R. Majumdar, editors, Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, January 20 - 22, 2016, pages 69–83. ACM, 2016.
  • [13] T. W. Reps, S. Sagiv, and R. Wilhelm. Static program analysis via 3-valued logic. In R. Alur and D. A. Peled, editors, Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings, volume 3114 of Lecture Notes in Computer Science, pages 15–30. Springer, 2004.

References

  • [1] J. Bos. Open-domain semantic parsing with boxer. In B. Megyesi, editor, Proceedings of the 20th Nordic Conference of Computational Linguistics, NODALIDA 2015, May 11-13, 2015, Institute of the Lithuanian Language, Vilnius, Lithuania, pages 301–304. Linköping University Electronic Press / ACL, 2015.
  • [2] A. Colmerauer. Metamorphosis Grammars, volume 63, pages 133–189. Springer-Verlag, 1978.
  • [3] J. R. Curran, S. Clark, and J. Bos. Linguistically motivated large-scale NLP with c&c and boxer. In J. A. Carroll, A. van den Bosch, and A. Zaenen, editors, ACL 2007, Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, June 23-30, 2007, Prague, Czech Republic. The Association for Computational Linguistics, 2007.
  • [4] V. Dahl. Natural language processing and logic programming. Journal of Logic Programming, 12(1):681–714, 1994.
  • [5] V. Dahl, P. Tarau, and R. Li. Assumption Grammars for Processing Natural Language. In L. Naish, editor, Proceedings of the Fourteenth International Conference on Logic Programming, pages 256–270, MIT press, 1997.
  • [6] D. Fierens, G. Van den Broeck, J. Renkens, D. Shterionov, B. Gutmann, I. Thon, G. Janssens, and L. De Raedt. Inference and learning in probabilistic logic programs using weighted Boolean formulas. Theory and Practice of Logic Programming, 2013.
  • [7] E. Figa and P. Tarau. Story Traces and Projections: Exploring the Patterns of Storytelling. In N. Braun and U. Spierling, editors, TIDSE’2003, Darmstadt, Germany, Mar. 2003.
  • [8] E. Figa and P. Tarau. The VISTA Project: An Agent Architecture for Virtual Interactive Storytelling. In N. Braun and U. Spierling, editors, TIDSE’2003, Darmstadt, Germany, Mar. 2003.
  • [9] R. Kowalski. Logic for Problem Solving. North-Holland, 1979.
  • [10] Q. Le and T. Mikolov. Distributed representations of sentences and documents. In Proceedings of The 31st International Conference on Machine Learning, pages 1188–1196, 2014.
  • [11] Y. LeCun, Y. Bengio, and G. Hinton. Deep learning. Nature, 521(7553):436–444, 2015.
  • [12] Y. Lierler and P. Schüller. Parsing combinatory categorial grammar via planning in answer set programming. In Correct Reasoning, pages 436–453. Springer, 2012.
  • [13] R. Mihalcea and P. Tarau. TextRank: Bringing Order into Texts. In Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP 2004), Barcelona, Spain, July 2004.
  • [14] R. Mihalcea, P. Tarau, and E. Figa. PageRank on Semantic Networks, with application to Word Sense Disambiguation. In Proceedings of The 20st International Conference on Computational Linguistics (COLING 2004), Geneva, Switzerland, Aug. 2004.
  • [15] R. F. Mihalcea and D. R. Radev. Graph-based Natural Language Processing and Information Retrieval. Cambridge University Press, New York, NY, USA, 1st edition, 2011.
  • [16] L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998.
  • [17] F. Pereira and D. Warren. Definite clause grammars for language analysis - a survey of the formalism and a comparison with transition networks. Artificial Intelligence, 13:231–278, 1980.
  • [18] P. Tarau, K. De Bosschere, V. Dahl, and S. Rochefort. LogiMOO: an Extensible Multi-User Virtual World with Natural Language Control. Journal of Logic Programming, 38(3):331–353, Mar. 1999.
  • [19] D. S. Warren. Using Lambda-Calculus to Represent Meanings in Logic Grammars. In Proceedings of the 21st Annual Meeting on Association for Computational Linguistics, ACL ’83, pages 51–56, Stroudsburg, PA, USA, 1983. Association for Computational Linguistics.