For Publishers
DiscoveryMetadataPeer reviewHostingPublishing
For Researchers
JoinPublishReviewCollect
Register
Blog
About
Search
Advanced search
My ScienceOpen
Search
For Publishers
For Researchers
Blog
About
1
views
4
references
 Top references
cited by
0
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      458
      similar
       All similar
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Towards Distributed Logic Programming based on Computability Logic

      Preprint
      Author(s):
      Publication date Created:

      Read this article at

      ScienceOpenArXiv
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          {\em Computability logic} (CoL) is a powerful computational model which views computational problems as games played by a machine and its environment. It uses formulas to represent computational problems. In this paper, we show that CoL naturally supports multiagent programming models with distributed control. To be specific, we discuss a web-based implemention of a distributed logic programming model based on CoL (CL1 to be exact).

          Related collections

          Most cited references4

          • Record: found
          • Abstract: not found
          • Article: not found

          Introduction to computability logic

          Giorgi Japaridze (2003)
          Article 0 comments Cited 38 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Propositional computability logic I

            Giorgi Japaridze (2006)
            Article 0 comments Cited 2 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: found
              • Article: not found

              Towards applied theories based on computability logic

              Giorgi Japaridze (2010)
              Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, “truth” means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with respect to the semantics of CL. Conservatively extending classical predicate calculus and offering considerable additional expressive and deductive power, CL12 presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories. To obtain a model example of such theories, this paper rebuilds the traditional, classical-logicbased Peano arithmetic into a computability-logic-based counterpart. Among the purposes of the present contribution is to provide a starting point for what, as the author wishes to hope, might become a new line of research with a potential of interesting findings—an exploration of the presumably quite unusual metatheory of CL-based arithmetic and other CL-based applied systems.
              Article 0 comments Cited 1 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and article information

                Journal
                Publication date Created: 16 September 2019
                Article
                ArXiV ID: 1909.07036
                SO-VID: baf21005-0735-416f-9e63-0b36635118fd
                License:

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Comments We discuss an agent programming model with query/knowledgebase duality
                Categories cs.AI cs.PL

                ScienceOpen disciplines: Programming languages,Artificial intelligence
                Data availability:
                ScienceOpen disciplines: Programming languages, Artificial intelligence

                Comments

                Comment on this article