|To:||cmenzel@xxxxxxxx, "[ontolog-forum]" <ontolog-forum@xxxxxxxxxxxxxxxx>|
|From:||Adrian Walker <adriandwalker@xxxxxxxxx>|
|Date:||Tue, 19 Jan 2010 19:03:35 -0500|
Hi Chris --|
For a given Turing machine M halts on input n if and only if
there is a corresponding proof in first-order logic that in a precise
sense represents M's computation.* Hence, by means of first-order
reasoning one can compute a sum, difference, product, ratio etc just as a Turing machine could -- however, typically it would be a lot quicker and easier just to perform a simple arithmetic proof directly using, say, Peano Arithmetic.
Yes indeed, FOL plus an inference engine can do (integer) arithmetic.
However, in all of the practical logic-based systems I'm aware of, arithmetic is actually done by "built in predicates", aka calls to traditional libraries coded in C, Java or such.
Cheers, -- Adrian
Internet Business Logic
A Wiki and SOA Endpoint for Executable Open Vocabulary English over SQL and RDF
Online at www.reengineeringllc.com Shared use is free, and there are no advertisements
On Tue, Jan 19, 2010 at 6:38 PM, Christopher Menzel <cmenzel@xxxxxxxx> wrote:
_________________________________________________________________ Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/ Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/ Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx Shared Files: http://ontolog.cim3.net/file/ Community Wiki: http://ontolog.cim3.net/wiki/ To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (01)
|<Prev in Thread]||Current Thread||[Next in Thread>|
|Previous by Date:||Re: [ontolog-forum] new logic, Christopher Menzel|
|Next by Date:||Re: [ontolog-forum] new logic, Christopher Menzel|
|Previous by Thread:||Re: [ontolog-forum] new logic, Christopher Menzel|
|Next by Thread:||Re: [ontolog-forum] new logic, Christopher Menzel|
|Indexes:||[Date] [Thread] [Top] [All Lists]|