In this paper, we explore the use of Linear logicprogramming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a numb...
详细信息
ISBN:
(纸本)9783642405648
In this paper, we explore the use of Linear logicprogramming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. this approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms.
A combination of fuzzy logic, genetic algorithm and dynamic programming has been applied to optimize the problem of capacitor placement on distribution feeders. the cost function consists of three terms: the total cos...
详细信息
ISBN:
(纸本)9781934272329
A combination of fuzzy logic, genetic algorithm and dynamic programming has been applied to optimize the problem of capacitor placement on distribution feeders. the cost function consists of three terms: the total cost of energy loss, the total cost of capacitors, including the purchase and installation costs, and one constant term related to total cost of produced power in peak load condition. A multi-objective and non-differentiable optimization problem is formulated. the proposed method of this article uses fuzzy reasoning for siting of capacitors, optimized by genetic algorithm, which finds the optimum weighting factors of fuzzy membership functions. Dynamic programming is used for sizing of the capacitors. Varying load condition of the distribution system has been considered in the optimization problem. the proposed method has been implemented in a software package and its effectiveness has been verified on a 34-bus radial distribution feeder, as a practical case study. A comparison has been made between the proposed method of this paper and similar methods in other research works, which shows the effectiveness of the proposed method of this paper for solving optimum capacitor planning problem.
Developing robust, safe and security-critical software is of paramount importance for real-time applications. In order to obtain reliable software we believe that special attention should be paid to rigorous testing d...
详细信息
the learning of rules from examples is of continuing interest to machine learning since it allows generalization from fewer training examples. inductivelogicprogramming (ILP) generates hypothetical rules (clauses) f...
详细信息
We present efficient Pure Pointer Machine (PPM) algorithms to test for "leftness" in dynamic search trees and related problems. In particular, we show that the problem of testing if a node x is in the leftmo...
详细信息
ISBN:
(纸本)354030553X
We present efficient Pure Pointer Machine (PPM) algorithms to test for "leftness" in dynamic search trees and related problems. In particular, we show that the problem of testing if a node x is in the leftmost branch of the subtree rooted in node y, in a dynamic tree that grows and shrinks at the leaves, can be solved on PPMs in worst-case O((lg lg n)(2)) time per operation in the semi-dynamic case-i.e., all the operations that add leaves to the tree are performed before any other operations-where n is the number of operations that affect the structure of the tree. We also show that the problem can be solved on PPMs in amortized O((lg lg n)(2)) time per operation in the fully dynamic case.
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a f...
详细信息
ISBN:
(纸本)9783642405648
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a formal characterization of the corresponding multi-criteria optimization problem. We then address this problem by Answer Set programming in order to solve real-world matchmaking instances, which were previously dealt with by special-purpose algorithms.
We present tableau calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for preferential and cumulative logics. Our calculi are obtained by introduc...
详细信息
ISBN:
(纸本)354030553X
We present tableau calculi for some logics of default reasoning, as defined by Kraus, Lehmann and Magidor. We give a tableau proof procedure for preferential and cumulative logics. Our calculi are obtained by introducing suitable modalities to interpret conditional assertions. Moreover, they give a decision procedure for the respective logics and can be used to establish their complexity.
Distribution-aware answer set sampling has a wide range of potential applications, for example in the area of probabilistic logicprogramming or for the computation of approximate solutions of combinatorial or search ...
详细信息
ISBN:
(纸本)9783030004613;9783030004606
Distribution-aware answer set sampling has a wide range of potential applications, for example in the area of probabilistic logicprogramming or for the computation of approximate solutions of combinatorial or search problems under uncertainty. this paper introduces algorithms for the sampling of answer sets under given probabilistic constraints. Our approaches allow for the specification of probability distributions over stable models using probabilistically weighted facts and rules as constraints for an approximate sampling task with specifiable accuracy. At this, we do not impose any independence requirements on random variables. An experimental evaluation investigates the performance characteristics of the presented algorithms.
the proceedings contain 14 papers. the special focus in this conference is on Rewriting logic and its Applications. the topics include: Proving ground confluence of equational specifications modulo axioms;uniform stro...
ISBN:
(纸本)9783319998398
the proceedings contain 14 papers. the special focus in this conference is on Rewriting logic and its Applications. the topics include: Proving ground confluence of equational specifications modulo axioms;uniform strong normalization for multi-discipline calculi;real-time rewriting logic semantics for spatial concurrent constraint programming;Approximating any logic program by a CS-program;multi-paradigm programming in maude;MUnit: A unit framework for maude;parameterized programming for compositional system specification;Symbolic specification and verification of data-aware BPMN processes using rewriting modulo SMT;associative unification and symbolic reasoning modulo associativity in maude;proving structural properties of sequent systems in rewriting logic;formal modeling and analysis of the walter transactional data store;extending timbuk to verify functional programs.
暂无评论