> On Jun 25, 2019, at 1:17 PM, William Waites <wwaites@tardis.ed.ac.uk> wrote:
>
>> There are some fairly deep results which suggest that any computably effective
>> KR notation will not be /more/ expressive than FO logic.
>
> Could you be more specific?
See https://lists.w3.org/Archives/Public/semantic-web/2019Jun/0162.html <https://lists.w3.org/Archives/Public/semantic-web/2019Jun/0162.html>
Pat
> I can think of reasons this might be so depending on
> what "computably effective" means. For example would something richer than first
> order with a statistical inference approach that sometimes misses entailments
> but gets it right most of the time count as "computably effective"? I'm curious
> what fairly deep results you are referring to.
>
> Best wishes,
>
> William Waites | wwaites@inf.ed.ac.uk
> Laboratory for Foundations of Computer Science
> School of Informatics, University of Edinburgh
>
> --
> The University of Edinburgh is a charitable body, registered in
> Scotland, with registration number SC005336.
>
>