![one_char_diff(String1, String2) :-
atom_chars(String1, Chars1),
atom_chars(String2, Chars2),
dist(Chars1, Chars2, 0, N),
N = 1.
dist([], [], C, R) :- C = R.
dist([H1|T1], [H2|T2], Count, R) :-
(H1 \= H2 -> NewCount is Count + 1 ; NewCount is Count),
dist(T1, T2, NewCount, R).
construct_path([H|T], End, _, Path) :-
H = End,
reverse([H|T], Path).
construct_path([H|T], End, G, Path) :-
member((H, Next), G),
\+ member(Next, T),
construct_path([Next, H|T], End, G, Path).
cmp_length(A, B) :-
length(A, La),
length(B, Lb),
La =< Lb.
find_word_ladder(Start, End, Dictionary, Result) :-
findall((Word1, Word2),
(member(Word1, Dictionary), member(Word2, Dictionary), one_char_diff(Word1, Word2)),
G),
findall(Path, construct_path([Start], End, G, Path), Paths),
min_member(cmp_length, Result, Paths).](https://files.mastodon.social/media_attachments/files/114/275/910/992/824/365/original/686d944c7bd9745d.png "one_char_diff(String1, String2) :-
atom_chars(String1, Chars1),
atom_chars(String2, Chars2),
dist(Chars1, Chars2, 0, N),
N = 1.
dist([], [], C, R) :- C = R.
dist([H1|T1], [H2|T2], Count, R) :-
(H1 \= H2 -> NewCount is Count + 1 ; NewCount is Count),
dist(T1, T2, NewCount, R).
construct_path([H|T], End, _, Path) :-
H = End,
reverse([H|T], Path).
construct_path([H|T], End, G, Path) :-
member((H, Next), G),
\+ member(Next, T),
construct_path([Next, H|T], End, G, Path).
cmp_length(A, B) :-
length(A, La),
length(B, Lb),
La =< Lb.
find_word_ladder(Start, End, Dictionary, Result) :-
findall((Word1, Word2),
(member(Word1, Dictionary), member(Word2, Dictionary), one_char_diff(Word1, Word2)),
G),
findall(Path, construct_path([Start], End, G, Path), Paths),
min_member(cmp_length, Result, Paths).")
![fn dist(a: &str, b: &str) -> u32 {
a.chars().zip(b.chars()).fold(0, |d, (a, b)| d+(a!=b) as u32)
}
fn find_word_ladder(start: String, end: String, dictionary: Vec<String>) -> Option<Vec<String>> {
let mut g: Vec<(&str,&str)> = vec![];
for i in 0..dictionary.len() {
for j in (i+1)..dictionary.len() {
if dist(&dictionary[i], &dictionary[j]) == 1 {
g.push((&dictionary[i], &dictionary[j]));
}
}
}
let mut paths: Vec<Vec<&str>> = vec![vec![&start]];
let mut results: Vec<Vec<&str>> = vec![];
while paths.len() > 0 {
let p = paths.pop().unwrap();
let t = p.last().unwrap();
for (x,y) in g.iter() {
if x == t {
let mut pc = p.clone();
pc.push(y);
paths.push(pc);
}
}
if t == &end {
results.push(p);
}
}
results.into_iter().max_by(|a,b| a.len().cmp(&b.len()))
.map(|v| v.into_iter().map(|s| s.to_owned()).collect())
}](https://files.mastodon.social/media_attachments/files/114/275/910/994/785/416/original/17b89dd86b78c96b.png "fn dist(a: &str, b: &str) -> u32 {
a.chars().zip(b.chars()).fold(0, |d, (a, b)| d+(a!=b) as u32)
}
fn find_word_ladder(start: String, end: String, dictionary: Vec<String>) -> Option<Vec<String>> {
let mut g: Vec<(&str,&str)> = vec![];
for i in 0..dictionary.len() {
for j in (i+1)..dictionary.len() {
if dist(&dictionary[i], &dictionary[j]) == 1 {
g.push((&dictionary[i], &dictionary[j]));
}
}
}
let mut paths: Vec<Vec<&str>> = vec![vec![&start]];
let mut results: Vec<Vec<&str>> = vec![];
while paths.len() > 0 {
let p = paths.pop().unwrap();
let t = p.last().unwrap();
for (x,y) in g.iter() {
if x == t {
let mut pc = p.clone();
pc.push(y);
paths.push(pc);
}
}
if t == &end {
results.push(p);
}
}
results.into_iter().max_by(|a,b| a.len().cmp(&b.len()))
.map(|v| v.into_iter().map(|s| s.to_owned()).collect())
}")
Recent searches
Search options
#prolog
2 posts2 participants1 post today
Continued thread
Curso "Programación lógica (2007-08)". https://jaalonso.github.io/cursos/d-pl-07 #ProgramaciónLógica #Prolog #IA
jaalonso.github.ioProgramación lógica (2007-08)
I need some #lisp help.
I'm stuck on a recursion exercise - have been for 2 days!
We're given a at a structure a list of lists, where each such list is of the form (person mother father) .. and so a lot of these together create a family tree.
I want to write a function lineage x y which returns a list of ancestors from x to y ... eg x, mother of x, father of prev, y .... or NIL if y is not an ancestor of x.
I found this easy in #prolog (I wrote this https://prologbyexample.blogspot.com/2023/02/introducing-recursion.html ) but not #lisp.
prologbyexample.blogspot.com7 - Introducing Recursion Recursion is an important technique in many programming languages, especially declarative languages like prolog. It enables elegant and ...
Curso "Programación declarativa (2005-06)". https://jaalonso.github.io/cursos/pd-05/index.html #LogicProgramming #Prolog
jaalonso.github.ioProgramación declarativa (2005-06)
Replied in thread
@TonyVladusich What would the 2nd formulation of Categorical Imperative become, in this context? Something along the lines of using the tool being an end in itself? I often feel that way about #emacs at least. Maybe #Prolog too.
https://en.wikipedia.org/wiki/Categorical_imperative#Second_formulation:_Humanity
en.wikipedia.orgCategorical imperative - Wikipedia
Replied in thread
I rediscovered #prolog 20 years after they tried to teach me.
As a result I wrote a short easy course for anyone struggling with the traditional guides - a course I wish I had back then.
There are links to videos too, one per topic.
https://prologbyexample.blogspot.com/p/toc.html
prologbyexample.blogspot.comContentsBasics 1. Simple Facts 2. Querying With Variables 3. Satisfying Multiple Properties 4. Proving New Facts By Deduction 5. Generating Si...
High Performance PostgreSQL for Rails by Andrew Atkinson is part of a 16-ebook $18 bundle! Pragmatic Bookshelf and Humble Bundle have made it available along with Practical A/B Testing, Designing Data Governance from the Ground Up, SQL Antipatterns Vol. 1, and others. Pretty sweet deal!
https://www.humblebundle.com/books/data-engineering-and-management-pragmatic-books
Humble BundleHumble Tech Book Bundle: Data Engineering and Management by PragmaticLearn all about data engineering and management with our latest collection of tech courses. Pay what you want & support Save the Children.
If you struggled with the traditional #Prolog courses .. this course was developed for you.
Develop understanding through hands-on bite-size examples.
Talk through how new ideas work, step-by-step.
Avoid terminology and jargon
www.amazon.com/dp/B0BTQ7P69H/
A famous example of #AutomatedScientificDiscovery is "Adam the Robot Scientist".
This is a machine, introduced in 2004 by Ross King and others, that can do biochemistry experiments on its own and smartly pick the next experiment to do. More precisely, it is a room full of robots and automated chemistry, growing yeast cells that have been genetically modified. The goal is to find out which enzymes are important in which parts of the chemistry of yeast. This is a puzzle, since when you switch off a gene and the enzyme it coded for, then you only see indirectly what happens to the yeast (some important substances fail to get produced). It is like a cross-word puzzle, and therefore #AI can help. Here AI came in the form of the logic programming language #Prolog, that can encode all the observations and rules.
The biggest achievement of the robot scientist is that it can be very clever in selecting the next step, focusing on the most informative experiment. This is essential, since running an experiment is costly and time-consuming.
The plot I love most in the 2004 paper is the classification accuracy plotted vs the logarithm of the experimentation cost in British pounds. 
Adam's follow-up robot is called "Eve", doing drug screening.
https://en.wikipedia.org/wiki/Robot_Scientist
https://royalsocietypublishing.org/doi/10.1098/rsif.2021.0821
(image below from this article, CC-BY-4.0)
Read more blog posts in this series: https://florianmarquardtmastodon.eu.pythonanywhere.com/?account=%40FMarquardtGroup%40fediscience.org&hashtag=AutomatedScientificDiscovery&message=Florian's%20Blog:%20Automated%20Scientific%20Discovery
The intersection of People Using GNU Prolog and People Using BBEdit may be just me, but if there's anyone else out there then know that I put together a Codeless Language Module (CLM) for gprolog. https://github.com/adamcrussell/bbedit-prolog-clm
Basically this allows for syntax highlighting in BBEdit. All predicates in GNU Prolog (as of the current version 1.5.0) are included.
Readings shared February 13, 2025. https://jaalonso.github.io/vestigium/posts/2025/02/13-readings_shared_02-13-25 #AI #Autoformalization #Coq #ITP #IsabelleHOL #LLMs #LeanProver #LogicProgramming #Math #Programming #Prolog #Rocq
Vestigium · Readings shared February 13, 2025The readings shared in Bluesky on 13 February 2025 are
Is mathematics obsolete? ~ Jeremy Avigad. #Math #ITP #LeanProver #AI #LLMs
A Coq formalization of unification modulo exclusive-or. ~ Yichi Xu, D
Map showing our journey as we learn #prolog together ...
.... from the basics of facts and deduction, through to meta-programming.
"Prolog by Example"
I can't think about AI without remembering being completely useless at #Prolog in the early 90s, and thinking how pointless it was. But then my arrogant younger self thought everything about my degree was pointless.
I feel like Poplog, a combined Pop11, Prolog, Common Lisp, and Standard ML environment never gets enough love: https://poplogarchive.getpoplog.org/poplog.info.html #lisp #prolog
poplogarchive.getpoplog.orgINFORMATION ABOUT POPLOG AND POP11
Interesting Prolog I just learned about.
With a Clojure connection.
https://github.com/jjtolton/libscryer-clj?tab=readme-ov-file
www.scryer.plScryer Prolog