John,
We have the language exactly as you describe "ACE appears perfectly natural, but — being a controlled subset of English — is in fact a formal language. ACE texts are computer-processable and can be unambiguously translated into discourse representation structures, a syntactic variant of first-order logic. Discourse representation structures derived from ACE texts have been translated into various other languages, for instance into FOL, FLUX, RuleML, R2ML, TPTP, and a rule format to be used for Courteous Logic Programs and for stable model semantics. Using discourse representation structures as inter-lingua we have developed a bidirectional translation of ACE into and from OWL 2 and a translation into SWRL." see http://attempto.ifi.uzh.ch/site/
Usability of language is a subtle thing. But crucial is a kind of knowledge processing we have on texts in this language. Here [1] is a log from reasoner.
And here [2] is reasoner services.
Why not ACE?
Alex
[1]
INFO 08:39:53 ------------------------------- Running Reasoner -------------------------------
INFO 08:39:54 Pre-computing inferences:
INFO 08:39:54 - class hierarchy
INFO 08:39:54 - object property hierarchy
INFO 08:39:54 - data property hierarchy
INFO 08:39:54 - class assertions
INFO 08:39:54 - object property assertions
INFO 08:39:54 - data property assertions
INFO 08:39:54 - same individuals
INFO 08:40:00 Ontologies processed in 6595 ms by HermiT
[2]
To unsubscribe from this group and stop receiving emails from it, send an email to ontolog-foru...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/1c100a89-698c-414e-a72e-05e8cf3d80f2%40googlemail.com.
I don’t think this addresses all the concerns around OWL, but the work I did some years ago (https://oro.open.ac.uk/56672/) did look at some of the difficulties people experience with OWL. I was looking specifically at the Manchester OWL Syntax, but some of my comments are more general.
There is also a paper by Sarkar et al. (https://arxiv.org/pdf/1808.10108), which Pascal himself presented at a conference some years ago. This work provided strong evidence that rules are much easier for humans to understand than DL axioms.
Regards.
Paul Warren
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/CAJ%3D-dmYX90TU3pjHeXeV_mVEY4EgQ4Z5%2BS6r%3DbJaA8OQ3mFU1A%40mail.gmail.com.
To unsubscribe from this group and stop receiving emails from it, send an email to ontolog-foru...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/d4f8b5f9-515f-4056-9630-409e8cf761e6%40googlemail.com.
On Jan 7, 2025, at 10:42 AM, Ítalo Oliveira <italojso...@gmail.com> wrote:
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/CAOEC0q-NGdGqewFAQt3paxsTqo%2BZ%2BEwDCcLTCbs3P4mG--9yTA%40mail.gmail.com.
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/CAOEC0q-NGdGqewFAQt3paxsTqo%2BZ%2BEwDCcLTCbs3P4mG--9yTA%40mail.gmail.com.
given a description (in FOL vs OWL), determining what it means
given a concept in someone’s mind, determining what description to use. This has three aspects:
determining whether the concept has already been defined
if it has been defined, discovering what description has been used for it
if it is not already defined, finding related concepts that it can be defined in terms of, and finding an appropriate description
Hi Stefan,
A class of languages where we can apply function to function (as an instance), and where predicate is just bool-function, are called Higher-Order Logic languages.
Mostly used in proof-makers like https://isabelle.in.tum.de/dist/Isabelle2024/doc/prog-prove.pdf here https://isabelle.in.tum.de/documentation.html
" We introduce HOL step by step following the equation HOL = Functional Programming + Logic. We assume that the reader is used to logical and set-theoretic notation and is familiar with the basic concepts of functional programming. Chapter 2 introduces HOL as a functional programming language and explains how to write simple inductive proofs of mostly equational properties of recursive functions. Chapter 3 introduces the rest of HOL: the language of formulas beyond equality, automatic proof tools, single-step proofs, and inductive definitions, an essential specification construct. Chapter 4 introduces Isar, Isabelle’s language for writing structured proofs. "
Usage of these powerful languages for formal ontologies is on the way.
Alex
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/CAJ%3D-dmYX90TU3pjHeXeV_mVEY4EgQ4Z5%2BS6r%3DbJaA8OQ3mFU1A%40mail.gmail.com.
David,
JFS is talking about OWL3 i.e. yet another formal language for knowledge representation. But IMHO the more the better, as we have with programming languages.
The question is what is the purpose to formalize some set of NL-expressed knowledge? What kind of algorithms are we ready to apply to formulas for fruitful knowledge processing?
If formalization is not readable directly we need just a verbalization tool: formula to NL translation.
And in OWL2 ontology we should keep the NL version of any axiom in annotation - as a good style.
Alex
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/91A6352B-A7DD-42FD-BFB6-A0DB62FCDBC4%40cs.ubc.ca.
David,
Following your "Figure 16.5 gives some primitive predicates of OWL. The owl: prefix is an abbreviation for the standard IRI for OWL."
let me add that OWL2\FS is a HOL type language as described here
And I should add that (PDF) English is a HOL language message #1X
In which form do we have theoretical knowledge right now in computers, publicly and privately? Something like NL+Math. Except genAI
If we formalize this knowledge do we get a huge number of formal axiomatic theories?
What are the advantages we get?
Knowledge concentration is one. (PDF) Theory framework - knowledge hub message #1.
Alex
--
All contributions to this forum are covered by an open-source license.
For information about the wiki, the license, and how to subscribe or
unsubscribe to the forum, see http://ontologforum.org/info
---
You received this message because you are subscribed to the Google Groups "ontolog-forum" group.
To unsubscribe from this group and stop receiving emails from it, send an email to ontolog-foru...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/ontolog-forum/EC2A2153-DF25-435C-A1B8-4F8905C35B58%40cs.ubc.ca.