- From: William Waites <wwaites@tardis.ed.ac.uk>
- Date: Tue, 25 Jun 2019 21:17:11 +0100
- To: Patrick J Hayes <phayes@ihmc.us>
- Cc: ProjectParadigm-ICT-Program <metadataportals@yahoo.com>, Dave Raggett <dsr@w3.org>, Paola Di Maio <paoladimaio10@gmail.com>, Amirouche Boubekki <amirouche.boubekki@gmail.com>, Chris Harding <chris@lacibus.net>, xyzscy <1047571207@qq.com>, semantic-web <semantic-web@w3.org>
> 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? 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.
Received on Tuesday, 25 June 2019 20:17:56 UTC