Results 1  10
of
33
Lexicographic Closure for Defeasible Description Logics
"... Abstract. In the field of nonmonotonic logics, the lexicographic closure is acknowledged as a a powerful and logically wellcharacterized approach; we are going to see that such a construction can be applied in the field of Description Logics, an important knowledge representation formalism, and we ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. In the field of nonmonotonic logics, the lexicographic closure is acknowledged as a a powerful and logically wellcharacterized approach; we are going to see that such a construction can be applied in the field of Description Logics, an important knowledge representation formalism
The Lexicographic Closure as a Revision Process
"... The connections between nonmonotonic reasoning and belief revision are wellknown. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing "if # is true then, normally, # is true" be said to ..."
Abstract
 Add to MetaCart
the lexicographic closure of a set of defaults may be conceptualised as a process of iterated revision by sets of sentences. Specifically we use the revision method of Nayak.
On closures of lexicographic starfree languages
, 2005
"... Abstract. Muscholl and Petersen showed that, in the case of transitive dependencies, closures of starfree lexicographic languages are starfree or nonregular. It implies that, in the same case of transitive dependencies, closures of starfree lexicographic languages are starfree. In this paper, i ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Muscholl and Petersen showed that, in the case of transitive dependencies, closures of starfree lexicographic languages are starfree or nonregular. It implies that, in the same case of transitive dependencies, closures of starfree lexicographic languages are starfree. In this paper
Another perspective on Default Reasoning
 Ann. Math. Artif. Intell
, 1992
"... The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
The lexicographic closure of any given finite set D of normal defaults is defined. A conditional assertion a b is in this lexicographic closure if, given the defaults D and the fact a, one would conclude b. The lexicographic closure is essentially a rational extension of D, and of its rational
On the recursive decomposition ordering with lexicographical status and other related orderings
 Journal of Automated Reasoning
, 1990
"... This paper studies three orderings, useful in theorem proving, especially for proving termination of term rewriting systems: the recursive decomposition ordering with status, the recursive path ordering with status and the closure ordering. It proves the transitivity of the recursive path ordering ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
This paper studies three orderings, useful in theorem proving, especially for proving termination of term rewriting systems: the recursive decomposition ordering with status, the recursive path ordering with status and the closure ordering. It proves the transitivity of the recursive path
An Experimental Analysis of Possibilistic Default Reasoning
 KR 2004
, 2004
"... This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specificity inference (MSP), lexicographical closure (LC), and epsilonbelief functions (LCD). The latter was initially proposed w ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This article provides an experimental analysis of the possibilistic handling of default rules. Three different nonmonotonic consequence relations are considered: minimum specificity inference (MSP), lexicographical closure (LC), and epsilonbelief functions (LCD). The latter was initially proposed
A Hierarchy of Automatic Words having a Decidable MSO Theory
, 2006
"... We investigate automatic presentations of infinite words. Starting points of our study are the works of Rigo and Maes, and Carton and Thomas concerning the lexicographic presentation, respectively the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexi ..."
Abstract
 Add to MetaCart
that these are intertranslatable, thus giving rise to the same classes of klexicographic or level k morphic words. We prove that these presentations are also canonical, which implies decidability of the MSO theory of every klexicographic word as well as closure of these classes under restricted MSO interpretations
A HIERARCHY OF AUTOMATIC ωWORDS HAVING A DECIDABLE MSO THEORY
, 2008
"... We investigate automatic presentations of ωwords. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSOinterpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniq ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
, and morphisms of level k stacks and show that these are intertranslatable, thus giving rise to the same classes of klexicographic or level k morphic words. We prove that these presentations are also canonical, which implies decidability of the MSO theory of every klexicographic word as well as closure
Betashift Dynamical Systems and Their Associated Languages
, 1999
"... Given > 1, an expansion of x 2 [0; 1) base is the encoding of the transformation T (x) = x (mod 1) into the space f0; : : : ; [ ]g where [ ] is the integer part of . The betashift is the closure of the set of betaexpansions of points in [0; 1). There is also a lexicographic descript ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Given > 1, an expansion of x 2 [0; 1) base is the encoding of the transformation T (x) = x (mod 1) into the space f0; : : : ; [ ]g where [ ] is the integer part of . The betashift is the closure of the set of betaexpansions of points in [0; 1). There is also a lexicographic
Results 1  10
of
33