Results 1  10
of
55,614
DEGREE SPECTRA OF UNARY RELATIONS ON 〈ω, ≤〉
"... Abstract. A computable presentation of the linearly ordered set (ω, ≤), where ω is the set of natural numbers and ≤ is the natural order on ω, is any linearly ordered set L = (ω, ≤L) isomorphic to (ω, ≤) such that ≤L is a computable relation. Let X be subset of ω and XL be the image of X in the line ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. A computable presentation of the linearly ordered set (ω, ≤), where ω is the set of natural numbers and ≤ is the natural order on ω, is any linearly ordered set L = (ω, ≤L) isomorphic to (ω, ≤) such that ≤L is a computable relation. Let X be subset of ω and XL be the image of X
Fixed Point vs.FirstOrder Logic on Finite Ordered Structures with Unary Relations
, 1993
"... We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a firstorder formula, even when every inductive sentence ..."
Abstract
 Add to MetaCart
We prove that first order logic is strictly weaker than fixed point logic over every infinite classes of finite ordered structures with unary relations: Over these classes there is always an inductive unary relation which cannot be defined by a firstorder formula, even when every inductive
Automatic Named Entity Set Expansion Using Semantic Rules And Wrappers For Unary Relations
"... AbstractNamed Entity Set Expansion is the task from a set given a small number of named entities in same type finds a more complete Named Entity set. Two famous Named Entity expansion systems using the web are Google Sets1 and Boo!Wa!2. In this paper, we proposed an approach using Vietnamese semant ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
semantic rule combined with wrappers for unary relations to expand a given set of Vietnamese Named Entities. Our model using the results which are provided by Google search engine in Vietnam, consists of six main phases. We did the experiments for many times to choose the rank method that gave the best
Relational Databases for Querying XML Documents: Limitations and Opportunities
, 1999
"... XML is fast emerging as the dominant standard for representing data in the World Wide Web. Sophisticated query engines that allow users to effectively tap the data stored in XML documents will be crucial to exploiting the full power of XML. While there has been a great deal of activity recently prop ..."
Abstract

Cited by 490 (9 self)
 Add to MetaCart
proposing new semistructured data models and query languages for this purpose, this paper explores the more conservative approach of using traditional relational database engines for processing XML documents conforming to Document Type Descriptors (DTDs). To this end, we have developed algorithms
The fundamental properties of natural numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1.h ..."
Abstract

Cited by 682 (76 self)
 Add to MetaCart
Summary. Some fundamental properties of addition, multiplication, order relations, exact division, the remainder, divisibility, the least common multiple, the greatest common divisor are presented. A proof of Euclid algorithm is also given. MML Identifier:NAT_1. WWW:http://mizar.org/JFM/Vol1/nat_1
A translation approach to portable ontology specifications
 KNOWLEDGE ACQUISITION
, 1993
"... To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations, functions ..."
Abstract

Cited by 3282 (9 self)
 Add to MetaCart
To support the sharing and reuse of formally represented knowledge among AI systems, it is useful to define the common vocabulary in which shared knowledge is represented. A specification of a representational vocabulary for a shared domain of discourse — definitions of classes, relations
The ordinal numbers
 Journal of Formalized Mathematics
, 1989
"... Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem and oth ..."
Abstract

Cited by 722 (70 self)
 Add to MetaCart
Summary. We present the choice function rule in the beginning of the article. In the main part of the article we formalize the base of cardinal theory. In the first section we introduce the concept of cardinal numbers and order relations between them. We present here CantorBernstein theorem
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
, 1990
"... Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always been described only negatively, by the property it does not enjoy, i.e. monotonicity. We study here general patterns of ..."
Abstract

Cited by 624 (14 self)
 Add to MetaCart
of nonmonotonic reasoning and try to isolate properties that could help us map the field of nonmonotonic reasoning by reference to positive properties. We concentrate on a number of families of nonmonotonic consequence relations, defined in the style of Gentzen [13]. Both prooftheoretic and semantic points
Globally Consistent Range Scan Alignment for Environment Mapping
 AUTONOMOUS ROBOTS
, 1997
"... A robot exploring an unknown environmentmay need to build a world model from sensor measurements. In order to integrate all the frames of sensor data, it is essential to align the data properly. An incremental approach has been typically used in the past, in which each local frame of data is alig ..."
Abstract

Cited by 536 (8 self)
 Add to MetaCart
frames of measurements (range scans), together with the related issues of representation and manipulation of spatial uncertainties. Our approachistomaintain all the local frames of data as well as the relative spatial relationships between local frames. These spatial relationships are modeled
Models and issues in data stream systems
 IN PODS
, 2002
"... In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, timevarying data streams. In addition to reviewing past work releva ..."
Abstract

Cited by 770 (19 self)
 Add to MetaCart
In this overview paper we motivate the need for and research issues arising from a new model of data processing. In this model, data does not take the form of persistent relations, but rather arrives in multiple, continuous, rapid, timevarying data streams. In addition to reviewing past work
Results 1  10
of
55,614