The focus of the paper is on the introduction of some modal temporal logic and its application to knowledge processing under the particularly difficult circumstances of disturbed complex dynamic processes. The develop...
详细信息
We define a dynamic logic for QASM (Quantum Assembly) programming language, a language that requires the handling of quantum and probabilistic information. We provide a syntax and a model to this logic, providing a pr...
详细信息
ISBN:
(纸本)9783030388089;9783030388072
We define a dynamic logic for QASM (Quantum Assembly) programming language, a language that requires the handling of quantum and probabilistic information. We provide a syntax and a model to this logic, providing a probabilistic semantics to the classical part. We exercise it with the quantum coin toss program.
The proceedings contain 12 papers. The topics discussed include: prior to trust: frequentist and Bayesian views of trust in AI;rethinking bias and fairness in AI through the lens of gender studies;gender biases in rob...
The proceedings contain 12 papers. The topics discussed include: prior to trust: frequentist and Bayesian views of trust in AI;rethinking bias and fairness in AI through the lens of gender studies;gender biases in robots for education;towards ethical risk assessment of symbiotic ai systems with fuzzy rules;towards efficient norm-aware robots' decision making using datalog;debiasing computer vision models using data augmentation based adversarial techniques;a perturbation-based dataset evaluation approach for fair classifications;bias amplification chains in ML-based systems with an application to credit scoring;artificial intelligence as a peacebuilding tool: what is missing? a comparative legal analysis;and United Nations, artificial intelligences and regulations: analysis of the general assembly ai resolutions and the final report of the advisory body on AI.
The proceedings contain 14 papers. The topics discussed include: modelling uncertainty in agent programming;complete axiomatizations of finite syntactic epistemic states;an architecture for rational agents;LAMA: a mul...
详细信息
ISBN:
(纸本)3540331069
The proceedings contain 14 papers. The topics discussed include: modelling uncertainty in agent programming;complete axiomatizations of finite syntactic epistemic states;an architecture for rational agents;LAMA: a multi-agent platform using ordered choice logicprogramming;a distributed architecture for norm-aware agent societies;about declarative semantics of logic-based agent languages;goal decomposition tree: an agent model to generate a validated agent behaviour;resource-bounded belief revision and contraction;agent-oriented programming with underlying ontological reasoning;dynagent: an incremental forward-chaining HTN planning agent in dynamic domains;a combination of explicit and deductive knowledge with branching time: completeness and decidability results;an intensional programming approach to multi-agent coordination in a distributed network of agents;and a tableau method for verifying dialogue game protocols for agent communication.
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.
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.
In the context of Answer Set programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive l...
详细信息
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...
详细信息
This paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, an...
详细信息
This paper describes a system called SELP for studying strong equivalence in answer set logicprogramming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. This allows us to investigate some interesting properties of strong equivalence, such as a complete characterization for a rule to be strongly equivalent to another one, and checking whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.
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.
暂无评论