the proceedings contain 12 papers. the special focus in this conference is on Computer Games. the topics include: Challenges and progress on using large lossy endgame databases in Chinese checkers;sequential halving f...
ISBN:
(纸本)9783319394015
the proceedings contain 12 papers. the special focus in this conference is on Computer Games. the topics include: Challenges and progress on using large lossy endgame databases in Chinese checkers;sequential halving for partially observable games;an experimental investigation on the pancake problem;a new upper bound for morpion solitaire;multi-agent retrograde analysis;the Surakarta bot revealed;learning to trade in strategic board games;argumentative AI director using defeasible logicprogramming;on the cross-domain reusability of neural modules for general video game playing;learning board game rules with piece-move interactions;creating action heuristics for general game playing agents and space-consistent game equivalence detection in general game playing.
A lot of Prologs applied fuzzy theory, so called Fuzzy Prolog, have been studied since Zadeh has proposed fuzzy theory. Although various approaches of Fuzzy Prolog were proposed until now, there was no common interpre...
详细信息
ISBN:
(纸本)0780324625
A lot of Prologs applied fuzzy theory, so called Fuzzy Prolog, have been studied since Zadeh has proposed fuzzy theory. Although various approaches of Fuzzy Prolog were proposed until now, there was no common interpretation for fuzzifying Prolog. In [8], from the user's side we considered what Fuzzy Prolog have to be able to do and proposed some approaches for fuzzifying Prolog which satisfy user's postulates. LbFP is Fuzzy Prolog which is based on these proposals and adopts Lukasiewicz's for implication operation and bounded product for combination operation. In this paper, at first we introduce what Fuzzy Prolog have to be able to do by using some examples. Next we explain some definitions and theorems for fuzzy logicprogramming which adopts Lukasiewicz's for implication operation and bounded product for combination operation. Finally, we show the implementation of LbFP.
this paper presents a language and its system called Heuristic Prolog. the language is an extension of the Edinburgh version Prolog for execution of logic programs by heuristic (best-first) search in addition to depth...
详细信息
Relay Ladder logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. the cost of bugs in RLL programs is extremely high, often me...
详细信息
ISBN:
(纸本)3540643567
Relay Ladder logic (RLL) [4] is a programming language widely used for complex embedded control applications such as manufacturing and amusement park rides. the cost of bugs in RLL programs is extremely high, often measured in millions of dollars (for shutting down a factory) or human safety (for rides). In this paper, we describe our experience in applying constraint-based program analysis techniques to analyze production RLL programs. Our approach is an interesting combination of probabilistic testing and program analysis, and we show that our system is able to detect bugs with high probability, up to the approximations made by the conservative program analysis. We demonstrate that our analysis is useful in detecting some flaws in production RLL programs that are difficult to find by other techniques.
the proceedings contain 32 papers. the topics discussed include: received signal strength for randomly distributed molecular nanonodes;event and node identification from a single-pulse transmission in self-powered nan...
ISBN:
(纸本)9781450349314
the proceedings contain 32 papers. the topics discussed include: received signal strength for randomly distributed molecular nanonodes;event and node identification from a single-pulse transmission in self-powered nanosensor networks;chemical reaction networks for maximum likelihood estimation of the concentration of signalling molecules;ratiometric logic in living cells via competitive binding of synthetic transcription factors;design principles of data converters for building large-scale gene networks in living cells;achieving in-phase synchronization in a diffusion-based nanonetwork with unknown propagation delay;increase detection algorithm for concentration-encoded diffusion-based molecular communication;simulation analysis of inter-symbol interference in diffusion-based molecular communication with non-absorbing receiver;a programming framework for neuromorphic systems with emerging technologies;brain-inspired computing accelerated by memristor technology;towards spiking neuromorphic system-on-a-chip with bio-plausible synapses using emerging devices;molecular communication with dna cellular storage system;prospects for the application of 2-dimensional materials to terahertz-band communications;and a folded wireless network-on-chip using graphene based thz-band antennas.
A screen oriented programming environment for Prolog was designed and implemented. To visualize the control flow of the execution of a Prolog program, A new execution model is proposed, which is based on the box model...
详细信息
the Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. the system includes two modules: (i) smodels which implements the two seman...
详细信息
ISBN:
(纸本)3540632557
the Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. the system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range-restricted function-free normal program. the latter module does not produce the whole set of ground instances of the program but a subset that is sufficient in the sense that no stable models ate lost. the implementation of the stable model semantics for ground programs is based on bottom-up backtracking search where a powerful pruning method is employed. the pruning method exploits an approximation technique for stable models which is closely related to the well-founded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. this makes it possible to apply the stable model semantics also in areas where resulting programs are highly non-stratified and can possess a large number of stable models. the implementation has been tested extensively and compared with a state of the art implementation of the stable model semantics, the SLG system. In tests involving ground programs it clearly outperforms SLG.
A new type of communication between concurrent processes called ‘subjects’ and a synchronization mechanism are presented. Since the communication is carried out only based on reading the internal states of a subject...
详细信息
A Paper suggests automated control program synthesis for typical boiler-house of small to medium power. Due to typical boiler-house architecture even part of control algorithms for the equipment or overall program str...
详细信息
ISBN:
(纸本)9781634397988
A Paper suggests automated control program synthesis for typical boiler-house of small to medium power. Due to typical boiler-house architecture even part of control algorithms for the equipment or overall program structure can be ready made. this paper presents the way to build those control algorithms and automated generation of the control program for programmable logic controller. Process signal coding, special PLC templates and meta-program for the boiler-house control program is also presented.
We provide motivation for composition-nominative approach and its main underlying principles. We give a brief introduction to the hierarchy of composition-nominative logics (CNL) and discuss possible applications of t...
详细信息
ISBN:
(纸本)9783642383700;9783642383694
We provide motivation for composition-nominative approach and its main underlying principles. We give a brief introduction to the hierarchy of composition-nominative logics (CNL) and discuss possible applications of these logics in formal approaches for software development. CNL are algebra-based logics of partial predicates and functions. they are constructed in a semantic-syntactic style on the methodological basis, which is common withprogramming. Main attention in the paper is paid to the first-order CNL. the satisfiability problem for the first-order CNL is addressed. We show the reduction of the problem in hand to the satisfiability problem for classical first-order logic with function symbols. the reduction proposed requires extension of logic language and logic models with an infinite number of unessential variables. the method presented in the paper enables one to use existent satisfiability checking algorithms and tools for solving instances of the CNL satisfiability problem. thus, many standard techniques developed for classical logics can be applied in CNL-based approaches for program reasoning.
暂无评论