chapter

Logic programming applications: what are the abstractions and implementations?

Author:

Yanhong A. LiuAuthors Info & Claims

Declarative Logic Programming: Theory, Systems, and Applications

September 2018

Pages 519 - 548

https://doi.org/10.1145/3191315.3191326

Published: 01 September 2018 Publication History

Abstract

This chapter presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases: The Logical Level. Addison-Wesley. 534, 546

Digital Library

[2]

P. Alvaro, T. Condie, N. Conway, J. Hellerstein, and R. Sears. 2010. I do declare: Consensus in a logic language. ACM SIGOPS Operating Systems Review, 43(4): 25--30. 544

Digital Library

[3]

L. O. Andersen. 1994. Program Analysis and Specialization for the C Programming Language. Ph.D. thesis, DIKU, University of Copenhagen. http://www.diku.dk/forskning/topps/bibliography/1994.html. 535

[4]

ANSI INCITS, February 2004. Role-Based Access Control. ANSI INCITS 359-2004, American National Standards Institute, International Committee for Information Technology Standards. 529, 531

[5]

K. R. Apt, D. S. Warren, and M. Truszczynski, editors. 1999. The Logic Programming Paradigm: A 25-Year Perspective. Springer. 546

Digital Library

[6]

M. Aref, B. ten Cate, T. J. Green, B. Kimelfeld, D. Olteanu, E. Pasalic, T. L. Veldhuizen, and G. Washburn. 2015. Design and implementation of the LogicBlox system. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1371--1382. 531, 535, 539, 542

Digital Library

[7]

M. P. Ashley-Rollman, P. Lee, S. C. Goldstein, P. Pillai, and J. D. Campbell. 2009. A language for large ensembles of independently executing nodes. In Proceedings of the 25th International Conference on Logic Programming, pp. 265--280. Springer. 544

Digital Library

[8]

M. Balduccini and M. Gelfond. 2005. Model-based reasoning for complex flight systems. In Proceedings of the 5th AIAA Conference on Aviation, Technology, Integration, and Operations. 543

[9]

S. Barker and M. Fernández. 2006. Term rewriting for access control. In Data and Applications Security XX, pp. 179--193. Springer. 532

[10]

S. Barker, M. Leuschel, and M. Varea. 2004. Efficient and flexible access control via logic program specialisation. In Proceedings of the 2004 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 190--199. 532

Digital Library

[11]

R. Basseda, M. Kifer, and A. J. Bonner. 2014. Planning with transaction logic. In Proceedings of the 8th International Conference on Web Reasoning and Rule Systems, pp. 29--44. Springer. 542

[12]

M. Y. Becker. 2005a. A formal security policy for an NHS electronic health record service. Technical Report UCAM-CL-TR-628, Computer Laboratory, University of Cambridge. http://www.cl.cam.ac.uk/TechReports/UCAM-CL-TR-628.html. 536

[13]

M. Y. Becker. 2005b. Cassandra: Flexible trust management and its application to electronic health records. Ph.D. dissertation, Technical Report UCAM-CL-TR-648, Computer Laboratory, University of Cambridge. http://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-648.html. 536

[14]

M. Y. Becker and P. Sewell. 2004. Cassandra: Flexible trust management, applied to electronic health records. In Proceedings of the 17th IEEE Computer Security Foundations Workshop, pp. 139--154. IEEE CS Press. 536

Digital Library

[15]

M. Y. Becker, A. Russo, and N. Sultana. 2012. Foundations of logic-based trust management. In Proceedings of the 2012 IEEE Symposium on Security and Privacy, pp. 161--175. IEEE CS Press. 536

Digital Library

[16]

J. Bell and B. Stevens. 2009. A survey of known results and research areas for n-queens. Discrete Mathematics, 309(1): 1--31. 540

Digital Library

[17]

Berkeley Orders of Magnitude. 2013. Bloom Programming Language. http://www.bloom-lang.net. Lastest release April 23, 2013. Accessed January 14, 2017. 544

[18]

M. Blaze, J. Feigenbaum, and J. Lacy. 1996. Decentralized trust management. In Proceedings of the 1996 IEEE Symposium on Security and Privacy, pp. 164--173. 535

Digital Library

[19]

P. A. Bonatti. 2010. Datalog for security, privacy and trust. In Proceedings of the 1st International Conference on Datalog Reloaded, pp. 21--36. Springer. 536

Digital Library

[20]

A. J. Bonner and M. Kifer. 1994. An overview of transaction logic. Theoretical Computer Science, 133(2): 205--265. 542

Digital Library

[21]

M. Bravenboer and Y. Smaragdakis. 2009. Strictly declarative specification of sophisticated points-to analyses. In Proceedings of the 24rd ACM SIGPLAN Conference on Object Oriented Programming Systems Languages and Applications, pp. 243--262. 535

Digital Library

[22]

M. Bruynooghe, H. Blockeel, B. Bogaerts, B. De Cat, S. De Pooter, J. Jansen, A. Labarre, J. Ramon, M. Denecker, and S. Verwer. 2014. Predicate logic as a modeling language: Modeling and solving some machine learning and data mining problems with IDP3. Theory and Practice of Logic Programming, pp. 1--35. 547

[23]

A. Burton, R. Kowalski, M. Gacic-Dobo, R. Karimov, and D. Brown. October 2012. A formal representation of the WHO and UNICEF estimates of national immunization coverage: A computational logic approach. PLOS ONE. 543

[24]

S. Ceri, G. Gottlob, and L. Tanca. 1990. Logic Programming and Databases. Springer. 546

Digital Library

[25]

P. Ciancarini and L. Sterling. 1995. Report on the Workshop: Applications of Logic Programming in Software Engineering. The Knowledge Engineering Review, 10(01): 97--100. 547

[26]

A. Cimatti, S. Edelkamp, M. Fox, and E. Plaku, November 23--28, 2014. Dagstuhl Seminar 14482: Automated Planning and Model Checking. http://www.dagstuhl.de/no_cache/en/program/calendar/semhp/?semnr=14482. Accessed June 6, 2015. 543

[27]

E. M. Clarke, O. Grumberg, and D. E. Long. 1994. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5): 1512--1542. 543

Digital Library

[28]

E. M. Clarke, Jr., O. Grumberg, and D. A. Peled. 1999. Model Checking. MIT Press. 543

Digital Library

[29]

A. Dal Palù and P. Torroni. 2010. 25 years of applications of logic programming in Italy. In A 25-Year Perspective on Logic Programming, pp. 300--328. Springer. 547

[30]

C. V. Damásio, A. Analyti, and G. Antoniou. 2013. Justifications for logic programming. In Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 530--542. Springer. 543

Digital Library

[31]

E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys, 33(3): 374--425. 546

Digital Library

[32]

O. de Moor, D. Lacey, and E. V. Wyk. 2003. Universal regular path queries. Higher-Order and Symbolic Computation, 16(1--2): 15--35. 542

Digital Library

[33]

L. De Raedt, A. Kimmig, and H. Toivonen. 2007. ProbLog: A probabilistic Prolog and its application in link discovery. In Proceedings of the 20th International Joint Conference on Artifical Intelligence, pp. 2468--2473. Morgan Kaufman. 544

Digital Library

[34]

B. Demoen, P.-L. Nguyen, T. Schrijvers, and R. Troncon, 2005. The first 10 Prolog programming contests. http://dtai.cs.kuleuven.be/ppcbook/. Accessed May 20, 2015. 541

[35]

M. Denecker and E. Ternovska. 2008. A logic of nonmonotone inductive definitions. ACM Transactions on Computational Logic, 9(2): 14. 525

Digital Library

[36]

J. DeTreville. 2002. Binder, a logic-based security language. In Proceedings of the 2002 IEEE Symposium on Security and Privacy, pp. 105--113. IEEE CS Press. 536

Digital Library

[37]

A. Dovier and E. Pontelli, editors 2010. A 25-year Perspective on Logic Programming: Achievements of the Italian Association for Logic Programming, GULP. Springer. 546

Digital Library

[38]

S. Edelkamp, D. Magazzeni, and E. Plaku. June 23, 2014. Workshop on Model Checking and Automated Planning (MOCHAP'14), Portsmouth, NH. http://icaps14.icaps-conference.org/workshops_tutorials/mochap.html. Accessed June 6, 2015. 543

[39]

D. Edmunds, 2015. Learning constraint logic programming---finite domains with logic puzzles. http://brownbuffalo.sourceforge.net/. Accessed May 20, 2015. 541

[40]

C. Ellison, B. Frantz, B. Lampson, R. L. Rivest, B. Thomas, and T. Ylonen, September 1999. RFC 2693: SPKI Certificate Theory. http://www.ietf.org/rfc/rfc2693.txt. Accessed June 4, 2015. 536

Digital Library

[41]

D. Ferraiolo and R. Kuhn.1992. Role-based access control. In Proceedings of the 15th NIST-NSA National Computer Security Conference, pp. 554--563. Baltimore, MD. 531

[42]

D. F. Ferraiolo, R. Sandhu, S. Gavrila, D. R. Kuhn, and R. Chandramouli. 2001. Proposed NIST standard for role-based access control. ACM Transactions on Information and Systems Security, 4(3): 224--274. 531

Digital Library

[43]

M. Fitting. 2002. Fixpoint semantics for logic programming: A survey. Theoretical Computer Science, 278(1): 25--51. 546

Digital Library

[44]

H. Ganzinger and D. A. McAllester. 2001. A new meta-complexity theorem for bottom-up logic programs. In Proceedings of the 1st International Joint Conference on Automated Reasoning, pp. 514--528. Springer. 534

Digital Library

[45]

A. Gavrila and J. Barkley. 1998. Formal specification for RBAC user/role and role relationship management. In Proceedings of the 3rd ACM Workshop on Role Based Access Control, pp. 81--90. 531

Digital Library

[46]

M. Gebser, R. Kaminski, B. Kaufmann, and T. Schaub. 2012. Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool. 539, 540

Digital Library

[47]

M. Gebser, M. Maratea, and F. Ricca. 2017. The sixth answer set programming competition. Journal of Artificial Intelligence Research, 60: 41--95. 547

Digital Library

[48]

M. Gelfond and V. Lifschitz. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium on Logic Programming, pp. 1070--1080. MIT Press. 525

[49]

A. S. Gomes, J. J. Alferes, and T. Swift. 2010. Implementing query answering for hybrid MKNF knowledge bases. In Proceedings of the 12th International Conference on Practical Aspects of Declarative Languages, pp. 25--39. Springer. 530

Digital Library

[50]

T. Grandison and M. Sloman. 2000. A survey of trust in Internet applications. IEEE Communications Surveys and Tutorials, 3(4): 2--16. 536

Digital Library

[51]

G. Grasso, S. Iiritano, N. Leone, and F. Ricca. 2009. Some DLV applications for knowledge management. In E. Erdem, F. Lin, and T. Schaub, editors, Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 591--597. Springer. 547

Digital Library

[52]

G. Grasso, N. Leone, M. Manna, and F. Ricca. 2011. ASP at work: Spin-off and applications of the DLV system. In Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning---Essays Dedicated to Michael Gelfond on the Occasion of His 65th Birthday, pp. 432--451. Springer. 547

Digital Library

[53]

G. Grasso, N. Leone, and F. Ricca. 2013. Answer set programming: Language, applications and development tools. In Proceedings of the 7th International Conference on Web Reasoning and Rule Systems, pp. 19--34. Springer. 546

Digital Library

[54]

T. J. Green, M. Aref, and G. Karvounarakis. 2012. LogicBlox, platform and language: A tutorial. In Proceedings of the 2nd International Conference on Datalog in Academia and Industry, Datalog 2.0, pp. 1--8. Springer. 531, 535, 539, 542, 543

Digital Library

[55]

B. Grosof, J. Bloomfield, P. Fodor, M. Kifer, I. Grosof, M. Calejo, and T. Swift. 2015. Automated decision support for financial regulatory/policy compliance, using textual Rulelog. In Proceedings of the Rule ML 2015 Challenge, the Special Track on Rule-based Recommender Systems for the Web of Data, the Special Industry Track and the RuleML 2015 Doctoral Consortium. http://ceur-ws.org/Vol-1417/. 546

[56]

T. W. K.-B. S. Group, Aug. 2005. WP5 report: Model applications and proofs-of-concept. http://www.kr.tuwien.ac.at/research/projects/WASP/report.pdf. Accessed May 20, 2015. 543, 547

[57]

E. Hajiyev, M. Verbaere, and O. D. Moor. 2006. CodeQuest: Scalable source code queries with Datalog. In Proceedings of the 20th European Conference on Object-Oriented Programming, pp. 2--27. Springer. 535

Digital Library

[58]

N. Heintze and O. Tardieu. 2001a. Demand-driven pointer analysis. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pp. 24--34. 535

Digital Library

[59]

N. Heintze and O. Tardieu. 2001b. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation, pp. 254--263. 535

Digital Library

[60]

W. Hett, 2015. Prolog Site---Prolog Problems. http://sites.google.com/site/prologsite/prolog-problems/. Accessed May 28, 2015. 541

[61]

M. Hind. 2001. Pointer analysis: Haven't we solved this problem yet? In Proceedings of the 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, pp. 54--61. 535

Digital Library

[62]

P. Hou, B. De Cat, and M. Denecker. 2010. FO(FD): Extending classical logic with rule-based fixpoint definitions. Theory and Practice of Logic Programming, 10(4--6): 581--596. 525

Digital Library

[63]

K. Hristova, K. T. Tekle, and Y. A. Liu. 2007. Efficient trust management policy analysis from rules. In Proceedings of the 9th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 211--220. 536

Digital Library

[64]

S. S. Huang, T. J. Green, and B. T. Loo. 2011. Datalog and emerging applications: An interactive tutorial. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data, pp. 1213--1216. 547

Digital Library

[65]

Y. E. Ioannidis. March 1996. Query optimization. ACM Computing Surveys, 28(1): 121--123. 529

Digital Library

[66]

J. Jaffar and M. J. Maher. 1994. Constraint logic programming: A survey. Journal of Logic Programming, 19: 503--581. 546

[67]

T. Jim. 2001. SD3: A trust management system with certified evaluation. In Proceedings of the 2001 IEEE Symposium on Security and Privacy, pp. 106--115. IEEE CS Press. 536

Digital Library

[68]

M. Kifer, G. Lausen, and J. Wu. 1995. Logical foundations of object-oriented and frame-based languages. Journal of the ACM, 42(4): 741--843. 545

Digital Library

[69]

M. Kifer, A. Bernstein, and P. M. Lewis. 2006. Database Systems: An Application Oriented Approach, Complete Version, 2nd. Addison-Wesley. 529

Digital Library

[70]

M. Kifer, G. Yang, H. Wan, and C. Zhao. July 2014. Flora-2: User's Manual Version 1.0. Stony Brook University. http://flora.sourceforge.net/. Accessed June 6, 2015. 545

[71]

H. Kjellerstrand, 2015. My Picat page. http://www.hakank.org/picat/. Accessed May 29, 2015. 541

[72]

R. Kowalski. 2014. Logic programming. In D. M. Gabbay, J. H. Siekmann, and J. Woods, editors, Computational Logic, vol. 9 of Handbook of the History of Logic, pp. 523--569. Elsevier. 546

[73]

R. Kowalski and F. Sadri. 2015. Reactive computing as model generation. New Generation Computing, 33(1): 33--67. 542

Digital Library

[74]

A. Lally and P. Fodor. March 31, 2011. Natural language processing with Prolog in the IBM Watson system. Association for Logic Programming (ALP) Issue, Featured Articles. http://www.cs.nmsu.edu/ALP/2011/03/natural-language-processing-with-prolog-in-the-ibm-watsonsystem/. Accessed April 23, 2015. 535

[75]

A. Lally, J. M. Prager, M. C. McCord, B. K. Boguraev, S. Patwardhan, J. Fan, P. Fodor, and J. Chu-Carroll. 2012. Question analysis: How Watson reads a clue. IBM Journal of Research and Development, 56(3/4): 2:1--2:13. 535

Digital Library

[76]

C. E. Landwehr, C. L. Heitmeyer, and J. McLean. 1984. A security model for military message systems. ACM Transactions on Computer Systems, 2(3): 198--222. 531

Digital Library

[77]

N. Leone and F. Ricca. 2015. Answer Set Programming: A tour from the basics to advanced development tools and industrial applications. In Proceedings of the 11th International Summer School on Reasoning Web, pp. 308--326. Springer. 540, 547

[78]

N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. July 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3): 499--562. 539, 540

Digital Library

[79]

M. Leuschel and M. Butler. 2008. ProB: An automated analysis toolset for the B method. International Journal on Software Tools for Technology Transfer, 10(2): 185--203. 544

Digital Library

[80]

M. Ley. 2002. The DBLP computer science bibliography: Evolution, research issues, perspectives. In Proceedings of the 9th International Symposium on String Processing and Information Retrieval, pp. 1--10. Springer. 529

Digital Library

[81]

N. Li and J. C. Mitchell. 2003. Datalog with constraints: A foundation for trust management languages. In Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages, pp. 58--73. Springer. 536

Digital Library

[82]

N. Li, J. C. Mitchell, and W. H. Winsborough. 2002. Design of a role-based trust-management framework. In IEEE Symposium on Security and Privacy, pp. 114--130. 536

Digital Library

[83]

Y. A. Liu and S. D. Stoller. 2006. Querying complex graphs. In Proceedings of the 8th International Symposium on Practical Aspects of Declarative Languages, pp. 199--214. Springer. 542

Digital Library

[84]

Y. A. Liu and S. D. Stoller. 2007. Role-based access control: A corrected and simplified specification. In Department of Defense Sponsored Information Security Research: New Methods for Protecting Against Cyber Threats, pp. 425--439. Wiley. 532

[85]

Y. A. Liu and S. D. Stoller. 2009. From Datalog rules to efficient programs with time and space guarantees. ACM Transactions on Programming Languages and Systems, 31(6): 1--38. 534

Digital Library

[86]

Y. A. Liu and S. D. Stoller. Jan. 2018. Founded semantics and constraint semantics of logic rules. In International Symposium on Logical Foundations of Computer Science, vol. 10703 of Lecture Notes in Computer Science, pp. 221--241. Springer. 525

[87]

Y. A. Liu, T. Rothamel, F. Yu, S. Stoller, and N. Hu. 2004. Parametric regular path queries. In Proceedings of the ACM SIGPLAN 2004 Conference on Programming Language Design and Implementation, pp. 219--230. 542

Digital Library

[88]

Y. A. Liu, C. Wang, M. Gorbovitski, T. Rothamel, Y. Cheng, Y. Zhao, and J. Zhang. 2006. Core role-based access control: Efficient implementations by transformations. In Proceedings of the ACM SIGPLAN 2006 Workshop on Partial Evaluation and Program Manipulation, pp. 112--120. 532

Digital Library

[89]

Y. A. Liu, J. Brandvein, S. D. Stoller, and B. Lin. 2016. Demand-driven incremental object queries. In Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, pp. 228--241. ACM Press. 527, 529

Digital Library

[90]

LogicBlox. 2015a. Assortment planning and management. http://www.logicblox.com/solution-four.html. Accessed May 18, 2015. 540

[91]

LogicBlox. 2015b. Solutions. http://www.logicblox.com/solutions.html. Accessed May 18, 2015. 543

[92]

B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. 2009. Declarative networking. Communications of the ACM, 52: 87--95. 544

Digital Library

[93]

M. Malita, 2015. Logic puzzles in Prolog. http://www.anselm.edu/internet/compsci/faculty_staff/mmalita/HOMEPAGE/logic/index.html. Accessed May 28, 2015. 541

[94]

D. A. McAllester. 1999. On the complexity analysis of static analyses. In Proceedings of the 6th International Static Analysis Symposium, pp. 312--329. Springer. 534, 535

Digital Library

[95]

J. Minker, D. Seipel, and C. Zaniolo. 2014. Logic and databases: History of deductive databases. In D. Gabbay, J. Siekmann, and J. Woods, editors, Handbook of Computational Logic, chap. 17, pp. 571--628. North-Holland. 546

[96]

M. Nogueira, M. Balduccini, M. Gelfond, R. Watson, and M. Barry. 2001. An A-Prolog decision support system for the Space Shuttle. In Practical Aspects of Declarative Languages, pp. 169--183. Springer. 543

Digital Library

[97]

F. C. Pereira and S. M. Shieber. 2002. Prolog and Natural-Language Analysis. Microtome Publishing. http://mtome.com/Publications/PNLA/pnla.html. Revision of October 5, 2005. 535

[98]

T. C. Przymusinski. 1994. Well-founded and stationary models of logic programs. Annals of Mathematics and Artificial Intelligence, 12(3): 141--187. 525

[99]

C. Ramakrishnan, I. Ramakrishnan, S. A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V. Venkatakrishnan. 2000. XMC: A logic-programming-based verification toolset. In Proceedings of the 12th International Conference on Computer Aided Verification, pp. 576--580. Springer. 544

Digital Library

[100]

R. Ramakrishnan and J. D. Ullman. 1995. A survey of deductive database systems. Journal of Logic Programming, 23(2): 125--149. 546

[101]

F. Ricca, L. Gallucci, R. Schindlauer, T. Dell'Armi, G. Grasso, and N. Leone. 2009. OntoDLV: An ASP-based system for enterprise ontologies. Journal of Logic and Computation, 19(4): 643--670. 545, 546

Digital Library

[102]

F. Ricca, G. Grasso, M. Alviano, M. Manna, V. Lio, S. Iiritano, and N. Leone. 2012. Team-building with answer set programming in the Gioia-Tauro Seaport. Theory and Practice of Logic Programming, 12(3): 361--381. 540, 547

Digital Library

[103]

A. Roth. 1993. The practical application of Prolog. AI Expert, 8: 24--24. In Dr. Dobb's, http://www.drdobbs.com/parallel/the-practical-application-of-prolog/184405220, December 10, 2002. Accessed June 6, 2015. 547

[104]

T. Rothamel and Y. A. Liu. 2007. Efficient implementation of tuple pattern based retrieval. In Proceedings of the ACM SIGPLAN 2007 Workshop on Partial Evaluation and Program Manipulation, pp. 81--90. 527

Digital Library

[105]

A. Roychoudhury, C. Ramakrishnan, and I. Ramakrishnan. 2000. Justifying proofs using memo tables. In Proceedings of the 2nd ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 178--189. 543

Digital Library

[106]

S. Ruohomaa and L. Kutvonen. 2005. Trust management survey. In Proceedings of the Third international conference on Trust Management, pp. 77--92. Springer. 536

Digital Library

[107]

D. Saha and C. R. Ramakrishnan. 2005. Incremental and demand-driven points-to analysis using logic programming. In Proceedings of the 7th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 117--128. 535

Digital Library

[108]

T. Sato and Y. Kameya. 1997. PRISM: A language for symbolic-statistical modeling. In Proceedings of the 15th International Joint Conference on Artifical Intelligence-Vol. 2, pp. 1330--1335. Morgan Kaufman. 544

Digital Library

[109]

T. Schaub, March 2011. Collection on Answer Set Programming (ASP) and more. http://www.cs.uni-potsdam.de/~torsten/asp/. Accessed May 18, 2015. 543, 547

[110]

T. Schaub, Dec. 23, 2014. Answer set solving in practice. http://www.cs.uni-potsdam.de/~torsten/Potassco/Slides/asp.pdf. Accessed May 20, 2015. 541

[111]

Semafora, 2012. Semantic infrastructure: OntoBroker. http://www.semafora-systems.com/en/products/ontobroker/. Accessed May 18, 2015. 545, 546

[112]

Y. Smaragdakis and G. Balatsouras. 2015. Pointer analysis. Foundations and Trends in Programming Languages, 2(1): 1--69. 535, 547

Digital Library

[113]

M. Sridharan, S. Chandra, J. Dolby, S. J. Fink, and E. Yahav. 2013. Alias analysis for object-oriented programs. In Aliasing in Object-Oriented Programming: Types, Analysis and Verification, pp. 196--232. Springer. 535

Digital Library

[114]

S. D. Stoller, P. Yang, M. I. Gofman, and C. Ramakrishnan. 2011. Symbolic reachability analysis for parameterized administrative role-based access control. Computers & Security, 30(2): 148--164. 543

Digital Library

[115]

N. Sultana, M. Y. Becker, and M. Kohlweiss. 2013. Selective disclosure in Datalog-based trust management. In Proceedings of the 9th International Workshop on Security and Trust Management, pp. 160--175. Springer. 536

[116]

T. Swift and D. S. Warren. 2012. XSB: Extending Prolog with tabled logic programming. Theory and Practice of Logic Programming, 12(1--2): 157--187. 531, 534

Digital Library

[117]

T. Swift, D. S. Warren, et al. June 2014. The XSB System Version 3.5.x. http://xsb.sourceforge.net. Accessed June 6, 2015. 530

[118]

K. T. Tekle and Y. A. Liu. 2011. More efficient Datalog queries: Subsumptive tabling beats magic sets. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, pp. 661--672. 534, 535

Digital Library

[119]

K. T. Tekle and Y. A. Liu. 2016. Precise complexity guarantees for pointer analysis via Datalog with extensions. Theory and Practice of Logic Programming, 16(5--6): 916--932. 535

[120]

K. T. Tekle, M. Gorbovitski, and Y. A. Liu. 2010.Graphqueries through Datalog optimizations. In Proceedings of the 12th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming, pp. 25--34. 542

Digital Library

[121]

A. Van Gelder. 1993. The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences, 47(1): 185--221. 525

Digital Library

[122]

A. Van Gelder, K. Ross, and J. S. Schlipf. 1991. The well-founded semantics for general logic programs. Journal of the ACM, 38(3): 620--650. 525

Digital Library

[123]

D. S. Warren and Y. A. Liu. Apr. 2017. AppLP: A dialogue on applications of logic programming. Computing Research Repository, arXiv:1704.02375 {cs.PL}. 547

[124]

J. Whaley, D. Avots, M. Carbin, and M. S. Lam. 2005. Using Datalog with binary decision diagrams for program analysis. In Programming Languages and Systems, pp. 97--118. Springer. 535

Digital Library

[125]

D. E. Willard. 2002. An algorithm for handling many relational calculus queries efficiently. Journal of Computer and System Sciences, 65: 295--331. 529

[126]

XSB, 2015. Case Studies. http://www.xsb.com/case-studies. Accessed May 18, 2015. 543

Cited By

Sheketa VMelnyk VPetryshyn RRomanyshyn YSachenko O(2023)The Formal Grounds for Construction for Intellimedia Automated System2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS58523.2023.10348818(1130-1138)Online publication date: 7-Sep-2023
https://doi.org/10.1109/IDAACS58523.2023.10348818
Liu YStoller S(2022)Recursive rules with aggregation: a simple unified semanticsJournal of Logic and Computation10.1093/logcom/exac07232:8(1659-1693)Online publication date: 14-Nov-2022
https://doi.org/10.1093/logcom/exac072
Liu YStoller S(2021)Recursive Rules with Aggregation: A Simple Unified SemanticsLogical Foundations of Computer Science10.1007/978-3-030-93100-1_11(156-179)Online publication date: 16-Dec-2021
https://doi.org/10.1007/978-3-030-93100-1_11
Show More Cited By

Logic programming applications: what are the abstractions and implementations?

Recommendations

Logic programming semantics: techniques and applications
From answer set logic programming to circumscription via logic of GK

We first embed Pearce's equilibrium logic and Ferraris's propositional general logic programs in Lin and Shoham's logic of GK, a nonmonotonic modal logic that has been shown to include as special cases both Reiter's default logic in the propositional ...
Intensional logic programming

Comments

Information & Contributors

Information

Published In

cover image ACM Books

Declarative Logic Programming: Theory, Systems, and Applications

September 2018

615 pages

ISBN:9781970001990

DOI:10.1145/3191315

Editors:
Michael Kifer
Stony Brook University
,
Yanhong Annie Liu
Stony Brook University

Publisher

Association for Computing Machinery and Morgan & Claypool

Publication History

Published: 01 September 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Chapter

Appears in

ACM Books

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
57
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Sheketa VMelnyk VPetryshyn RRomanyshyn YSachenko O(2023)The Formal Grounds for Construction for Intellimedia Automated System2023 IEEE 12th International Conference on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications (IDAACS)10.1109/IDAACS58523.2023.10348818(1130-1138)Online publication date: 7-Sep-2023
https://doi.org/10.1109/IDAACS58523.2023.10348818
Liu YStoller S(2022)Recursive rules with aggregation: a simple unified semanticsJournal of Logic and Computation10.1093/logcom/exac07232:8(1659-1693)Online publication date: 14-Nov-2022
https://doi.org/10.1093/logcom/exac072
Liu YStoller S(2021)Recursive Rules with Aggregation: A Simple Unified SemanticsLogical Foundations of Computer Science10.1007/978-3-030-93100-1_11(156-179)Online publication date: 16-Dec-2021
https://doi.org/10.1007/978-3-030-93100-1_11
Liu YStoller S(2020)Knowledge of uncertain worlds: programming with logical constraintsJournal of Logic and Computation10.1093/logcom/exaa077Online publication date: 23-Dec-2020
https://doi.org/10.1093/logcom/exaa077

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Chapter

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents