3 years ago

The goal is to not use existing decision methods for a knowledge representation languages even though the Tau languages supports that.
We want to have as fewest engines as possible. If we can translate a knowledge representation languages into our existing engines which are boolean algebra engines, then the whole thing be much less complex and much faster developed.

We made a really a great progress in showing how very rich description logics can be encoded in boolean algebra. This even gives rise to question why people don't do it before, but indeed to do it, they will need to know about good decision procedures for boolean algebra which where just not around apparently, the old open question I solved some time ago is the missing piece required in order to have a reasonable decision procedures for boolean algebra. - Ohad Asor, Founder and CTO of Tau https://tau.net/our-team/

Watch YT Shorts at
🚀https://youtube.com/shorts/6zZ0gqHnIXc

Watch the full video of August Development Update 2022 at
🚀 https://www.youtube.com/watch?v=x9R-8NJGG20

🧀Test Tau Meta Language.
🔗 tml.tau.net
📄Abstract: Draft for Community Review
🔗https://lnkd.in/gWJZj9sN
😼Published Codes
🔗 github.com/IDNI/TML
🌐Website of Tau
🔗 tau.net/
👨‍🏫Tutorial Videos of TML
🔗https://rb.gy/9ahenx
✈️Telegram community
🔗t.me/tauchain