{"id":3555,"date":"2024-11-22T19:04:22","date_gmt":"2024-11-22T13:34:22","guid":{"rendered":"https:\/\/www.rangakrish.com\/?p=3555"},"modified":"2024-11-22T19:04:52","modified_gmt":"2024-11-22T13:34:52","slug":"multiobjective-optimization-moo-in-lisp-and-prolog","status":"publish","type":"post","link":"https:\/\/www.rangakrish.com\/index.php\/2024\/11\/22\/multiobjective-optimization-moo-in-lisp-and-prolog\/","title":{"rendered":"Multiobjective Optimization (MOO) in Lisp and Prolog"},"content":{"rendered":"

Recently I came across a nice article<\/strong><\/em><\/a>\u00a0by Jose Crespo, where the author stresses that the future of programming revolves around the application of math concepts such as Functor<\/strong><\/em>, Monads<\/strong><\/em>, Folds<\/strong><\/em>, etc. In addition, he argues that familiarity with C\/C++<\/strong><\/em> is essential in this modern AI age.<\/p>\n

The author goes through a toy example that uses time<\/strong><\/em> and energy<\/strong><\/em> to show how Multiobjective Optimization (MOO)<\/strong><\/em> framework can be quite useful in the real world.<\/p>\n

I strongly urge readers to go through that article before continuing, since what follows is based on that article.<\/p>\n

What impressed me most about the article was the elegant and compact C++<\/strong><\/em> code (using the latest language features) that shows how to use Pareto Front<\/strong><\/em> approach to consider both time<\/strong><\/em> and energy<\/strong><\/em> for arriving at an optimal solution.<\/p>\n

Readers may know that my favourite top<\/strong><\/em> three programming languages are C++<\/strong><\/em><\/a>, Common Lisp<\/strong><\/em><\/a>\u00a0and Prolog<\/strong><\/em><\/a>. So when I finished reading that article, I wanted to rewrite the solution in Lisp<\/strong><\/em> and Prolog<\/strong><\/em>.<\/p>\n

Here is the Lisp code:<\/p>\n

\"Lisp<\/a>
Lisp Code for Pareto Front<\/strong><\/figcaption><\/figure>\n

Here is the program output:<\/p>\n

\"Program<\/a>
Program Output<\/strong><\/figcaption><\/figure>\n

The Lisp program is no less elegant in my opinion! Of course Lisp<\/strong><\/em> is a dynamically typed language and hence the performance (space and time) is likely to be marginally inferior to C++<\/strong><\/em> (by the way, LispWorks<\/strong><\/em> has a great compiler that can generate optimized native code for the Lisp<\/strong><\/em> program). Keeping efficiency aside, the remarkable thing about Common Lisp<\/strong><\/em> is its support for Multimethods<\/strong><\/em> and Meta Object Protocol (MOP)<\/strong><\/em>.<\/p>\n

Now, let us look at the equivalent Prolog program:<\/p>\n

\"Prolog<\/a>
Prolog Code<\/strong><\/figcaption><\/figure>\n

The main<\/strong><\/em> predicate follows:<\/p>\n

\"Prolog<\/a>
Prolog “main” Predicate<\/strong><\/figcaption><\/figure>\n

When you run the program, this is the output:<\/p>\n

\"Prolog<\/a>
Prolog Output<\/strong><\/figcaption><\/figure>\n

In both Lisp<\/strong><\/em> and Prolog<\/strong><\/em>, the result matches the C++<\/strong><\/em> output (as described in the article).<\/p>\n

I chose Prolog<\/strong><\/em> to show that the logic can be implemented in this language too, but it would not be my natural choice for this implementation.<\/p>\n

The point is that while C++<\/strong><\/em> is arguably the best language to implement most algorithms, especially with the features available in the recent language specifications, if not running on embedded systems or on resource-critical systems, then languages such as Lisp<\/strong><\/em> are equally good choices for implementing such algorithms.<\/p>\n

You can download the Lisp<\/strong><\/em><\/a>\u00a0and Prolog<\/strong><\/em><\/a>\u00a0code here.<\/p>\n

Have a nice weekend!<\/p>\n","protected":false},"excerpt":{"rendered":"

Recently I came across a nice article\u00a0by Jose Crespo, where the author stresses that the future of programming revolves around the application of math concepts such as Functor, Monads, Folds, etc. In addition, he argues that familiarity with C\/C++ is essential in this modern AI age. The author goes through a toy example that uses […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"advanced_seo_description":"","jetpack_seo_html_title":"","jetpack_seo_noindex":false,"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":true,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[49,18,17,147],"tags":[67,19,409,148],"class_list":["post-3555","post","type-post","status-publish","format-standard","hentry","category-c","category-lisp","category-programming","category-prolog","tag-c","tag-lisp","tag-multiobjective-optimization","tag-prolog"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p9OLnF-Vl","jetpack-related-posts":[{"id":2832,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/06\/12\/definite-clause-grammars-in-lisp-part-4\/","url_meta":{"origin":3555,"position":0},"title":"Definite Clause Grammars in Lisp – Part 4","author":"admin","date":"June 12, 2022","format":false,"excerpt":"In a series of articles\u00a0written earlier, I had shown how it is possible to model Definite Clause Grammars (DCG) in LispWorks Lisp (Enterprise Edition). We use defgrammar\u00a0in Common Prolog (available as part of KnowledgeWorks package) to define our grammar rules. Here is a toy English grammar represented using defgrammar: This\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"DCG Using Defgrammar","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2022\/06\/defgrammar-version-300x177.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2366,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/03\/28\/implementing-ilexicon-using-litedb\/","url_meta":{"origin":3555,"position":1},"title":"Implementing iLexicon using LiteDB","author":"admin","date":"March 28, 2021","format":false,"excerpt":"iLexicon is an \"intelligent\" dictionary that can be used to build Natural Language applications. I have two implementations, one in Lisp and another in Prolog. Both implementations are memory-based, in order to speed up performance. I have written several articles referencing it, for example see this. \u00a0 LiteDB is a\u2026","rel":"","context":"In "Natural Language Processing"","block_context":{"text":"Natural Language Processing","link":"https:\/\/www.rangakrish.com\/index.php\/category\/natural-language-processing\/"},"img":{"alt_text":"Sample Commands","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/03\/Session1.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]},{"id":2935,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/11\/07\/why-learn-c\/","url_meta":{"origin":3555,"position":2},"title":"Why Learn C++","author":"admin","date":"November 7, 2022","format":false,"excerpt":"This is the third and the last article in the series \u201cWhy Learn Language-XYZ?\u201d. I talked about Prolog and Lisp earlier. The present article is on C++. Once you have gained reasonable proficiency with Prolog and Lisp, you are ready to learn C++! In my view, C++ is a complex\u2026","rel":"","context":"In "C++"","block_context":{"text":"C++","link":"https:\/\/www.rangakrish.com\/index.php\/category\/c\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":2927,"url":"https:\/\/www.rangakrish.com\/index.php\/2022\/10\/20\/why-learn-lisp\/","url_meta":{"origin":3555,"position":3},"title":"Why Learn Lisp?","author":"admin","date":"October 20, 2022","format":false,"excerpt":"In the last article, I had shared my views on why programmers should learn Prolog, preferably as the first language. What language should one learn next? I strongly pitch for Lisp, to be precise, \u201cCommon Lisp\u201d. Lisp happens to be the second oldest (1958) programming language, only after Fortran (1957)!\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":3271,"url":"https:\/\/www.rangakrish.com\/index.php\/2023\/12\/10\/generating-polynomials-part-2\/","url_meta":{"origin":3555,"position":4},"title":"Generating Polynomials – Part 2","author":"admin","date":"December 10, 2023","format":false,"excerpt":"In my last article, I showed how we can use Prolog to generate univariate Polynomials. After I finished that article, I wanted to try Lisp for the same task. Prolog is \u201cdeclarative\u201d, whereas Lisp is primarily \u201cfunctional\u201d (it supports OOP as well), so the implementation will exhibit that difference. Here\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"Function to Generate Polynomial","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/12\/code1-300x139.jpg?resize=350%2C200&ssl=1","width":350,"height":200,"srcset":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/12\/code1-300x139.jpg?resize=350%2C200&ssl=1 1x, https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2023\/12\/code1-300x139.jpg?resize=525%2C300&ssl=1 1.5x"},"classes":[]},{"id":2334,"url":"https:\/\/www.rangakrish.com\/index.php\/2021\/02\/28\/calling-c-methods-from-lispworks-lisp-through-com-interface\/","url_meta":{"origin":3555,"position":5},"title":"Calling C# Methods from LispWorks Lisp through COM Interface","author":"admin","date":"February 28, 2021","format":false,"excerpt":"In an earlier article, I showed how to invoke C# methods from Sicstus Prolog. Today, I would like to detail the steps for doing the same from LispWorks Lisp. LispWorks Enterprise Edition comes budled with support for COM and Automation. This is what we will be using. What this means\u2026","rel":"","context":"In "LISP"","block_context":{"text":"LISP","link":"https:\/\/www.rangakrish.com\/index.php\/category\/lisp\/"},"img":{"alt_text":"The COM Server in C#","src":"https:\/\/i0.wp.com\/www.rangakrish.com\/wp-content\/uploads\/2021\/02\/C-Code-300x267.jpg?resize=350%2C200&ssl=1","width":350,"height":200},"classes":[]}],"_links":{"self":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/3555","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/comments?post=3555"}],"version-history":[{"count":0,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/posts\/3555\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/media?parent=3555"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/categories?post=3555"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.rangakrish.com\/index.php\/wp-json\/wp\/v2\/tags?post=3555"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}