We introduce a representation of agents by means of theories, and a cortmaunication among agents based on reflection, within the metalogicprogramming paradigm. The semantics of these features is shown to be the class...
详细信息
Smart Contracts are computer programs which implement and execute transactions and manage business logic on a decentralized public ledger. Smart Contracts can be written in different programming languages and for diff...
详细信息
ISBN:
(纸本)9781728162782
Smart Contracts are computer programs which implement and execute transactions and manage business logic on a decentralized public ledger. Smart Contracts can be written in different programming languages and for different Blockchains. Currently the most used language for Smart Contracts is Solidity and the most used platform is the Ethereum Blockchain. Assessing the quality of Smart Contract programs is an important task required to professional programmers, especially when a programming language has so powerful economic implications. It is therefore crucial to provide professional programmers with tools for the evaluation of Smart Contracts. In software engineering, software metrics has been defined and used to measure software quality and, more in general, to qualify software under the principle "You Can't Manage What You Don't Measure". For the Solidity programming language there are only a few Standalone Applications to analyse the Smart Contract metrics. The aim of this paper is first to build a tool for the practical computation of a specific set of Solidity source code metrics, so that the set will be extensible in the future according also to Solidity compiler evolution, second to fully enable a web based usage of the tool to access the metrics of the Solidity programming language. The tool, PASO, differently from the existing application, is able to give software metrics values for Smart Contracts written in Solidity programming language just using a web browser.
Inductive programming (IP)-the use of inductive reasoning methods for programming, algorithm design, and software development is a currently emerging research field. A major subfield is inductive program synthesis, th...
详细信息
ISBN:
(纸本)9783642119309
Inductive programming (IP)-the use of inductive reasoning methods for programming, algorithm design, and software development is a currently emerging research field. A major subfield is inductive program synthesis, the (semi-)automatic construction of programs from exemplary behavior. Inductive program synthesis is not a unified research field until today but scattered over several different established research fields such as machine learning, inductive logicprogramming, genetic programming, and functional programming. This impedes an exchange of theory and techniques and, as a consequence, a progress of inductive programming. In this paper we survey theoretical results and methods of inductive program synthesis that have been developed in different research fields until today.
The annual internationalworkshop LENLS (logic and Engineering of Natural Language Semantics) covers topics in formal linguistics and related fields, such as theoretical computer science, mathematical logic and formal...
详细信息
The papers in this volume are extended versions of presentations at the fourth internationalworkshop on Extensions of logicprogramming, held at the University of St Andrews, March/April 1993. Among the topics covere...
详细信息
ISBN:
(数字)9783540484172
ISBN:
(纸本)9783540580256
The papers in this volume are extended versions of presentations at the fourth internationalworkshop on Extensions of logicprogramming, held at the University of St Andrews, March/April 1993. Among the topics covered in the volume are: defintional reflection and completion, modules in lambda-Prolog, representation of logics as partial inductive definitions, non-procedural logicprogramming, knowledgerepresentation, contradiction avoidance, disjunctive databases, strong negation, linear logicprogramming, proof theory and regular search spaces, finite sets and constraint logicprogramming, search-space pruning and universal algebra, and implementation on transputer networks.
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This moti...
详细信息
Tropical polyhedra have been recently used to represent disjunctive invariants in static analysis. To handle larger instances, tropical analogues of classical linear programming results need to be developed. This motivation leads us to study the tropical analogue of the classical linear-fractional programming problem. We construct an associated parametric mean payoff game problem, and show that the optimality of a given point, or the unboundedness of the problem, can be certified by exhibiting a strategy for one of the players having certain infinitesimal properties (involving the value of the game and its derivative) that we characterize combinatorially. We use this idea to design a Newton-like algorithm to solve tropical linear-fractional programming problems, by reduction to a sequence of auxiliary mean payoff game problems. (C) 2012 Elsevier Ltd. All rights reserved.
作者：
Wiggins, Geraint ADREAM Group
Department of Artificial Intelligence University of Edinburgh 80 South Bridge EdinburghEH1 1HN United Kingdom
I discuss issues of control and floundering during execution of automatically synthesised logic programs. The process of program synthesis can be restricted, without loss of generality, so that the only negated calls ...
详细信息
In this paper we propose the general software engineering approach of transforming an agent into an Agent Computational Environment (ACE) composed of: (1) the "main" agent program;(2) a number of Event-Actio...
详细信息
ISBN:
(纸本)9783319261843;9783319261836
In this paper we propose the general software engineering approach of transforming an agent into an Agent Computational Environment (ACE) composed of: (1) the "main" agent program;(2) a number of Event-Action modules for Complex Event Processing, including generation of complex actions;(3) a number of external contexts that the agent is able to access in order to gather information. In our view an ACE is composed of heterogeneous elements: therefore, we do not make assumptions about how the various components are defined, except that they are based upon Computational logic. In order to show a concrete instance of ACE, we discuss an experiment based upon the DALI agent-oriented programming language and Answer Set programming (ASP).
Snomed ct is a large-scale medical ontology, which is developed using a variant of the inexpressive Description logic EL. Description logic reasoning can not only be used to compute subsumption relationships between S...
详细信息
Snomed ct is a large-scale medical ontology, which is developed using a variant of the inexpressive Description logic EL. Description logic reasoning can not only be used to compute subsumption relationships between Snomed concepts, but also to pinpoint the reason why a certain subsumption relationship holds by computing the axioms responsible for this relationship. This helps developers and users of Snomed ct to understand why a given subsumption relationship follows from the ontology, which can be seen as a first step toward removing unwanted subsumption relationships. In this paper, we describe a new method for axiom pinpointing in the Description logic EL+, which is based on the computation of so-called reachabilitybased modules. Our experiments on Snomed ct show that the sets of axioms explaining subsumption are usually quite small, and that our method is fast enough to compute such sets on demand.
We introduce the temporal logic HAWK and its supporting tool for runtime verification of Java programs. A monitor for a HAWK formula checks if a finite trace of program events satisfies the formula. HAWK is a programm...
详细信息
暂无评论