Some of the issues in case retrieval and maintenance of case-bases are discussed. Conventionally, nearest neighbor algorithm is applied for retrieval of similar cases. Uniqueness of feature-values is not rewarded in s...
详细信息
ISBN:
(纸本)1577352343
Some of the issues in case retrieval and maintenance of case-bases are discussed. Conventionally, nearest neighbor algorithm is applied for retrieval of similar cases. Uniqueness of feature-values is not rewarded in such similarity matching functions. In order to refine the retrieval process, a metric based on successful case usage in the past is incorporated. This metric is shown to be useful in case-base maintenance. Applications in Homoeopathy remedy and personal tour selection are presented with comparative results.
Prolog, which stands for programming in logic, is the most widely used language in the logic programming paradigm. One of its main concepts is unification. It represents the mechanism of binding the contents of variab...
详细信息
Prolog, which stands for programming in logic, is the most widely used language in the logic programming paradigm. One of its main concepts is unification. It represents the mechanism of binding the contents of variables and can be seen as solving conjunctions of equations over finite or infinite trees. We present in this paper a first-order extension of Prolog's unification by giving a general algorithm for solving any first-order constraint in an extended theory T of finite or infinite trees. For that, we extend the theory of finite or infinite trees by a relation which allows to distinguish between finite and infinite trees and present a first-order axiomatization of this extended theory. We then show the completeness of T by a giving a first-order constraint solver in T in the form of 16 rewriting rules. We end this paper describing a CHR implementation of our algorithm. CHR (Constraint Handling Rules) has originally been developed for writing constraint solvers, but the constraints here go much beyond implicitly quantified conjunctions of atomic constraints and are considered as arbitrary first-order formulas built on the signature of T. We discuss how we implement nested local constraint stores and what programming patterns and language features we found useful in the CHR implementation of our algorithm. This is the first CHR first-order constraint solver!.
The paper aims at a semantic study of the integration of blackboards in logic programming. To that end, a new logic programming framework involving Lindalike primitives is proposed first. It is dedicated to no particu...
详细信息
We present an extension of GLukG, a logic that was introduced in [6] as a three-valued logic under the name of G3′ 3. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to de...
详细信息
We present an extension of GLukG, a logic that was introduced in [6] as a three-valued logic under the name of G3′ 3. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to define the p-stable semantics of logic programming. We introduce a new axiomatic system, N-GLukG, a paraconsistent logic that possesses strong negation. We use the 5-valued logic N5′5 , which is a conservative extension of GLukG, to help us to prove that N-GLukG is an extension of GLukG. N-GLukG can be used as the formalism to define the p-stable semantics as well as the stable semantics.
In the rule-based equivalent transformation (RBET) paradigm, where computation is based on meaning-preserving transformation of declarative descriptions, a set of rewriting rules is regarded as a program. The syntax f...
详细信息
We address the problem of specializing a constraint logic program w.r.t. a constrained atom which specifies the context of use of the program. We follow an approach based on transformation rules and strategies. We int...
详细信息
Cedalion is a research LOP language designed for hosting internal DSLs but with the look-and-feel of external DSLs. Cedalion demonstrates a novel approach that combines extensible logic programming with projectional e...
详细信息
ISBN:
(纸本)9781450309424
Cedalion is a research LOP language designed for hosting internal DSLs but with the look-and-feel of external DSLs. Cedalion demonstrates a novel approach that combines extensible logic programming with projectional editing. We shall demonstrate the ease of realizing a small, yet non-trivial, highly expressive DSL in Cedalion.
Procedural content generation (PCG) has the potential to create unique artifacts, levels, and gameplay mechanics. However, it remains challenging to generate content that satisfies gameplay constraints: methods to ach...
详细信息
Procedural content generation (PCG) has the potential to create unique artifacts, levels, and gameplay mechanics. However, it remains challenging to generate content that satisfies gameplay constraints: methods to achieve this include generate-and-test, search-based generation, and constructive methods. In this paper, we present a prototype, a simple game, which demonstrates the use of an off-the-shelf logic program solver, Clingo, as an easy and expressive way to model these constraint problems, and find solutions that satisfy gameplay constraints. By delegating the difficult search optimization problem to an external program, we were able to quickly prototype PCG in a low-effort way by expressing the desired content as a set of rules and constraints, keeping the focus on the designer's intentions for the generated content, rather than specific methods used to create or find it. The expressiveness and versatility of this approach is demonstrated by applying this technique to two areas of PCG in the game.
Answer-set programming (ASP) is a logic programming paradigm for declarative problem solving which gained increasing importance during the last decade. However, so far hardly any tools exist supporting software engine...
详细信息
Answer-set programming (ASP) is a logic programming paradigm for declarative problem solving which gained increasing importance during the last decade. However, so far hardly any tools exist supporting software engineers in developing answer-set programs, and there are no standard methodologies for handling unexpected outcomes of a program. Thus, writing answer-set programs is sometimes quite intricate, especially when large programs for real-world applications are required. In order to increase the usability of ASP, the development of appropriate debugging strategies is therefore vital. In this paper, we describe the system spock, a debugging support tool for answer-set programs making use of ASP itself. The implemented techniques maintain the declarative nature of ASP within the debugging process and are independent from the actual computation of answer sets.
Although the benefits of software acceleration using reconfigurable logic have been demonstrated repeatedly, this style of computing has not yet penetrated the mainstream. One of the biggest unsolved problems is the m...
详细信息
Although the benefits of software acceleration using reconfigurable logic have been demonstrated repeatedly, this style of computing has not yet penetrated the mainstream. One of the biggest unsolved problems is the management of the reconfigurable hardware in a multi-threaded environment. While most research in reconfigurable computing has assumed a single-threaded model, this is unrealistic for both personal computing and many types of embedded computing. In these cases, there may be several different threads running simultaneously. Each of these threads may have one or more sections of code (kernels) which would benefit from hardware acceleration. Somehow the operating system must decide at runtime which kernels to implement in software vs. hardware based on the status of the system. This includes potentially choosing from multiple possible hardware implementations (with different area/delay tradeoffs) of a single kernel. This paper examines our vision of reconfigurable computing applications in mainstream multithreaded systems, including a presentation of a proposed scheduling algorithm for allocating the reconfigurable hardware.
暂无评论