Results 1  10
of
569
Isabelle Theories for Machine Words
 In Seventh International Workshop on Automated Verification of Critical Systems (AVOCS’07
, 2007
"... Abstract. We describe a collection of Isabelle theories which facilitate reasoning about machine words. For each possible word length, the words of that length form a type, and most of our work consists of generic theorems which can be applied to any such type. We develop the relationships between t ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
Abstract. We describe a collection of Isabelle theories which facilitate reasoning about machine words. For each possible word length, the words of that length form a type, and most of our work consists of generic theorems which can be applied to any such type. We develop the relationships between
Reinforcement learning: a survey
 Journal of Artificial Intelligence Research
, 1996
"... This paper surveys the field of reinforcement learning from a computerscience perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning is the problem ..."
Abstract

Cited by 1714 (25 self)
 Add to MetaCart
This paper surveys the field of reinforcement learning from a computerscience perspective. It is written to be accessible to researchers familiar with machine learning. Both the historical basis of the field and a broad selection of current work are summarized. Reinforcement learning
Machine Words in Isabelle/HOL
, 2011
"... A formalisation of generic, fixed size machine words in Isabelle/HOL. An earlier version of this formalisation is described in [1]. ..."
Abstract
 Add to MetaCart
A formalisation of generic, fixed size machine words in Isabelle/HOL. An earlier version of this formalisation is described in [1].
Mechanising Turing Machines and Computability Theory in Isabelle/HOL
 In Interactive Theorem Proving  4th International Conference, ITP 2013
"... Abstract. We formalise results from computability theory in the theorem prover Isabelle/HOL. Following the textbook by Boolos et al, we formalise Turing machines and relate them to abacus machines and recursive functions. We “tie the knot ” between these three computational models by formalising a ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. We formalise results from computability theory in the theorem prover Isabelle/HOL. Following the textbook by Boolos et al, we formalise Turing machines and relate them to abacus machines and recursive functions. We “tie the knot ” between these three computational models by formalising a
Isabelle/Isar  a versatile environment for humanreadable formal proof documents
, 2002
"... The basic motivation of this work is to make formal theory developments with machinechecked proofs accessible to a broader audience. Our particular approach is centered around the Isar formal proof language that is intended to support adequate composition of proof documents that are suitable for hu ..."
Abstract

Cited by 83 (12 self)
 Add to MetaCart
The basic motivation of this work is to make formal theory developments with machinechecked proofs accessible to a broader audience. Our particular approach is centered around the Isar formal proof language that is intended to support adequate composition of proof documents that are suitable
Two decades of statistical language modeling: Where do we go from here
 Proceedings of the IEEE
, 2000
"... Statistical Language Models estimate the distribution of various natural language phenomena for the purpose of speech recognition and other language technologies. Since the first significant model was proposed in 1980, many attempts have been made to improve the state of the art. We review them here ..."
Abstract

Cited by 210 (1 self)
 Add to MetaCart
here, point to a few promising directions, and argue for a Bayesian approach to integration of linguistic theories with data. 1. OUTLINE Statistical language modeling (SLM) is the attempt to capture regularities of natural language for the purpose of improving the performance of various natural
From Computing With Numbers To Computing With Words From Manipulation Of Measurements To Manipulation of Perceptions
 Appl. Math. Comput. Sci
"... Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositions drawn from a natural language, e.g., small, large, far, heavy, not very likely, the p ..."
Abstract

Cited by 150 (5 self)
 Add to MetaCart
for a computational theory of perceptions – a theory which may have an important bearing on how humans make – and machines might make – perceptionbased rational decisions in an environment of imprecision, uncertainty and partial truth. A basic difference between perceptions and measurements is that
1970), “General semantics
 Synthese
"... We outline a vision for computational semantics in which formal compositional semantics is combined with a powerful, structured lexical semantics derived from distributional statistics. We consider how existing work (Lewis and Steedman, 2013) could be extended with a much richer lexical semantics u ..."
Abstract

Cited by 191 (0 self)
 Add to MetaCart
such as is visiting→has arrived in but will leave, which requires interpreting both the function and content words. This will allow machine reading systems to understand not just what has happened, but when.
A MetaModel for the Isabelle API
, 2015
"... We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise is to write packages for domainspecific specifications such as class models, Bmachines,..., and generally any languages that can be described with a sequence of “datatype ” in HOL itself; the Isabel ..."
Abstract
 Add to MetaCart
We represent a theory of (a fragment of) Isabelle/HOL in Isabelle/HOL. The purpose of this exercise is to write packages for domainspecific specifications such as class models, Bmachines,..., and generally any languages that can be described with a sequence of “datatype ” in HOL itself
Type Inference Verified: Algorithm W in Isabelle/HOL
, 1997
"... This paper presents the first machinechecked verification of Milner's type inference algorithm W for computing the most general type of an untyped term enriched with letexpressions. This term language is the core of most typed functional programming languages and is also known as MiniML ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
ML. We show how to model all the concepts involved, in particular types and type schemes, substitutions, and the thorny issue of "new" variables. Only a few key proofs are discussed in detail. The theories and proofs are developed in Isabelle/HOL, the HOL instantiation of the generic
Results 1  10
of
569