A compiler for the C language has recently been constructed which is now compiling C for about half a dozen machines. the compiler was influenced in various ways by recent theoretical developments. this paper gives an...
详细信息
We present a probabilistic logicprogramming framework to reinforcement learning, by integrating reinforcement learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer...
详细信息
ISBN:
(纸本)9783642239625
We present a probabilistic logicprogramming framework to reinforcement learning, by integrating reinforcement learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer set semantics, that is capable of representing domain-specific knowledge. We formally prove the correctness of our approach. We show that the complexity of finding a policy for a reinforcement learning problem in our approach is NP-complete. In addition, we show that any reinforcement learning problem can be encoded as a classical logic program with answer set semantics. We also show that a reinforcement learning problem can be encoded as a SAT problem. We present a new high level action description language that allows the factored representation of POMDP. Moreover, we modify the original model of POMDP so that it be able to distinguish between knowledge producing actions and actions that change the environment.
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...
详细信息
In this work a purpose of the ANN and Fuzzy logic for integrated logic control of disturbances in mechatronics system has been considered. the main task of this study was to investigate whether electronic logic design...
详细信息
SYNTELTMis a novel knowledge representation language that provides traditional features of expert system shells within a pure functional programming paradigm. However, it differs sharply from existing functional langu...
详细信息
In this paper we present the semantics of a functional logic language with parametric and order-sorted polymorphism. Typed programs consist of a polymorphic signature and a set of constructor-based conditional rewriti...
详细信息
In a mediator system based on annotated logics it is a suitable requirement to allow annotations from different lattices in one program on a per-predicate basis. these lattices however may be related through common su...
详细信息
ISBN:
(纸本)9783540449904
In a mediator system based on annotated logics it is a suitable requirement to allow annotations from different lattices in one program on a per-predicate basis. these lattices however may be related through common sublattices, hence demanding predicates which are able to carry combinations of annotations, or access to components of annotations. We show both demands to be satisifiable by using various composition operations on the domain of complete bounded distributive lattices or bilattices, most importantly the free distributive product. An implementation of the presented concepts, based on the KOMET implementation of SLG-AL with constraints, is briefly introduced.
this paper formalises a semantics for statements and expressions (in sequential imperative languages) which includes non-termination, normal termination and abrupt termination (e.g. because of an exception, break, ret...
详细信息
ISBN:
(纸本)3540672613
this paper formalises a semantics for statements and expressions (in sequential imperative languages) which includes non-termination, normal termination and abrupt termination (e.g. because of an exception, break, return or continue). this extends the traditional semantics underlying e.g. Hoare logic, which only distinguishes termination and non-termination. An extension of Hoare logic is elaborated that includes means for reasoning about abrupt termination (and side-effects). It prominently involves rules for reasoning about while loops, which may contain exceptions, breaks, continues and returns. this extension applies in particular to Java. As an example, a standard pattern search algorithm in Java (involving a while loop with returns) is proven correct using the proof-tool PVS.
Tomita’s algorithm [Tomita 85] which treats context free grammars makes use of the breadth-first strategy to handle conflicts occurring in a LR parsing table. Considering the compatibility of a breadth-first strategy...
详细信息
A hidden Markov model (HMM) is a statistical model in which the system being modeled is assumed to be a Markov process with hidden states. this model has been widely used in speech recognition and biological sequence ...
详细信息
A hidden Markov model (HMM) is a statistical model in which the system being modeled is assumed to be a Markov process with hidden states. this model has been widely used in speech recognition and biological sequence analysis. Viterbi algorithm has been proposed to compute the most probable value of these hidden states in regards to an observed data sequence. Constrained HMM extends this framework by adding some constraints on a HMM process run. In this paper, we propose to introduce constrained HMMs into Constraint programming. We propose new version of the Viterbi algorithm for this new framework. Several constraint techniques are used to reduce the search of the most probable value of hidden states of a constrained HMM. An implementation based on PRISM, a logicprogramming language for statistical modeling, is presented.
暂无评论