norden.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
Moin! Dies ist die Mastodon-Instanz für Nordlichter, Schnacker und alles dazwischen. Folge dem Leuchtturm.

Administered by:

Server stats:

3.5K
active users

#logicprogramming

0 posts0 participants0 posts today
José A. Alonso<p>Prolog vs LLMs: A complementary approach to AI (according to DeepSeek). <a href="https://prologsource.wordpress.com/2025/04/05/prolog-vs-llms-a-complementary-approach-to-ai-according-to-deepseek/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">prologsource.wordpress.com/202</span><span class="invisible">5/04/05/prolog-vs-llms-a-complementary-approach-to-ai-according-to-deepseek/</span></a> <a href="https://mathstodon.xyz/tags/Prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Prolog</span></a> <a href="https://mathstodon.xyz/tags/LogicProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LogicProgramming</span></a> <a href="https://mathstodon.xyz/tags/LLMs" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LLMs</span></a> <a href="https://mathstodon.xyz/tags/AI" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AI</span></a></p>
José A. Alonso<p>Building AI for mathematical reasoning. ~ Chris Garcia. <a href="https://ai.gopubby.com/building-ai-for-mathematical-reasoning-996a81eb8b72" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">ai.gopubby.com/building-ai-for</span><span class="invisible">-mathematical-reasoning-996a81eb8b72</span></a> <a href="https://mathstodon.xyz/tags/Prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Prolog</span></a> <a href="https://mathstodon.xyz/tags/LogicProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LogicProgramming</span></a> <a href="https://mathstodon.xyz/tags/Logic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Logic</span></a> <a href="https://mathstodon.xyz/tags/Math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Math</span></a></p>
jbz<p>「 Curry is a declarative multi-paradigm programming language which combines in a seamless way features from functional programming (nested expressions, higher-order functions, strong typing, lazy evaluation) and logic programming (non-determinism, built-in search, free variables, partial data structures) 」</p><p><a href="https://curry-lang.org/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">curry-lang.org/</span><span class="invisible"></span></a></p><p><a href="https://indieweb.social/tags/currylang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>currylang</span></a> <a href="https://indieweb.social/tags/functionalprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>functionalprogramming</span></a> <a href="https://indieweb.social/tags/logicprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logicprogramming</span></a></p>
Panicz Maciej Godek<p>If you're interested in <a href="https://functional.cafe/tags/Scheme" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Scheme</span></a>, <a href="https://functional.cafe/tags/Lisp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Lisp</span></a>, <a href="https://functional.cafe/tags/MiniKanren" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>MiniKanren</span></a> or <a href="https://functional.cafe/tags/LogicProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LogicProgramming</span></a>, I wholeheartedly recommend William Byrd's 'From Bronze to GM' youtube series:<br><a href="https://youtube.com/@williamebyrd" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">youtube.com/@williamebyrd</span><span class="invisible"></span></a></p>
Felix 🇺🇦🚴‍♂️🇨🇦🇬🇱🇩🇰🇲🇽🇵🇦 🇪🇺<p>The simplicity of <a href="https://norden.social/tags/Prolog" class="mention hashtag" rel="tag">#<span>Prolog</span></a></p><p><a href="https://bitsandtheorems.com/the-simplicity-of-prolog/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">bitsandtheorems.com/the-simpli</span><span class="invisible">city-of-prolog/</span></a></p><p>&quot;Imperative languages focus on how a problem is solved, using sequences of instructions to manipulate state. </p><p>In contrast, declarative languages focus on describing what the problem or desired outcome is.&quot;</p><p>vs. <a href="https://norden.social/tags/Kotlin" class="mention hashtag" rel="tag">#<span>Kotlin</span></a> </p><p><a href="https://norden.social/tags/logicProgramming" class="mention hashtag" rel="tag">#<span>logicProgramming</span></a> <a href="https://norden.social/tags/DeclarativeProgramming" class="mention hashtag" rel="tag">#<span>DeclarativeProgramming</span></a><br /><a href="https://norden.social/tags/programming" class="mention hashtag" rel="tag">#<span>programming</span></a></p>
Felix 🇺🇦🚴‍♂️🇨🇦🇬🇱🇩🇰🇲🇽🇵🇦 🇪🇺<p>The <a href="https://norden.social/tags/Dusa" class="mention hashtag" rel="tag">#<span>Dusa</span></a> Programming Language<br />Dusa is a logic programming language designed by Rob Simmons and Chris Martens, the first implementation of finite-choice logic programming. <a href="https://norden.social/tags/datalog" class="mention hashtag" rel="tag">#<span>datalog</span></a> <a href="https://norden.social/tags/logicprogramming" class="mention hashtag" rel="tag">#<span>logicprogramming</span></a> <a href="https://norden.social/tags/graphs" class="mention hashtag" rel="tag">#<span>graphs</span></a> <a href="https://norden.social/tags/prolog" class="mention hashtag" rel="tag">#<span>prolog</span></a> <a href="https://norden.social/tags/programminglanguages" class="mention hashtag" rel="tag">#<span>programminglanguages</span></a> </p><p><a href="https://dusa.rocks/docs/introductions/graph/" target="_blank" rel="nofollow noopener noreferrer" translate="no"><span class="invisible">https://</span><span class="ellipsis">dusa.rocks/docs/introductions/</span><span class="invisible">graph/</span></a></p>
dorotaC<p>Help, there's <a href="https://fosstodon.org/tags/logic" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logic</span></a> in my <a href="https://fosstodon.org/tags/camera" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>camera</span></a>! </p><p>$ ./config_query 'eq(A, config(_, 640, _, _)), A.'<br>camera.get_id() = "uvc:Integrated Camera"<br>Solution: "A = config(fourcc_YUYV, 640, 480, fraction(1, 30)),"<br>Solution: "A = config(fourcc_MJPG, 640, 480, fraction(1, 30)),"<br>fraction(1, 30)),"</p><p>Oh wait, it's just <a href="https://fosstodon.org/tags/Prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Prolog</span></a> in the incoming <a href="https://fosstodon.org/tags/libobscura" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>libobscura</span></a> feature.</p><p>The above query returns supported <a href="https://fosstodon.org/tags/image" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>image</span></a> formats and frame rates at 640px wide.</p><p>This API is optional, but do learn some Prolog anyway.</p><p><a href="https://fosstodon.org/tags/logicprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logicprogramming</span></a></p>
Brian Rogers<p>Finally! A new episode of "The Search Space"! </p><p>#6 - Adam Smith on Answer Set Programming<br><a href="https://thesearch.space/episodes/6-adam-smith-on-answer-set-programming" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">thesearch.space/episodes/6-ada</span><span class="invisible">m-smith-on-answer-set-programming</span></a></p><p><a href="https://infosec.exchange/tags/Prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Prolog</span></a> <a href="https://infosec.exchange/tags/LogicProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LogicProgramming</span></a> <a href="https://infosec.exchange/tags/AnswerSetProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>AnswerSetProgramming</span></a></p>
chris martens<p>not that the world really needs more computer science conferences, but i keep wondering if there’s appetite for one focused on procedural generation/generative computation, i.e. the union of PCG, generative art, program synthesis, &amp;c.</p><p>mostly, it would really help to have a name for this field that people don’t mistake for consisting entirely of text2image statistical models</p><p><a href="https://hci.social/tags/generativeArt" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>generativeArt</span></a> <a href="https://hci.social/tags/genartclub" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>genartclub</span></a> <a href="https://hci.social/tags/generativeAI" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>generativeAI</span></a> <a href="https://hci.social/tags/procgen" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>procgen</span></a> <a href="https://hci.social/tags/proceduralcontentgeneration" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>proceduralcontentgeneration</span></a> <a href="https://hci.social/tags/programsynthesis" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programsynthesis</span></a> <a href="https://hci.social/tags/logicprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logicprogramming</span></a></p>
novatorine 🏴🏳️‍⚧️<p>Does anyone on here know how to make a <a href="https://kolektiva.social/tags/backtracking" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>backtracking</span></a> <a href="https://kolektiva.social/tags/algorithm" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>algorithm</span></a> faster? I'm writing a <a href="https://kolektiva.social/tags/logicprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>logicprogramming</span></a> language ala <a href="https://kolektiva.social/tags/Prolog" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Prolog</span></a> in Rust and it's already pretty slow (takes 1.11 seconds to find 20 answers) at even four rules deep and a database with 84 facts. Might it be string comparisons for variable names and such? If so, how would I accelerate that?</p>