On the Turing completeness of the semantic web

DOI10.1007/S00224-014-9536-XzbMATH Open1328.68020OpenAlexW2153937982MaRDI QIDQ2345982FDOQ2345982

Authors: Amir Pourabdollah, Tim Brailsford 

Publication date: 29 May 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://irep.ntu.ac.uk/id/eprint/33088/1/PubSub10619_Pourabdollah.pdf

Recommendations

• A semantic approach for web reasoning
• The semantic web
• scientific article; zbMATH DE number 2088349
• scientific article; zbMATH DE number 2088339
• Well-founded semantics for description logic programs in the semantic web

zbMATH Keywords

relationsRDFsemantic webhypertext

Mathematics Subject Classification ID

Internet topics (68M11)

Cites Work

• A relational approach to the design of deterministic programs
• Queries and computation on the web
• On the Expressiveness of Links in Hypertext Systems

Cited In (2)

• The navigational power of web browsers
• Algorithmic statistics: normal objects and universal models

Uses Software

• Turtle

This page was built for publication: On the Turing completeness of the semantic web

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345982)