26 Search Results for "Muñoz-Velasco, Emilio"

Volume

LIPIcs, Volume 178

27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

TIME 2020, September 23-25, 2020, Bozen-Bolzano, Italy

Editors: Emilio Muñoz-Velasco, Ana Ozaki, and Martin Theobald

Document
Position
DOI: 10.4230/TGDK.2.1.5
Standardizing Knowledge Engineering Practices with a Reference Architecture

Authors: Bradley P. Allen and Filip Ilievski

Published in: TGDK, Volume 2, Issue 1 (2024): Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge, Volume 2, Issue 1

Abstract
Knowledge engineering is the process of creating and maintaining knowledge-producing systems. Throughout the history of computer science and AI, knowledge engineering workflows have been widely used given the importance of high-quality knowledge for reliable intelligent agents. Meanwhile, the scope of knowledge engineering, as apparent from its target tasks and use cases, has been shifting, together with its paradigms such as expert systems, semantic web, and language modeling. The intended use cases and supported user requirements between these paradigms have not been analyzed globally, as new paradigms often satisfy prior pain points while possibly introducing new ones. The recent abstraction of systemic patterns into a boxology provides an opening for aligning the requirements and use cases of knowledge engineering with the systems, components, and software that can satisfy them best, however, this direction has not been explored to date. This paper proposes a vision of harmonizing the best practices in the field of knowledge engineering by leveraging the software engineering methodology of creating reference architectures. We describe how a reference architecture can be iteratively designed and implemented to associate user needs with recurring systemic patterns, building on top of existing knowledge engineering workflows and boxologies. We provide a six-step roadmap that can enable the development of such an architecture, consisting of scope definition, selection of information sources, architectural analysis, synthesis of an architecture based on the information source analysis, evaluation through instantiation, and, ultimately, instantiation into a concrete software architecture. We provide an initial design and outcome of the definition of architectural scope, selection of information sources, and analysis. As the remaining steps of design, evaluation, and instantiation of the architecture are largely use-case specific, we provide a detailed description of their procedures and point to relevant examples. We expect that following through on this vision will lead to well-grounded reference architectures for knowledge engineering, will advance the ongoing initiatives of organizing the neurosymbolic knowledge engineering space, and will build new links to the software architectures and data science communities.
Cite as

Bradley P. Allen and Filip Ilievski. Standardizing Knowledge Engineering Practices with a Reference Architecture. In Special Issue on Trends in Graph Data and Knowledge - Part 2. Transactions on Graph Data and Knowledge (TGDK), Volume 2, Issue 1, pp. 5:1-5:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@Article{allen_et_al:TGDK.2.1.5,
  author =	{Allen, Bradley P. and Ilievski, Filip},
  title =	{{Standardizing Knowledge Engineering Practices with a Reference Architecture}},
  journal =	{Transactions on Graph Data and Knowledge},
  pages =	{5:1--5:23},
  ISSN =	{2942-7517},
  year =	{2024},
  volume =	{2},
  number =	{1},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/TGDK.2.1.5},
  URN =		{urn:nbn:de:0030-drops-198623},
  doi =		{10.4230/TGDK.2.1.5},
  annote =	{Keywords: knowledge engineering, knowledge graphs, quality attributes, software architectures, sociotechnical systems}
}
Document
DOI: 10.4230/LIPIcs.TIME.2023.9
A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic

Authors: Willem Conradie, Riccardo Monego, Emilio Muñoz-Velasco, Guido Sciavicco, and Ionel Eduard Stan

Published in: LIPIcs, Volume 278, 30th International Symposium on Temporal Representation and Reasoning (TIME 2023)

Abstract
Interval temporal logic plays a critical role in various applications, including planning, scheduling, and formal verification; recently, interval temporal logic has also been successfully applied to learning from temporal data. Halpern and Shoham’s interval temporal logic, in particular, stands out as a very intuitive, yet expressive, interval-based formalism. To address real-world scenarios involving uncertainty and imprecision, Halpern and Shoham’s logic has been recently generalized to the fuzzy (many-valued) case. The resulting language capitalizes on many-valued modal logics, allowing for a range of truth values that reflect multiple expert perspectives, but inherits the bad computational behaviour of its crisp counterpart. In this work, we investigate a sound and complete tableau system for fuzzy Halpern and Shoham’s logic, which, although possibly non-terminating, offers a semi-decision procedure for the finite case.
Cite as

Willem Conradie, Riccardo Monego, Emilio Muñoz-Velasco, Guido Sciavicco, and Ionel Eduard Stan. A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic. In 30th International Symposium on Temporal Representation and Reasoning (TIME 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 278, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)

Copy BibTex To Clipboard

@InProceedings{conradie_et_al:LIPIcs.TIME.2023.9,
  author =	{Conradie, Willem and Monego, Riccardo and Mu\~{n}oz-Velasco, Emilio and Sciavicco, Guido and Stan, Ionel Eduard},
  title =	{{A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic}},
  booktitle =	{30th International Symposium on Temporal Representation and Reasoning (TIME 2023)},
  pages =	{9:1--9:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-298-3},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{278},
  editor =	{Artikis, Alexander and Bruse, Florian and Hunsberger, Luke},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2023.9},
  URN =		{urn:nbn:de:0030-drops-190996},
  doi =		{10.4230/LIPIcs.TIME.2023.9},
  annote =	{Keywords: Interval temporal logic, many-valued logic, tableau system}
}
Document
Complete Volume
DOI: 10.4230/LIPIcs.TIME.2020
LIPIcs, Volume 178, TIME 2020, Complete Volume

Authors: Emilio Muñoz-Velasco, Ana Ozaki, and Martin Theobald

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
LIPIcs, Volume 178, TIME 2020, Complete Volume
Cite as

27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 1-292, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@Proceedings{munozvelasco_et_al:LIPIcs.TIME.2020,
  title =	{{LIPIcs, Volume 178, TIME 2020, Complete Volume}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{1--292},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020},
  URN =		{urn:nbn:de:0030-drops-129670},
  doi =		{10.4230/LIPIcs.TIME.2020},
  annote =	{Keywords: LIPIcs, Volume 178, TIME 2020, Complete Volume}
}
Document
Front Matter
DOI: 10.4230/LIPIcs.TIME.2020.0
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Emilio Muñoz-Velasco, Ana Ozaki, and Martin Theobald

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as

27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{munozvelasco_et_al:LIPIcs.TIME.2020.0,
  author =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{0:i--0:xiv},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.0},
  URN =		{urn:nbn:de:0030-drops-129688},
  doi =		{10.4230/LIPIcs.TIME.2020.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.TIME.2020.1
Verifying Autonomous Robots: Challenges and Reflections (Invited Talk)

Authors: Clare Dixon

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Autonomous robots such as robot assistants, healthcare robots, industrial robots, autonomous vehicles etc. are being developed to carry out a range of tasks in different environments. The robots need to be able to act autonomously, choosing between a range of activities. They may be operating close to or in collaboration with humans, or in environments hazardous to humans where the robot is hard to reach if it malfunctions. We need to ensure that such robots are reliable, safe and trustworthy. In this talk I will discuss experiences from several projects in developing and applying verification techniques to autonomous robotic systems. In particular we consider: a robot assistant in a domestic house, a robot co-worker for a cooperative manufacturing task, multiple robot systems and robots operating in hazardous environments.
Cite as

Clare Dixon. Verifying Autonomous Robots: Challenges and Reflections (Invited Talk). In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 1:1-1:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{dixon:LIPIcs.TIME.2020.1,
  author =	{Dixon, Clare},
  title =	{{Verifying Autonomous Robots: Challenges and Reflections}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{1:1--1:4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.1},
  URN =		{urn:nbn:de:0030-drops-129697},
  doi =		{10.4230/LIPIcs.TIME.2020.1},
  annote =	{Keywords: Verification, Autonomous Robots}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.TIME.2020.2
Temporal Modalities in Answer Set Programming (Invited Talk)

Authors: Pedro Cabalar

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Based on the answer set (or stable model) semantics for logic programs, Answer Set Programming (ASP) has become one of the most successful paradigms for practical Knowledge Representation and problem solving. Although ASP is naturally equipped for solving static combinatorial problems up to NP complexity (or ΣP2 in the disjunctive case) its application to temporal scenarios has been frequent since its very beginning, partly due to its early use for reasoning about actions and change. Temporal problems normally suppose an extra challenge for ASP for several reasons. On the one hand, they normally raise the complexity (in the case of classical planning, for instance, it becomes PSPACE-complete), although this is usually accounted for by making repeated calls to an ASP solver. On the other hand, temporal scenarios also pose a representational challenge, since the basic ASP language does not support temporal expressions. To fill this representational gap, a temporal extension of ASP called Temporal Equilibrium Logic (TEL) was proposed in and extensively studied later. This formalism constitutes a modal, linear-time extension of Equilibrium Logic which, in its turn, is a complete logical characterisation of (standard) ASP based on the intermediate logic of Here-and-There (HT). As a result, TEL is an expressive non-monotonic modal logic that shares the syntax of Linear-Time Temporal Logic (LTL) but interprets temporal formulas under a non-monotonic semantics that properly extends stable models.
Cite as

Pedro Cabalar. Temporal Modalities in Answer Set Programming (Invited Talk). In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 2:1-2:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{cabalar:LIPIcs.TIME.2020.2,
  author =	{Cabalar, Pedro},
  title =	{{Temporal Modalities in Answer Set Programming}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{2:1--2:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.2},
  URN =		{urn:nbn:de:0030-drops-129707},
  doi =		{10.4230/LIPIcs.TIME.2020.2},
  annote =	{Keywords: Logic Programming, Temporal Logic, Answer Set Programming, Modal Logic}
}
Document
Invited Talk
DOI: 10.4230/LIPIcs.TIME.2020.3
Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk)

Authors: Johann Eder and Marco Franceschetti

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Processes have been successfully introduced for modeling dynamic phenomena in many areas like business, production, health care, etc. Many of these applications require to adequately deal with temporal aspects. Process models need to express temporal durations, temporal constraints like allowed time between events, and deadlines. For checking the correctness of process definitions with temporal constraints, different notions and algorithms have been developed. Schedules for the execution of processes can be computed and proactive time management supports process managers to avoid time failures during the execution of a process. We present an overview of the problems and the requirements for treating time in business processes and the solutions achieved by applying results and techniques of research in temporal representation and reasoning. We reflect where expectations have not yet been met and sketch challenges in temporal representation and reasoning for addressing advanced requirements of the management of business processes.
Cite as

Johann Eder and Marco Franceschetti. Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk). In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 3:1-3:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{eder_et_al:LIPIcs.TIME.2020.3,
  author =	{Eder, Johann and Franceschetti, Marco},
  title =	{{Time and Business Process Management: Problems, Achievements, Challenges}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{3:1--3:8},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.3},
  URN =		{urn:nbn:de:0030-drops-129716},
  doi =		{10.4230/LIPIcs.TIME.2020.3},
  annote =	{Keywords: Business Process management, Temporal constraints, Scheduling, Process Evolution, Probabilistic Controllability}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.4
Negotiating Temporal Commitments in Cross-Organizational Business Processes

Authors: Marco Franceschetti and Johann Eder

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Cross-organizational business processes emerge from the cooperation of intra-organizational business processes through exchange of messages. The involved parties agree on communication protocols, which contain in particular temporal constraints: as obligations on one hand, and as guarantees on the other hand. These constraints form also requirements for the design of the hidden implementation of the processes and are the basis for control decisions for each party. We present a comprehensive methodology for modeling the temporal aspects of cross-organizational business processes, checking dynamic controllability of such processes, and supporting the negotiation of temporal commitments. We do so by computing the consequences of temporal constraints in choreographies, and by computing the weakest preconditions for the dynamic controllability of a participating process.
Cite as

Marco Franceschetti and Johann Eder. Negotiating Temporal Commitments in Cross-Organizational Business Processes. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 4:1-4:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{franceschetti_et_al:LIPIcs.TIME.2020.4,
  author =	{Franceschetti, Marco and Eder, Johann},
  title =	{{Negotiating Temporal Commitments in Cross-Organizational Business Processes}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{4:1--4:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.4},
  URN =		{urn:nbn:de:0030-drops-129729},
  doi =		{10.4230/LIPIcs.TIME.2020.4},
  annote =	{Keywords: Cross-organizational processes, Temporal parameters, Range negotiation}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.5
The Horn Fragment of Branching Algebra

Authors: Alessandro Bertagnon, Marco Gavanelli, Alessandro Passantino, Guido Sciavicco, and Stefano Trevisani

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Branching Algebra is the natural branching-time generalization of Allen’s Interval Algebra. As in the linear case, the consistency problem for Branching Algebra is NP-hard. Being relatively new, however, not much is known about the computational behaviour of the consistency problem of its sub-algebras, except in the case of the recently found subset of convex branching relations, for which the consistency of a network can be tested via path consistency and it is therefore deterministic polynomial. In this paper, following Nebel and Bürckert, we define the Horn fragment of Branching Algebra, and prove that it is a sub-algebra of the latter, being closed under inverse, intersection, and composition, that it strictly contains both the convex fragment of Branching Algebra and the Horn fragment of Interval Algebra, and that its consistency problem can be decided via path consistency. Finally, we experimentally prove that the Horn fragment of Branching Algebra can be used as an heuristic for checking the consistency of a generic network with a considerable improvement over the convex subset.
Cite as

Alessandro Bertagnon, Marco Gavanelli, Alessandro Passantino, Guido Sciavicco, and Stefano Trevisani. The Horn Fragment of Branching Algebra. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 5:1-5:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bertagnon_et_al:LIPIcs.TIME.2020.5,
  author =	{Bertagnon, Alessandro and Gavanelli, Marco and Passantino, Alessandro and Sciavicco, Guido and Trevisani, Stefano},
  title =	{{The Horn Fragment of Branching Algebra}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{5:1--5:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.5},
  URN =		{urn:nbn:de:0030-drops-129736},
  doi =		{10.4230/LIPIcs.TIME.2020.5},
  annote =	{Keywords: Constraint programming, Consistency, Branching time, Horn Fragment}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.6
Temporal Logic with Recursion

Authors: Florian Bruse and Martin Lange

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
We introduce extensions of the standard temporal logics CTL and LTL with a recursion operator that takes propositional arguments. Unlike other proposals for modal fixpoint logics of high expressive power, we obtain logics that retain some of the appealing pragmatic advantages of CTL and LTL, yet have expressive power beyond that of the modal μ-calculus or MSO. We advocate these logics by showing how the recursion operator can be used to express interesting non-regular properties. We also study decidability and complexity issues of the standard decision problems.
Cite as

Florian Bruse and Martin Lange. Temporal Logic with Recursion. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{bruse_et_al:LIPIcs.TIME.2020.6,
  author =	{Bruse, Florian and Lange, Martin},
  title =	{{Temporal Logic with Recursion}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{6:1--6:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.6},
  URN =		{urn:nbn:de:0030-drops-129748},
  doi =		{10.4230/LIPIcs.TIME.2020.6},
  annote =	{Keywords: formal specification, temporal logic, expressive power}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.7
Parametric Model Checking Continuous-Time Markov Chains

Authors: Catalin-Andrei Ilie and James Ben Worrell

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
CSL is a well-known temporal logic for specifying properties of real-time stochastic systems, such as continuous-time Markov chains. We introduce PCSL, an extension of CSL that allows using existentially quantified parameters in timing constraints, and investigate its expressiveness and decidability over properties of continuous-time Markov chains. Assuming Schanuel’s Conjecture, we prove the decidability of model checking the one-parameter fragment of PCSL on continuous-time Markov chains. Technically, the central problem we solve (relying on Schanuel’s Conjecture) is to decide positivity of real-valued exponential polynomial functions on bounded intervals. A second contribution is to give a reduction of the Positivity Problem for matrix exponentials to the PCSL model checking problem, suggesting that it will be difficult to give an unconditional proof of the decidability of model checking PCSL.
Cite as

Catalin-Andrei Ilie and James Ben Worrell. Parametric Model Checking Continuous-Time Markov Chains. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{ilie_et_al:LIPIcs.TIME.2020.7,
  author =	{Ilie, Catalin-Andrei and Worrell, James Ben},
  title =	{{Parametric Model Checking Continuous-Time Markov Chains}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{7:1--7:18},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.7},
  URN =		{urn:nbn:de:0030-drops-129752},
  doi =		{10.4230/LIPIcs.TIME.2020.7},
  annote =	{Keywords: Probabilistic Continuous Stochastic Logic, Continuous-time Markov Chains, model checking, Schanuel’s Conjecture, positivity problem}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.8
Universal Solutions in Temporal Data Exchange

Authors: Zehui Cheng and Phokion G. Kolaitis

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
During the past fifteen years, data exchange has been explored in depth and in a variety of different settings. Even though temporal databases constitute a mature area of research studied over several decades, the investigation of temporal data exchange was initiated only very recently. We analyze the properties of universal solutions in temporal data exchange with emphasis on the relationship between universal solutions in the context of concrete time and universal solutions in the context of abstract time. We show that challenges arise even in the setting in which the data exchange specifications involve a single temporal variable. After this, we identify settings, including data exchange settings that involve multiple temporal variables, in which these challenges can be overcome.
Cite as

Zehui Cheng and Phokion G. Kolaitis. Universal Solutions in Temporal Data Exchange. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 8:1-8:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{cheng_et_al:LIPIcs.TIME.2020.8,
  author =	{Cheng, Zehui and Kolaitis, Phokion G.},
  title =	{{Universal Solutions in Temporal Data Exchange}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{8:1--8:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.8},
  URN =		{urn:nbn:de:0030-drops-129763},
  doi =		{10.4230/LIPIcs.TIME.2020.8},
  annote =	{Keywords: temporal databases, database dependencies, data exchange, universal solutions, abstract time, concrete time, Allen’s relations}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.9
Knowledge Extraction with Interval Temporal Logic Decision Trees

Authors: Guido Sciavicco and Ionel Eduard Stan

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Multivariate temporal, or time, series classification is, in a way, the temporal generalization of (numeric) classification, as every instance is described by multiple time series instead of multiple values. Symbolic classification is the machine learning strategy to extract explicit knowledge from a data set, and the problem of symbolic classification of multivariate temporal series requires the design, implementation, and test of ad-hoc machine learning algorithms, such as, for example, algorithms for the extraction of temporal versions of decision trees. One of the most well-known algorithms for decision tree extraction from categorical data is Quinlan’s ID3, which was later extended to deal with numerical attributes, resulting in an algorithm known as C4.5, and implemented in many open-sources data mining libraries, including the so-called Weka, which features an implementation of C4.5 called J48. ID3 was recently generalized to deal with temporal data in form of timelines, which can be seen as discrete (categorical) versions of multivariate time series, and such a generalization, based on the interval temporal logic HS, is known as Temporal ID3. In this paper we introduce Temporal C4.5, that allows the extraction of temporal decision trees from undiscretized multivariate time series, describe its implementation, called Temporal J48, and discuss the outcome of a set of experiments with the latter on a collection of public data sets, comparing the results with those obtained by other, classical, multivariate time series classification methods.
Cite as

Guido Sciavicco and Ionel Eduard Stan. Knowledge Extraction with Interval Temporal Logic Decision Trees. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{sciavicco_et_al:LIPIcs.TIME.2020.9,
  author =	{Sciavicco, Guido and Stan, Ionel Eduard},
  title =	{{Knowledge Extraction with Interval Temporal Logic Decision Trees}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{9:1--9:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.9},
  URN =		{urn:nbn:de:0030-drops-129776},
  doi =		{10.4230/LIPIcs.TIME.2020.9},
  annote =	{Keywords: Interval Temporal Logic, Decision Trees, Explainable AI, Time series}
}
Document
DOI: 10.4230/LIPIcs.TIME.2020.10
Window-Slicing Techniques Extended to Spanning-Event Streams

Authors: Aurélie Suzanne, Guillaume Raschia, José Martinez, and Damien Tassetti

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)

Abstract
Streaming systems often use slices to share computation costs among overlapping windows. However they are limited to instantaneous events where only one point represents the event. Here, we extend streams to events that come with a duration, denoted as spanning events. After a short review of the new constraints ensued by event lifespan in a temporal sliding-window context, we propose a new structure for dealing with slices in such an environment, and prove that our technique is both correct and effective to deal with such spanning events.
Cite as

Aurélie Suzanne, Guillaume Raschia, José Martinez, and Damien Tassetti. Window-Slicing Techniques Extended to Spanning-Event Streams. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{suzanne_et_al:LIPIcs.TIME.2020.10,
  author =	{Suzanne, Aur\'{e}lie and Raschia, Guillaume and Martinez, Jos\'{e} and Tassetti, Damien},
  title =	{{Window-Slicing Techniques Extended to Spanning-Event Streams}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{10:1--10:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.10},
  URN =		{urn:nbn:de:0030-drops-129783},
  doi =		{10.4230/LIPIcs.TIME.2020.10},
  annote =	{Keywords: Data Stream, Spanning-events, Temporal Aggregates, Sliding Windows}
}
  • Refine by Author
  • 6 Sciavicco, Guido
  • 5 Muñoz-Velasco, Emilio
  • 2 Bresolin, Davide
  • 2 Eder, Johann
  • 2 Franceschetti, Marco
  • Show More...

  • Refine by Classification
  • 5 Information systems → Temporal data
  • 4 Computing methodologies → Temporal reasoning
  • 4 Theory of computation → Logic
  • 4 Theory of computation → Modal and temporal logics
  • 3 Computing methodologies → Knowledge representation and reasoning
  • Show More...

  • Refine by Keyword
  • 2 Interval temporal logic
  • 2 Temporal Logic
  • 2 Temporal constraints
  • 2 temporal logic
  • 1 Allen’s relations
  • Show More...

  • Refine by Type
  • 25 document
  • 1 volume

  • Refine by Publication Year
  • 22 2020
  • 1 2017
  • 1 2018
  • 1 2023
  • 1 2024

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact