←back to thread

248 points rishicomplex | 2 comments | | HN request time: 0.396s | source
Show context
sega_sai ◴[] No.42167962[source]
I think the interface of LLM with formalized languages is really the future. Because here you can formally verify every statement and deal with hallucinations.
replies(9): >>42168164 #>>42168732 #>>42168855 #>>42169086 #>>42169255 #>>42169394 #>>42169686 #>>42171742 #>>42176215 #
thesz ◴[] No.42169686[source]
So, you looking for Cyc [1], practically.

[1] https://en.wikipedia.org/wiki/Cyc

replies(3): >>42170205 #>>42171090 #>>42172165 #
auggierose ◴[] No.42170205[source]
Does Cyc have proofs?
replies(1): >>42171072 #
cess11 ◴[] No.42171072[source]
In a sense, yes, since it has a foundation in Prolog style facts and rules, and supposedly can output its reasoning.
replies(1): >>42171103 #
auggierose ◴[] No.42171103[source]
Ok, sounds like in principle you could have proofs, but in practice, you don't?

Are there any checks for the consistency of all facts?

replies(1): >>42171126 #
cess11 ◴[] No.42171126[source]
How could there be? Gödel gets in the way.
replies(1): >>42171489 #
auggierose ◴[] No.42171489[source]
In most interactive theorem provers the check is simple: you single out the axioms you believe, and all other stuff you do is guaranteed to preserve consistency. That works in an ITP system because there are only a few axioms.

If Cyc has 100000 axioms/facts, then that's a problem.

replies(2): >>42172161 #>>42172261 #
1. thesz ◴[] No.42172161[source]
If axioms, facts and rules have types, these types can guide choice.
replies(1): >>42172835 #
2. auggierose ◴[] No.42172835[source]
Not a believer in types here, sorry. I'd rather have simple theorems instead without wading through a swamp of types first. And I am sure AI will be able to handle theorems just fine.