triska

45 ms·

391.
by triska 7y ago
Speaking as someone who does have a strong interest in machine learning, and who follows the pertaining literature and ML-related news and has done so for years, I can tell you: To this day, every single time I see the acronym ML, my first
392.
by triska 7y ago
Yes, there are strong connections: In Prolog terminology, SAT is called CLP(B), constraint logic programming over Boolean variables, and several Prolog systems provide dedicated libraries to solve SAT instances efficiently. For instance,
393.
by triska 7y ago
Interestingly, when defining pure relations in Prolog, there is no "outside the database itself": Both rules and facts are instances of a single unifying language element, a logical clause , which is also terminology from predica
394.
by triska 7y ago
Related to the logical view, it would also be great to include deductive databases : https://en.wikipedia.org/wiki/Deductive_database Deductive databases derive logical consequences based on facts and rules . Datal
395.
by triska 7y ago
R (and its predecessor S) is so great, thank you for writing and sharing this! In a way, R is very similar to APL and J in that many operations automatically scale from scalars to vectors, and you can therefore conveniently express applicat
396.
by triska 7y ago
Regarding programming paradigms, at least one very important consequence of the completeness theorem is that first-order logic can be used as a formal basis for computation . This is because you can model what a Turing machine does via pr
397.
Intro to Web Prolog for Erlangers (2019) [pdf](gup.ub.gu.se)
1 points by triska 7y ago|0 comments
398.
by triska 7y ago
Thank you for sharing this! In my opinion, this is spot on and an important insight into programming. The validity of this view of programming is particularly evident when using a logic programming language like Prolog or Mercury: In this
399.
by triska 7y ago
Take for instance Wu-Yi Hsiang's suggested proof of the Kepler conjecture as a less controversial example. Quoting from https://en.wikipedia.org/wiki/Kepler_conjecture : "The proof was praised by Encyclopædia
400.
by triska 7y ago
Complementing this situation, there are also cases where a proof hinges on a critical corollary or theorem where "no importance, I made another one!" did not or does not come as easily. One recent example is Corollary 3.12 in Moch
401.
by triska 7y ago
That's a very nice essay, thank you for putting this all together! Personally, I think that many of these points are also valid for computer science. However, for CS, I think short-terminism (which the essay mentions as less of a probl
402.
by triska 7y ago
I'm beyond flattered to hear this, thank you so much for writing this! Your paper is so nicely done that it definitely warrants an interesting discussion! SLDNF resolution really does not terminate in many cases, also if no variables a
403.
by triska 7y ago
Very nice! A key attraction of pure Prolog code is indeed that it can be evaluated in different ways to obtain better termination and performance characteristics, and to derive more semantic consequences of programs. The equation "Algo
404.
by triska 7y ago
Very interesting, thank you for sharing this! About this proof, quoting from a talk by John W. Dawson Jr., an internationally recognized authority on the life and work of Kurt Gödel: "And a final example of this sort of unfashionable
405.
A résumé as a PostScript quine(github.com)
3 points by triska 7y ago|0 comments
406.
by triska 7y ago
Wow, these are beautiful graphs and programs! Thank you for putting this together, and for sharing it!
407.
by triska 7y ago
Very interesting, thank you for sharing this! To describe sequences, I often use grammar formalisms such as definite clause grammars (DCGs) that are provided by the logic programming language Prolog. For example, here is a Prolog definiti
408.
by triska 7y ago
A nice overview of a few interesting Dyalog extensions is Direct Functions in Dyalog APL : https://www.dyalog.com/uploads/documents/Papers/dfns.pdf For example, you can write {expr} to introduce a Direct Fun
409.
by triska 7y ago
Wow, each of ⎕FFT, ⎕GTK and ⎕RE are substantial and impressive additions! Thank you, and congratulations on the new release!
410.
by triska 7y ago
Personally, I cannot make a comparison between Slack and IRC because I have never tried the former. From the discussion, it is clear that Slack has many features and attractions that are not available or harder to obtain with IRC. However,
411.
by triska 7y ago
If you find such a puzzle, please let me know! Assuming the CLP(B) solver is correctly implemented, the CLP(B) solution I posted will give the unique solution without any search. On the other hand, it is comparatively easy to find puzzles w
412.
by triska 7y ago
A valid Sudoku puzzle is such that the given clues admit precisely one solution. Hence, if you somehow manage to take into account all the initially available information , then no search is required, because, in a sense, the given hints a
413.
by triska 7y ago
Thank you for noting this! PostScript is currently underappreciated, and I highly recommend learning it. Among many other uses, I like to use PostScript as a portable animation language to visualize search processes like in this case. Also,
414.
by triska 7y ago
In my opinion, a key attraction of Prolog is the regularity of its syntax and the relation between its syntax and semantics. I mean not only homoiconicity, but something beyond that. For example, one of the first questions of Prolog beginne
415.
by triska 7y ago
Thank you very much for your kind words! I greatly appreciate your feedback, and I am very glad that you benefit from the videos! Also, I would like to take this opportunity to thank you all collectively for your thoughtful participation in
416.
by triska 7y ago
In general, Prolog is extremely well suited for tasks where partial information needs to be taken into account. The presence of logic variables , i.e., "true" variables in the sense of logic, is one of the defining characterist
417.
by triska 7y ago
The question is perfectly well-formed! It is, however, very broad, and I try to answer it very broadly. First, SAT solvers are powerful and efficient. SAT is one of the most studied problems in CS, both from a theoretical and practical pers
418.
by triska 7y ago
The primary attraction of CLP, i.e., the combination of constraint programming (CP) and logic programming (LP), is that you get a full-blown programming language (most frequently: Prolog) and in addition seamlessly integrated solvers (ove
419.
by triska 7y ago
Thank you very much for the publicity, I greatly appreciate your interest! Prolog is extremely well-suited for solving combinatorial tasks like Sudoku puzzles, and also for tough practical challenges such such as timetabling, scheduling and
420.
by triska 7y ago
Latin squares are very interesting, thank you for sharing this! For comparison, here is a Prolog solution that uses CLP(ℤ), constraint logic programming over integers, to express the task: :- use_module(library(clpz)). latin_squa

More ›