the Resource Description Framework (RDF) is one of the major representation standards for the Semantic Web. RDF Schema (RDFS) is used to describe vocabularies used in RDF descriptions. Recently, there is an increasing...
ISBN:
(纸本)9783642332029
the Resource Description Framework (RDF) is one of the major representation standards for the Semantic Web. RDF Schema (RDFS) is used to describe vocabularies used in RDF descriptions. Recently, there is an increasing interest to express additional information on top of RDF data. Several extensions of RDF were proposed in order to deal with time, uncertainty, trust and provenance. All these specific domains can be modeled by a general framework called annotated RDF data [3][5]. A recent work reported millions of triples with temporal information [1] and the number is still increasing. It is reasonable to expect more annotated RDF triples to be handled by semantic web applications. therefore scalability will become an important issue for these applications.
there have been many studies in termination analysis of logicprogramming but little has been done on analyzing non-termination of logic programs, which is even more important in our opinion. Nontermination analysis e...
详细信息
We present a novel approach and implementation for analysing weighted timed automata (WTA) with respect to the weighted metric temporal logic (WMTL ≤). Based on a stochastic semantics of WTAs, we apply statistical mo...
详细信息
Representing and reasoning spatial and temporal information is a key research issue in Computer Science and artificialintelligence. In this paper, we introduce tools that produce three novel encodings which translate...
详细信息
ISBN:
(纸本)9781479902279
Representing and reasoning spatial and temporal information is a key research issue in Computer Science and artificialintelligence. In this paper, we introduce tools that produce three novel encodings which translate problems in qualitative spatial and temporal reasoning into logic programs for answer set programming solvers. Each encoding reflects a different type of modeling abstraction. We evaluate our approach with two of the most well known qualitative spatial and temporal reasoning formalisms, the Interval Algebra and Region Connection Calculus. Our results show some surprising findings, including the strong performance of the solver for disjunctive logic programs over the non-disjunctive ones on our benchmark problems.
the proceedings contain 11 papers. the topics discussed include: Turing universality of step-wise and stage assembly at temperature 1;a type system for DNAQL;deterministic function computation with chemical reaction n...
ISBN:
(纸本)9783642322075
the proceedings contain 11 papers. the topics discussed include: Turing universality of step-wise and stage assembly at temperature 1;a type system for DNAQL;deterministic function computation with chemical reaction networks;reachability bounds for chemical reaction networks and strand displacement systems;synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly;a geometric approach to Gibbs energy landscapes and optimal DNA codeword design;a DNA based molecular logic gate capable of a variety of logical operations;deciding whether a regular language is generated by a splicing system;probabilistic reasoning with a Bayesian DNA device based on strand displacement;DNA self-assembly and computation studied with a coarse-grained dynamic bonded model;and space and energy efficient computation with DNA strand displacement systems.
the proceedings contain 31 papers. the special focus in this conference is on Foundations of Software Science and Computational Structures. the topics include: Querying UML class diagrams;bicategories of concurrent ga...
ISBN:
(纸本)9783642287282
the proceedings contain 31 papers. the special focus in this conference is on Foundations of Software Science and Computational Structures. the topics include: Querying UML class diagrams;bicategories of concurrent games;fibrational induction meets effects;a coalgebraic perspective on minimization and determinization;well-pointed coalgebras;combining interactive and automatic reasoning in first order theories of functional programs;applicative bisimulations for delimited-control operators;effective characterizations of simple fragments of temporal logic using prophetic automata;revisiting trace and testing equivalences for nondeterministic and probabilistic processes;event structure semantics of parallel extrusion in the pi-calculus;narcissists are easy, stepmothers are hard;on nominal regular languages with binders;robustness of structurally equivalent concurrent parity games;subgame perfection for equilibria in quantitative reachability games;concurrent games with ordered objectives;full abstraction for set-based models of the symmetric interaction combinators;on distributability of petri nets;functions as session-typed processes;deriving bisimulation congruences for conditional reactive systems;first-order model checking on nested pushdown trees is complete for doubly exponential alternating time;model checking languages of data words;branching-time model checking of parametric one-counter automata;synthesizing probabilistic composers;on the complexity of computing probabilistic bisimilarity;probabilistic transition system specification and on the complexity of the equivalence problem for probabilistic automata.
the proceedings contain 23 papers. the topics discussed include: transitive separation logic;unifying lazy and strict computations;foundations of coloring algebra with consequences for feature-oriented programming;tow...
ISBN:
(纸本)9783642333132
the proceedings contain 23 papers. the topics discussed include: transitive separation logic;unifying lazy and strict computations;foundations of coloring algebra with consequences for feature-oriented programming;towards an algebra for real-time programs;automated reasoning in higher-order regular algebra;towards certifiable implementation of graph transformation via relation categories;simple rectangle-based functional programs for computing reflexive-transitive closures;using relations to develop a haskell program for computing maximum bipartite matchings;relations as executable specifications: taming partiality and non-determinism using invariants;left-handed completeness;on completeness of omega-regular algebras;categories of algebraic contexts equivalent to idempotent semirings and domain semirings;and relational representation theorem for powerset quantales.
Data exchange is a field of database theory that deals with transferring data between differently structured databases, with motivation coming from industry [21,17]. the starting point of intensive investigation of th...
ISBN:
(纸本)9783642332029
Data exchange is a field of database theory that deals with transferring data between differently structured databases, with motivation coming from industry [21,17]. the starting point of intensive investigation of the problem of data exchange was given in [14] where it was defined as, given data structured under a source schema and a mapping specifying how it should be translated to a target schema, to transform the source data into data structured under the target schema such that it accurately reflects the source data w.r.t. the mapping. this problem has been studied for different combinations of languages used to specify the source and target schema, and the mappings [8]. Most of the results in the literature consider tuple generating dependencies (tgds) as the language to specify mappings. Tgds allow one to express containment of conjunctive queries, and have been widely employed in other areas of database theory. Furthermore, once a target instance is materialized, one mightwant to perform query answering over it.
Linked Data principles allow for processing SPARQL queries on-the-fly by dereferencing URIs. Link-traversal query approaches for Linked Data have the benefit of up-to-date results and decentralised execution, but oper...
详细信息
We present a computing model based on the DNA strand displacement technique which performs Bayesian inference. the model will take single stranded DNA as input data, representing the presence or absence of a specific ...
详细信息
暂无评论