The main construction in this paper is an encoding of default logic into an “only knowing” logic ... more The main construction in this paper is an encoding of default logic into an “only knowing” logic with degrees of confidence. By imposing simple and natural constraints on the encoding we show that the “only knowing” logic can accommodate ordered default theories and that the constrained encoding implements a prescriptive interpretation of preference between defaults. An advantage of the encoding is that it provides a transparent formal rendition of such a semantics. A feature of the construction is that the generation of extensions can be carried out within the “only knowing” logic, using object level concepts alone.
Moore's seminal paper (9) can be taken as the starting point of Algorithmic Learning Theory. ... more Moore's seminal paper (9) can be taken as the starting point of Algorithmic Learning Theory. Moore studied the problem of unraveling the inner structure of a (minimum state) deterministic finite automaton (DFA) from its input-output behaviour. In this note we pursue Moore's line of research, studying conditions under which it is possible to compute a grammar and/or an automaton for a given language L from a language class C. It doesn't come as a surprise that such conditions must be quite strong. We improve on the algorithms in some cases where computing the grammar/automaton is possible. We correct some mistakes in the literature and come up with some new results, positive and negative, for (subclasses of) context-free languages.
A new logic of belief (in the “Only knowing” family) with confidence levels is presented. The log... more A new logic of belief (in the “Only knowing” family) with confidence levels is presented. The logic allows a natural distinction between explicit and implicit belief representations, where the explicit form directly expresses its models. The explicit form can be found by applying a set of equivalence preserving rewriting rules to the implicit form. The rewriting process is performed entirely
We show that the even linear languages are characterised by a certain extension of the signature ... more We show that the even linear languages are characterised by a certain extension of the signature of the monadic second-order logic used by Büchi (1960) and Elgot (1961) to characterise the regular languages.
The main construction in this paper is an encoding of default logic into an “only knowing” logic ... more The main construction in this paper is an encoding of default logic into an “only knowing” logic with degrees of confidence. By imposing simple and natural constraints on the encoding we show that the “only knowing” logic can accommodate ordered default theories and that the constrained encoding implements a prescriptive interpretation of preference between defaults. An advantage of the encoding is that it provides a transparent formal rendition of such a semantics. A feature of the construction is that the generation of extensions can be carried out within the “only knowing” logic, using object level concepts alone.
Moore's seminal paper (9) can be taken as the starting point of Algorithmic Learning Theory. ... more Moore's seminal paper (9) can be taken as the starting point of Algorithmic Learning Theory. Moore studied the problem of unraveling the inner structure of a (minimum state) deterministic finite automaton (DFA) from its input-output behaviour. In this note we pursue Moore's line of research, studying conditions under which it is possible to compute a grammar and/or an automaton for a given language L from a language class C. It doesn't come as a surprise that such conditions must be quite strong. We improve on the algorithms in some cases where computing the grammar/automaton is possible. We correct some mistakes in the literature and come up with some new results, positive and negative, for (subclasses of) context-free languages.
A new logic of belief (in the “Only knowing” family) with confidence levels is presented. The log... more A new logic of belief (in the “Only knowing” family) with confidence levels is presented. The logic allows a natural distinction between explicit and implicit belief representations, where the explicit form directly expresses its models. The explicit form can be found by applying a set of equivalence preserving rewriting rules to the implicit form. The rewriting process is performed entirely
We show that the even linear languages are characterised by a certain extension of the signature ... more We show that the even linear languages are characterised by a certain extension of the signature of the monadic second-order logic used by Büchi (1960) and Elgot (1961) to characterise the regular languages.
Uploads
Papers by Tore Langholm