Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like machine-learning systems, are not strictly binary but associated with some degree of (lack of) confidenc...
详细信息
Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like machine-learning systems, are not strictly binary but associated with some degree of (lack of) confidence in the observation. We propose MV-Datalog and MV-Datalog(+/-) as extensions of Datalog and Datalog(+/-), respectively, to the fuzzy semantics of infinite-valued Lukasiewicz logic L as languages for effectively reasoning in scenarios where such uncertain observations occur. We show that the semantics of MV-Datalog exhibits similar model theoretic properties as Datalog. In particular, we show that (fuzzy) entailment can be decided via minimal fuzzy models. We show that when they exist, such minimal fuzzy models are unique and can be characterised in terms of a linear optimisation problem over the output of a fixed-point procedure. On the basis of this characterisation, we propose similar many-valued semantics for rules with existential quantification in the head, extending Datalog(+/-).
Female under-representation in Computing Sciences is a structural problem and hence, solving it requires a profound social change. Indeed, our millenary cultures' collective unconscious contains ingrained position...
详细信息
The internal audits carried out in the first half of 2019 in water laboratories as part of quality accreditation in accordance with ISO/IEC 17025:2017 showed a high frequency of adverse events in connection with sampl...
详细信息
The internal audits carried out in the first half of 2019 in water laboratories as part of quality accreditation in accordance with ISO/IEC 17025:2017 showed a high frequency of adverse events in connection with sampling. These faults can be a consequence of a wide range of causes, and in some cases, the information about them can be insufficient or unclear. Considering that sampling has a major influence on the quality of the analytical results provided by water laboratories, this work presents a system for reporting and learning adverse events. Its aim is to record nonconformities, errors, and adverse events, making possible automatic data analysis aiming to ensure continuous improvement in operational sampling. The system is based on the Eindhoven Classification Model and enables automatic data analysis and reporting to identify the main causes of failure. logic programming is used to represent knowledge and support the reasoning mechanisms to model the universe of discourse in scenarios of incomplete, contradicting, or even unknown information. In addition to suggesting solutions to the problem, the system provides formal evidence of the solutions presented, which will help to continuously improve drinking water quality and promote public health.
Boolean Networks (BNs) are widely used as a modeling formalism in several domains, notably systems biology and computer science. A fundamental problem in BN analysis is the enumeration of trap spaces, which are hyperc...
详细信息
interpretation allows constructing sound static analysis tools by safely approximating program semantics. Frameworks for abstract interpretation typically provide an implementation of a specialized iteration strategy ...
详细信息
ISBN:
(纸本)9783031457838;9783031457845
interpretation allows constructing sound static analysis tools by safely approximating program semantics. Frameworks for abstract interpretation typically provide an implementation of a specialized iteration strategy to compute an abstract fixpoint, as well as a number of abstract domains in order to approximate different program properties. However, the design and implementation of additional domains, as well as their combinations, is eventually necessary to successfully prove arbitrary program properties. We propose a rule-based methodology for rapid design and prototyping of new domains and combining existing ones, with a focus on the analysis of logic programs. We provide several examples for domains combining numerical properties and data types and apply them to proving complex program properties.
In answer set programming, two groups of rules are considered strongly equivalent if replacing one group by the other within any program does not affect the set of stable models. Jan Heuer has designed and implemented...
详细信息
ISBN:
(纸本)9783031436185;9783031436192
In answer set programming, two groups of rules are considered strongly equivalent if replacing one group by the other within any program does not affect the set of stable models. Jan Heuer has designed and implemented a system that verifies strong equivalence of programs in the ASP language mini-gringo. The design is based on the syntactic transformation tau * that converts mini-gringo programs into first-order formulas. Heuer's assertion about tau * that was supposed to justify this procedure turned out to be incorrect, and in this paper we propose an alternative justification for his algorithm. We show also that if tau * is replaced by the simpler and more natural translation nu then the algorithm will still produce correct results.
Sampling over combinatorial spaces is a fundamental problem in artificial intelligence with a wide variety of applications. Since state-of-the-art techniques heavily rely on heuristics whose rigorous analysis remain b...
详细信息
Sampling over combinatorial spaces is a fundamental problem in artificial intelligence with a wide variety of applications. Since state-of-the-art techniques heavily rely on heuristics whose rigorous analysis remain beyond the reach of current theoretical tools, the past few years have witnessed interest in the design of techniques to test the quality of samplers. The current state-of-the-art techniques, Barbarik and Barbarik2, focus on the cases where combinatorial spaces are encoded as Conjunctive Normal Form (CNF) formulas. While CNF is a general-purpose form, often techniques rely on exploiting specific representations to achieve speedup. Of particular interest are Horn clauses, which form the basis of the logic programming tools in AI. In this context, a natural question is whether it is possible to design a tester that can determine the correctness of a given Horn sampler. The primary contribution of this paper is an affirmative answer to the above question. We design the first tester, Flash, which tests the correctness of a given Horn sampler: given a specific distribution I and parameters eta, epsilon, and delta, the tester Flash correctly (with probability at least 1 -delta) distinguishes whether the underlying distribution of the Horn-sampler is "epsilon-close" to I or "eta-far" from I by sampling only (O) over tilde (tilt(3) /(eta -epsilon)(4)) samples from the Hornsampler, where the tilt is the ratio of the maximum and the minimum (non-zero) probability masses of I. We also provide a prototype implementation of Flash and test three state-of-the-art samplers on a set of benchmarks.
Developing and releasing multiservice applications rely upon a pipeline of automation tools known as Continuous Integration/Continuous Deployment. Among those tools, continuous reasoning is exploited by large companie...
详细信息
Developing and releasing multiservice applications rely upon a pipeline of automation tools known as Continuous Integration/Continuous Deployment. Among those tools, continuous reasoning is exploited by large companies to perform incremental static analyses on their code commits as soon as they are integrated into a shared codebase. In this article, we extend continuous reasoning towards the continuous QoS- and context-aware management of multiservice applications in Cloud-IoT scenarios. We propose a novel continuous reasoning methodology that supports runtime decision on service placement by reacting both to changes in the infrastructure and in the application requirements, and capable of suggesting migrations only for services affected by such changes. The methodology is prototyped in Prolog and assessed through simulations over a realistic use case and over a lifelike motivating scenario at increasing infrastructure sizes. Experimental results show that our approach brings considerable speed-up in comparison with an exhaustive search employing non-incremental reasoning.
Strong Persistence pSPq, since its perception ten years ago, has been at the center of attention in the realm of forgetting in logic programming. So-called forgetting instances, for which it is possible to obtain pSPq...
详细信息
Answer set programs in practice are often subject to change. This can lead to inconsistencies in the modified program due to conflicts between rules which are the results of the derivation of strongly complementary li...
详细信息
Answer set programs in practice are often subject to change. This can lead to inconsistencies in the modified program due to conflicts between rules which are the results of the derivation of strongly complementary literals. To facilitate the maintenance of consistency in answer set programs, in this paper we continue work on a recently presented framework that implements interactive conflict resolution by extending the bodies of conflicting rules by suitable literals, so-called 2,-extensions. More precisely, we present strategies to choose 2, -extensions that allow for resolving several conflicts at a time in an order that aims at minimizing (cognitive) efforts. In particular, we present a graphical representation of connections between conflicts and their possible solutions. Such a representation can be utilized to efficiently guide the user through the conflict resolution process by displaying conflicts and suggesting solutions in a suitable order.
暂无评论