Readings shared April 27, 2025. https://jaalonso.github.io/vestigium/posts/2025/04/27-readings_shared_04-27-25 #AI #CategoryTheory #CommonLisp #Emacs #FormalVerification #LogicProgramming #Prolog
Bitcoinolog: Reason about Bitcoin addresses with Prolog. ~ Markus Triska. https://youtu.be/bpCMklQeJKQ #Prolog #LogicProgramming
https://rosettacode.org/wiki/Balanced_brackets#Prolog #prolog
balanced_brackets --> [].
balanced_brackets -->
['['],
balanced_brackets,
[']'].
balanced_brackets -->
['[',']'],
balanced_brackets.
PEIRCE: Unifying material and formal reasoning via LLM-driven neuro-symbolic refinement. ~ Xin Quan, Marco Valentino, Danilo S. Carvalho, Dhairya Dalal, André Freitas. https://arxiv.org/abs/2504.04110 #AI #LLMs #ITP #IsabelleHOL #Prolog #LogicProgramming
Temas de "Lógica informática" (curso 2011-12). https://web.archive.org/web/http://www.cs.us.es/~jalonso/cursos/li-11/temas/temas-LI-2011-12.pdf #Lógica #ProgramaciónLógica #Prolog
Curso "Lógica informática (2011-12)". https://jaalonso.github.io/cursos/li-11 #Lógica #ProgramaciónLógica #Prolog
Prolog vs LLMs: A complementary approach to AI (according to DeepSeek). https://prologsource.wordpress.com/2025/04/05/prolog-vs-llms-a-complementary-approach-to-ai-according-to-deepseek/ #Prolog #LogicProgramming #LLMs #AI
Building AI for mathematical reasoning. ~ Chris Garcia. https://ai.gopubby.com/building-ai-for-mathematical-reasoning-996a81eb8b72 #Prolog #LogicProgramming #Logic #Math
![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())
}")
Curso de programación lógica. ~ Ana Pradera. https://burjcdigital.urjc.es/server/api/core/bitstreams/30d163ff-af2a-46b8-9b3b-980b87bbf13f/content #Lógica #ProgramaciónLógica #Prolog
Apuntes de lógica: desde Aristóteles hasta Prolog. ~ Joaquín Arias. https://burjcdigital.urjc.es/server/api/core/bitstreams/601a1567-c9b0-43c8-b684-6321230bf781/content #Lógica #ProgramaciónLógica #Prolog
