The Experts below are selected from a list of 22143 Experts worldwide ranked by ideXlab platform
Jason Hickey - One of the best experts on this subject based on the ideXlab platform.
-
TPHOLs - Sequent Schema for Derived Rules
Lecture Notes in Computer Science, 2002Co-Authors: Aleksey Nogin, Jason HickeyAbstract:This paper presents a general sequent Schema Language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent Schema Language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent Schema Language and with any new rules found using this mechanism is conservative.By using the sequent Schema Language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent Schema Language can be efficiently implemented using MetaPRL's fast rewriting engine.
-
Sequent Schema for derived rules
Lecture Notes in Computer Science, 2002Co-Authors: Aleksey Nogin, Jason HickeyAbstract:This paper presents a general sequent Schema Language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent Schema Language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent Schema Language and with any new rules found using this mechanism is conservative. By using the sequent Schema Language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent Schema Language can be efficiently implemented using MetaPRL's fast rewriting engine.
Carlo Sartiani - One of the best experts on this subject based on the ideXlab platform.
-
Schemas and Types for JSON Data: From Theory to Practice
2019Co-Authors: Mohamed-amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo SartianiAbstract:The last few years have seen the fast and ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures like records and arrays. The user willing to effectively manage JSON data collections can rely on several Schema Languages, like JSON Schema, JSound, and Joi, as well as on the type abstractions offered by modern programming and scripting Languages like Swift or TypeScript. The main aim of this tutorial is to provide the audience (both researchers and practitioners) with the basic notions for enjoying all the benefits that Schema and types can offer while processing and manipulating JSON data. This tutorial focuses on four main aspects of the relation between JSON and Schemas: (1) we survey existing Schema Language proposals and discuss their prominent features; (2) we analyze tools that can infer Schemas from data, or that exploit Schema information for improving data parsing and management; and (3) we discuss some open research challenges and opportunities related to JSON data.
-
SIGMOD Conference - Schemas and Types for JSON Data: From Theory to Practice
Proceedings of the 2019 International Conference on Management of Data, 2019Co-Authors: Mohamed-amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo SartianiAbstract:The last few years have seen the fast and ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures like records and arrays. The user willing to effectively manage JSON data collections can rely on several Schema Languages, like JSON Schema, JSound, and Joi, as well as on the type abstractions offered by modern programming and scripting Languages like Swift or TypeScript. The main aim of this tutorial is to provide the audience (both researchers and practitioners) with the basic notions for enjoying all the benefits that Schema and types can offer while processing and manipulating JSON data. This tutorial focuses on four main aspects of the relation between JSON and Schemas: (1) we survey existing Schema Language proposals and discuss their prominent features; (2) we analyze tools that can infer Schemas from data, or that exploit Schema information for improving data parsing and management; and (3) we discuss some open research challenges and opportunities related to JSON data.
-
DBPL - Typing regular path query Languages for data graphs
Proceedings of the 15th Symposium on Database Programming Languages, 2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially untyped. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
-
Typing regular path query Languages for data graphs
2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially untyped. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
-
Typing Regular Path Query Languages for Data Graphs
arXiv: Databases, 2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially \emph{untyped}. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
Aleksey Nogin - One of the best experts on this subject based on the ideXlab platform.
-
TPHOLs - Sequent Schema for Derived Rules
Lecture Notes in Computer Science, 2002Co-Authors: Aleksey Nogin, Jason HickeyAbstract:This paper presents a general sequent Schema Language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent Schema Language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent Schema Language and with any new rules found using this mechanism is conservative.By using the sequent Schema Language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent Schema Language can be efficiently implemented using MetaPRL's fast rewriting engine.
-
Sequent Schema for derived rules
Lecture Notes in Computer Science, 2002Co-Authors: Aleksey Nogin, Jason HickeyAbstract:This paper presents a general sequent Schema Language that can be used for specifying sequent-style rules for a logical theory. We show how by adding the sequent Schema Language to a theory we gain an ability to prove new inference rules within the theory itself. We show that the extension of any such theory with our sequent Schema Language and with any new rules found using this mechanism is conservative. By using the sequent Schema Language in a theorem prover, one gets an ability to allow users to derive new rules and then use such derived rules as if they were primitive axioms. The conservativity result guarantees the validity of this approach. This property makes it a convenient tool for implementing a derived rules mechanism in theorem provers, especially considering that the application of the rules expressed in the sequent Schema Language can be efficiently implemented using MetaPRL's fast rewriting engine.
Donatella Gubiani - One of the best experts on this subject based on the ideXlab platform.
-
modeling and validating spatio temporal conceptual Schemas in xml Schema
Database and Expert Systems Applications, 2007Co-Authors: Massimo Franceschet, Angelo Montanari, Donatella GubianiAbstract:In this paper, we describe a translation algorithm that maps spatio-temporal conceptual Schemas into XML Schemas expressed in the W3C XML Schema Language. Moreover, we extend the standard XML Schema validator with a Java library to check spatio-temporal constraints. The resulting framework allows one to validate XML documents containing spatio-temporal information with respect to spatio-temporal conceptual Schemas.
-
DEXA Workshops - Modeling and Validating Spatio-Temporal Conceptual Schemas in XML Schema
18th International Conference on Database and Expert Systems Applications (DEXA 2007), 2007Co-Authors: Massimo Franceschet, Angelo Montanari, Donatella GubianiAbstract:In this paper, we describe a translation algorithm that maps spatio-temporal conceptual Schemas into XML Schemas expressed in the W3C XML Schema Language. Moreover, we extend the standard XML Schema validator with a Java library to check spatio-temporal constraints. The resulting framework allows one to validate XML documents containing spatio-temporal information with respect to spatio-temporal conceptual Schemas.
Dario Colazzo - One of the best experts on this subject based on the ideXlab platform.
-
Schemas and Types for JSON Data: From Theory to Practice
2019Co-Authors: Mohamed-amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo SartianiAbstract:The last few years have seen the fast and ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures like records and arrays. The user willing to effectively manage JSON data collections can rely on several Schema Languages, like JSON Schema, JSound, and Joi, as well as on the type abstractions offered by modern programming and scripting Languages like Swift or TypeScript. The main aim of this tutorial is to provide the audience (both researchers and practitioners) with the basic notions for enjoying all the benefits that Schema and types can offer while processing and manipulating JSON data. This tutorial focuses on four main aspects of the relation between JSON and Schemas: (1) we survey existing Schema Language proposals and discuss their prominent features; (2) we analyze tools that can infer Schemas from data, or that exploit Schema information for improving data parsing and management; and (3) we discuss some open research challenges and opportunities related to JSON data.
-
SIGMOD Conference - Schemas and Types for JSON Data: From Theory to Practice
Proceedings of the 2019 International Conference on Management of Data, 2019Co-Authors: Mohamed-amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo SartianiAbstract:The last few years have seen the fast and ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures like records and arrays. The user willing to effectively manage JSON data collections can rely on several Schema Languages, like JSON Schema, JSound, and Joi, as well as on the type abstractions offered by modern programming and scripting Languages like Swift or TypeScript. The main aim of this tutorial is to provide the audience (both researchers and practitioners) with the basic notions for enjoying all the benefits that Schema and types can offer while processing and manipulating JSON data. This tutorial focuses on four main aspects of the relation between JSON and Schemas: (1) we survey existing Schema Language proposals and discuss their prominent features; (2) we analyze tools that can infer Schemas from data, or that exploit Schema information for improving data parsing and management; and (3) we discuss some open research challenges and opportunities related to JSON data.
-
DBPL - Typing regular path query Languages for data graphs
Proceedings of the 15th Symposium on Database Programming Languages, 2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially untyped. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
-
Typing regular path query Languages for data graphs
2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially untyped. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
-
Typing Regular Path Query Languages for Data Graphs
arXiv: Databases, 2015Co-Authors: Dario Colazzo, Carlo SartianiAbstract:Regular path query Languages for data graphs are essentially \emph{untyped}. The lack of type information greatly limits the optimization opportunities for query engines and makes application development more complex. In this paper we discuss a simple, yet expressive, Schema Language for edge-labelled data graphs. This Schema Language is, then, used to define a query type inference approach with good precision properties.
