Universidad de Chile

Displaying 1-14 of 14 results

  • White Papers // May 2011

    Modeling the Web of Data

    The view of a universal space of information as the (infinite) generalization of a library is an extremely useful one. It includes almost all facets the authors would like to incorporate when abstracting and modeling such an artifact. There is one crucial slant, though: the library is composed of books,...

    Provided By Universidad de Chile

  • White Papers // Apr 2011

    SNQL: A Social Networks Query and Transformation Language

    Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent transform and query such data. In addition to the intrinsic challenges of querying graph data is the requirement that networks be restructured, and thus that new values be created. To address these, the authors introduce a...

    Provided By Universidad de Chile

  • White Papers // Mar 2011

    Updating RDFS: From Theory to Practice

    There is a comprehensive body of theory studying updates and schema evolution of knowledge bases, ontologies, and in particular of RDFS. In this paper the authors turn these ideas into practice by presenting a feasible and practical procedure for updating RDFS. Along the lines of ontology evolution, they treat schema...

    Provided By Universidad de Chile

  • White Papers // Mar 2011

    Subqueries in SPARQL

    Subqueries are a powerful feature which allows enforcing reuse, composition, rewriting and optimization in a query language. In this paper the authors perform a comprehensive study of the incorporation of subqueries into SPARQL. They consider the many possible choices as suggested by the experience of similar languages, as well as...

    Provided By Universidad de Chile

  • White Papers // Feb 2011

    Revisiting the Rice Theorem of Cellular Automata

    A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton...

    Provided By Universidad de Chile

  • White Papers // Sep 2010

    Communication Complexity and Intrinsic Universality in Cellular Automata

    The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this paper authors introduce necessary conditions for a cellular automaton to be "Universal", according to a precise notion of...

    Provided By Universidad de Chile

  • White Papers // Sep 2010

    Compact Representation of Large RDF Data Sets for Publishing and Exchange

    Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisible structure. All this leads to fuzzy publications, inefficient management, complex processing and lack of scalability. This paper presents a novel RDF representation...

    Provided By Universidad de Chile

  • White Papers // Jun 2010

    nSPARQL: A Navigational Language for RDF

    Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, the authors propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. They study some of...

    Provided By Universidad de Chile

  • White Papers // Dec 2009

    Informal Jobs And Contribution To Social Security: Evidence From A Double Selection Model

    The authors estimate a double selection model to study informality in the Chilean labor market. They use three different measures of informality: lack of a signed contract, contribution to social security and both at the same time. The double selection states that, in a first stage, individuals chose between the...

    Provided By Universidad de Chile

  • White Papers // Jun 2009

    On the Semantics of SPARQL

    The Resource Description Framework (RDF) is the standard data model for representing information about World Wide Web resources. Jointly with its release as Recommendation of the W3C, the natural problem of querying RDF data was raised. In the last years, the language SPARQL has become the standard query language for...

    Provided By Universidad de Chile

  • White Papers // Jun 2009

    Foundations of Semantic Web Databases

    The Semantic Web is based in the idea of a common and minimal language to enable large quantities of existing data to be analyzed and processed. This triggers the need to develop the database foundations of this basic language, which is the Resource Description Framework (RDF). This paper addresses this...

    Provided By Universidad de Chile

  • White Papers // May 2009

    Simple and Efficient Minimal RDFS

    The original RDFS language design includes several features that hinder the task of developers and theoreticians. This paper has two main contributions in the direction of simplifying the language. First, it introduces a small fragment which, preserving the normative semantics and the core functionalities, avoids the complexities of the original...

    Provided By Universidad de Chile

  • White Papers // Apr 2009

    Foundations of RDF Databases

    The goal of this paper is to give an overview of the basics of the theory of RDF databases. The authors provide a formal definition of RDF that includes the features that distinguish this model from other graph data models. They then move into the fundamental issue of querying RDF...

    Provided By Universidad de Chile

  • White Papers // Sep 2008

    Economic Performance, Creditor Protection And Labor Inflexibility

    The authors present a static general equilibrium model of an economy with agents with heterogeneous wealth and endogenous credit constraints created by partial loan recovery rates. Higher loan recovery rates and better bankruptcy protection increase output and credit penetration, while the former raises the average interest rate spread and the...

    Provided By Universidad de Chile

  • White Papers // Sep 2010

    Compact Representation of Large RDF Data Sets for Publishing and Exchange

    Increasingly huge RDF data sets are being published on the Web. Currently, they use different syntaxes of RDF, contain high levels of redundancy and have a plain indivisible structure. All this leads to fuzzy publications, inefficient management, complex processing and lack of scalability. This paper presents a novel RDF representation...

    Provided By Universidad de Chile

  • White Papers // Jun 2009

    On the Semantics of SPARQL

    The Resource Description Framework (RDF) is the standard data model for representing information about World Wide Web resources. Jointly with its release as Recommendation of the W3C, the natural problem of querying RDF data was raised. In the last years, the language SPARQL has become the standard query language for...

    Provided By Universidad de Chile

  • White Papers // Jun 2010

    nSPARQL: A Navigational Language for RDF

    Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, the authors propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. They study some of...

    Provided By Universidad de Chile

  • White Papers // May 2009

    Simple and Efficient Minimal RDFS

    The original RDFS language design includes several features that hinder the task of developers and theoreticians. This paper has two main contributions in the direction of simplifying the language. First, it introduces a small fragment which, preserving the normative semantics and the core functionalities, avoids the complexities of the original...

    Provided By Universidad de Chile

  • White Papers // Apr 2009

    Foundations of RDF Databases

    The goal of this paper is to give an overview of the basics of the theory of RDF databases. The authors provide a formal definition of RDF that includes the features that distinguish this model from other graph data models. They then move into the fundamental issue of querying RDF...

    Provided By Universidad de Chile

  • White Papers // May 2011

    Modeling the Web of Data

    The view of a universal space of information as the (infinite) generalization of a library is an extremely useful one. It includes almost all facets the authors would like to incorporate when abstracting and modeling such an artifact. There is one crucial slant, though: the library is composed of books,...

    Provided By Universidad de Chile

  • White Papers // Apr 2011

    SNQL: A Social Networks Query and Transformation Language

    Social Network (SN) data has become ubiquitous, demanding advanced and flexible means to represent transform and query such data. In addition to the intrinsic challenges of querying graph data is the requirement that networks be restructured, and thus that new values be created. To address these, the authors introduce a...

    Provided By Universidad de Chile

  • White Papers // Jun 2009

    Foundations of Semantic Web Databases

    The Semantic Web is based in the idea of a common and minimal language to enable large quantities of existing data to be analyzed and processed. This triggers the need to develop the database foundations of this basic language, which is the Resource Description Framework (RDF). This paper addresses this...

    Provided By Universidad de Chile

  • White Papers // Dec 2009

    Informal Jobs And Contribution To Social Security: Evidence From A Double Selection Model

    The authors estimate a double selection model to study informality in the Chilean labor market. They use three different measures of informality: lack of a signed contract, contribution to social security and both at the same time. The double selection states that, in a first stage, individuals chose between the...

    Provided By Universidad de Chile

  • White Papers // Sep 2008

    Economic Performance, Creditor Protection And Labor Inflexibility

    The authors present a static general equilibrium model of an economy with agents with heterogeneous wealth and endogenous credit constraints created by partial loan recovery rates. Higher loan recovery rates and better bankruptcy protection increase output and credit penetration, while the former raises the average interest rate spread and the...

    Provided By Universidad de Chile

  • White Papers // Feb 2011

    Revisiting the Rice Theorem of Cellular Automata

    A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton...

    Provided By Universidad de Chile

  • White Papers // Sep 2010

    Communication Complexity and Intrinsic Universality in Cellular Automata

    The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this paper authors introduce necessary conditions for a cellular automaton to be "Universal", according to a precise notion of...

    Provided By Universidad de Chile

  • White Papers // Mar 2011

    Updating RDFS: From Theory to Practice

    There is a comprehensive body of theory studying updates and schema evolution of knowledge bases, ontologies, and in particular of RDFS. In this paper the authors turn these ideas into practice by presenting a feasible and practical procedure for updating RDFS. Along the lines of ontology evolution, they treat schema...

    Provided By Universidad de Chile

  • White Papers // Mar 2011

    Subqueries in SPARQL

    Subqueries are a powerful feature which allows enforcing reuse, composition, rewriting and optimization in a query language. In this paper the authors perform a comprehensive study of the incorporation of subqueries into SPARQL. They consider the many possible choices as suggested by the experience of similar languages, as well as...

    Provided By Universidad de Chile