Meta-interpretive learning (MIL) is a form of inductivelogicprogrammingthat learns logic programs from background knowledge and examples. We claim that adding types to MIL can improve learning performance. We show ...
详细信息
ISBN:
(纸本)9783030195700;9783030195694
Meta-interpretive learning (MIL) is a form of inductivelogicprogrammingthat learns logic programs from background knowledge and examples. We claim that adding types to MIL can improve learning performance. We show that type checking can reduce the MIL hypothesis space by a cubic factor. We introduce two typed MIL systems: MetagolT and HEXMILT, implemented in Prolog and Answer Set programming (ASP), respectively. Both systems support polymorphic types and can infer the types of invented predicates. Our experimental results show that types can substantially reduce learning times.
Intentional forgetting means to deliberately give up information and is a crucial part of change or consolidation processes, or to make knowledge more compact. Two well-known forgetting operations are contraction in t...
详细信息
ISBN:
(纸本)9783030299088;9783030299071
Intentional forgetting means to deliberately give up information and is a crucial part of change or consolidation processes, or to make knowledge more compact. Two well-known forgetting operations are contraction in the AGM theory of belief change, and various types of variable elimination in logicprogramming. While previous work dealt with postulates being inspired from logicprogramming, in this paper we focus on evaluating forgetting in epistemic states according to postulates coming from AGM belief change theory. We consider different forms of contraction, marginalization, and conditionalization as major representatives of forgetting operators to be evaluated. We use Spohn's ranking functions as a common semantic base to show that all operations can be realized in one logical framework, thereby exploring the richness of forgetting operations in a comparable way.
this paper presents robust optimization models for minimizing the required backup capacity with probabilistic protection against multiple simultaneous failures of physical machines in a cloud provider. If random failu...
详细信息
ISBN:
(数字)9781728163000
ISBN:
(纸本)9781728163017
this paper presents robust optimization models for minimizing the required backup capacity with probabilistic protection against multiple simultaneous failures of physical machines in a cloud provider. If random failures occur, the required capacities for virtual machines are allocated to the dedicated backup physical machines, which are determined in advance. We consider two uncertainties, failure event and virtual machine capacity. By adopting the robust optimization technique, we formulate three mixed integer linear programming problems. there are differences of robustness between the three models. then we provide theorems concerned withthe differences and prove them. the theorems are supported by numerical results. Our three presented models are applicable to the case that virtual machine capacities are uncertain, and by using these models, we can obtain the optimal solution of the allocation of virtual machines under the uncertainty.
Learning informatics is complex process because of many different paradigms, languages withtheir own logic, syntax etc. therefore it is not easy for students without any previous knowledge in such field to learn prog...
详细信息
ISBN:
(纸本)9781538679142
Learning informatics is complex process because of many different paradigms, languages withtheir own logic, syntax etc. therefore it is not easy for students without any previous knowledge in such field to learn programming. In our faculty, all students starts with learning of object oriented paradigm in Java programming language. To make it easier for them in the beginning we decide to implement tool, that will help them to learn programming paradigms without knowledge of specific programming language. this tool allows users to design algorithm using activity diagrams from which final code is generated. this tool is developed by students within Project course in our faculty. In this paper we describe project management system we start using to organize work on FRIMAN project and also current development state of every module FRIMAN composes from. We also present some of the plans for future.
this paper proposed a two-stage objective function with genetic algorithm (GA) to refine an additional fuzziness layer on dynamic membership intervals of Type-I fuzzy logic control(FLC). the refined dynamic membership...
详细信息
ISBN:
(数字)9781728177090
ISBN:
(纸本)9781728177106
this paper proposed a two-stage objective function with genetic algorithm (GA) to refine an additional fuzziness layer on dynamic membership intervals of Type-I fuzzy logic control(FLC). the refined dynamic membership intervals Type-I FLC is applied on a traditional ball and beam system, serving as a prototype for a friction fruit conveyor system. the ball and beam system governed under Type-I FLC is excited with step input, the corresponding system performance factors are captured - rise time, settling time and overshoot. A probabilistic random search on optimum controller parameters is carried with GA method, multiple cost functions - ISE, IAE, ITSE and ITAE, with are evaluated to form a performance cost matrix, which is the first stage of the objective function. the optimum parameter search stops with two conditions; one is that the maximum number of chromosome generation is reached, and the other one is that performance cost stops improving consecutively for ten generations. the second stage of the objective function is proceeded to decide the found optimum controller parameter solution. the result is decided by taking account of the previously captured performance factors. these factors are normalized and combined with a heuristic weight set to determine a minimum decision cost. the minimum cost chromosome, with ITAE, is the optimum from global found solution space and sets fixed intervals on the dynamic membership range of Type-I FLC. With two-stage objective function, improved rise time and settling time performance are indicated on the GA tuned Type-I FLC dynamic membership intervals on the ball and beam system than the conventional Type-I FLC, and is satisfactory.
In this work, we show that bothlogicprogramming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we...
详细信息
ISBN:
(纸本)9781577358039
In this work, we show that bothlogicprogramming and abstract argumentation frameworks can be interpreted in terms of Nelson's constructive logic N4. We do so by formalising, in this logic, two principles that we call non-contradictory inference and strengthened closed world assumption: the first states that no belief can be held based on contradictory evidence while the later forces both unknown and contradictory evidence to be regarded as false. Using these principles, bothlogicprogramming and abstract argumentation frameworks are translated into constructive logic in a modular way and using the object language. logicprogramming implication and abstract argumentation supports become, in the translation, a new implication connective following the non-contradictory inference principle. Attacks are then represented by combining this new implication with strong negation.
Recent years have witnessed a significant expansion in Internet-of-things (IoT) applications, especially in environmental monitoring, which aims at providing full coverage over potential targets. With energy harvestin...
详细信息
ISBN:
(数字)9783903176317
ISBN:
(纸本)9781665415477
Recent years have witnessed a significant expansion in Internet-of-things (IoT) applications, especially in environmental monitoring, which aims at providing full coverage over potential targets. With energy harvesting ability, sensor devices can be replenished by external energy sources, and thus their lifetime is prolonged. While existing literature focuses on minimizing deployment costs, the reliability management is overlooked. Previous research has addressed that a higher temperature exponentially accelerates hardware failure rates. the versatile outdoor environments impose a non-negligible thermal stress on the hardware and consequently reduce the reliability of devices. In this paper, we are the first to propose a reliability-driven sensor deployment approach to achieve minimum nodes, while satisfying (i) full target coverage, (ii) complete connectivity, (iii) energy-neutral operation, and (iv) reliability constraints. Given external temperature distribution, we propose an algorithm to convert reliability constraints to a single-value power threshold for each location. A Mixed Integer Linear programming (MILP) model is formulated and solved with CPLEX. Due to the complex nature of MILP, we propose a heuristic, named Reliability-driven TwoStage Heuristic (R-TSH), to approximate the optimal solution for large-scale problems. Extensive simulations are performed on a real-world dataset from the National Solar Radiation Database. Our results indicate that R-TSH meets all reliability constraints with only 20% more sensors than the optimal solution, while executing more than 1500x faster. Compared to state-of-the-art heuristics, R-TSH avoids 20 - 80% of reliability violations with a comparable number of nodes and execution time.
logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the high-level construct of ordered disjunction whereas asprin is a recently proposed, general,...
详细信息
ISBN:
(纸本)9781577358039
logic Programs with Ordered Disjunction (LPOD) is an extension of standard answer set programs to handle preference using the high-level construct of ordered disjunction whereas asprin is a recently proposed, general, flexible, and extensible framework that provides low-level constructs for representing preference in answer set programming. We present an encoding of LPOD in the language of asprin and the implementation of LPOD called LPOD2ASPRIN based on the encoding. Unlike the known method that applies only to a fragment of LPOD, our translation is general, direct, and simpler. It also leads to more efficient computation of LPOD using asprin.
In the area of computing and engineering, supervision of final theses is a complex and challenging endeavor. Within this study, we present results of students taking part in real-life programming projects as part of t...
详细信息
暂无评论