32 Search Results for "Ozaki, Ana"

Volume

OASIcs, Volume 99

International Research School in Artificial Intelligence in Bergen (AIB 2022)

AIB 2022, June 7-11, 2022, University of Bergen, Norway

Editors: Camille Bourgaux, Ana Ozaki, and Rafael Peñaloza

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
Complete Volume
DOI: 10.4230/OASIcs.AIB.2022
OASIcs, Volume 99, AIB 2022, Complete Volume

Authors: Camille Bourgaux, Ana Ozaki, and Rafael Peñaloza

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
OASIcs, Volume 99, AIB 2022, Complete Volume
Cite as

International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 1-180, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@Proceedings{bourgaux_et_al:OASIcs.AIB.2022,
  title =	{{OASIcs, Volume 99, AIB 2022, Complete Volume}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{1--180},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022},
  URN =		{urn:nbn:de:0030-drops-159976},
  doi =		{10.4230/OASIcs.AIB.2022},
  annote =	{Keywords: OASIcs, Volume 99, AIB 2022, Complete Volume}
}
Document
Front Matter
DOI: 10.4230/OASIcs.AIB.2022.0
Front Matter, Table of Contents, Preface, Conference Organization

Authors: Camille Bourgaux, Ana Ozaki, and Rafael Peñaloza

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

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

International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{bourgaux_et_al:OASIcs.AIB.2022.0,
  author =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  title =	{{Front Matter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{0:i--0:x},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.0},
  URN =		{urn:nbn:de:0030-drops-159984},
  doi =		{10.4230/OASIcs.AIB.2022.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.1
Knowledge Graphs: A Guided Tour (Invited Paper)

Authors: Aidan Hogan

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Much has been written about knowledge graphs in the past years by authors coming from diverse communities. The goal of these lecture notes is to provide a guided tour to the secondary and tertiary literature concerning knowledge graphs where the reader can learn more about particular topics. In particular, we collate together brief summaries of relevant books, book collections, book chapters, journal articles and other publications that provide introductions, primers, surveys and perspectives regarding: knowledge graphs in general; graph data models and query languages; semantics in the form of graph schemata, ontologies and rules; graph theory, algorithms and analytics; graph learning, in the form of knowledge graph embeddings and graph neural networks; and the knowledge graph life-cycle, which incorporates works on constructing, refining and publishing knowledge graphs. Where available, we highlight and provide direct links to open access literature.
Cite as

Aidan Hogan. Knowledge Graphs: A Guided Tour (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 1:1-1:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{hogan:OASIcs.AIB.2022.1,
  author =	{Hogan, Aidan},
  title =	{{Knowledge Graphs: A Guided Tour}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{1:1--1:21},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.1},
  URN =		{urn:nbn:de:0030-drops-159999},
  doi =		{10.4230/OASIcs.AIB.2022.1},
  annote =	{Keywords: knowledge graphs}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.2
Reasoning in Knowledge Graphs (Invited Paper)

Authors: Ricardo Guimarães and Ana Ozaki

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Knowledge Graphs (KGs) are becoming increasingly popular in the industry and academia. They can be represented as labelled graphs conveying structured knowledge in a domain of interest, where nodes and edges are enriched with metaknowledge such as time validity, provenance, language, among others. Once the data is structured as a labelled graph one can apply reasoning techniques to extract relevant and insightful information. We provide an overview of deductive and inductive reasoning approaches for reasoning in KGs.
Cite as

Ricardo Guimarães and Ana Ozaki. Reasoning in Knowledge Graphs (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 2:1-2:31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{guimaraes_et_al:OASIcs.AIB.2022.2,
  author =	{Guimar\~{a}es, Ricardo and Ozaki, Ana},
  title =	{{Reasoning in Knowledge Graphs}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{2:1--2:31},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.2},
  URN =		{urn:nbn:de:0030-drops-160005},
  doi =		{10.4230/OASIcs.AIB.2022.2},
  annote =	{Keywords: Knowledge Graphs, Description Logics, Knowledge Graph Embeddings}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.3
Integrating Ontologies and Vector Space Embeddings Using Conceptual Spaces (Invited Paper)

Authors: Zied Bouraoui, Víctor Gutiérrez-Basulto, and Steven Schockaert

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Ontologies and vector space embeddings are among the most popular frameworks for encoding conceptual knowledge. Ontologies excel at capturing the logical dependencies between concepts in a precise and clearly defined way. Vector space embeddings excel at modelling similarity and analogy. Given these complementary strengths, there is a clear need for frameworks that can combine the best of both worlds. In this paper, we present an overview of our recent work in this area. We first discuss the theory of conceptual spaces, which was proposed in the 1990s by Gärdenfors as an intermediate representation layer in between embeddings and symbolic knowledge bases. We particularly focus on a number of recent strategies for learning conceptual space representations from data. Next, building on the idea of conceptual spaces, we discuss approaches where relational knowledge is modelled in terms of geometric constraints. Such approaches aim at a tight integration of symbolic and geometric representations, which unfortunately comes with a number of limitations. For this reason, we finally also discuss methods in which similarity, and other forms of conceptual relatedness, are derived from vector space embeddings and subsequently used to support flexible forms of reasoning with ontologies, thus enabling a looser integration between embeddings and symbolic knowledge.
Cite as

Zied Bouraoui, Víctor Gutiérrez-Basulto, and Steven Schockaert. Integrating Ontologies and Vector Space Embeddings Using Conceptual Spaces (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 3:1-3:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{bouraoui_et_al:OASIcs.AIB.2022.3,
  author =	{Bouraoui, Zied and Guti\'{e}rrez-Basulto, V{\'\i}ctor and Schockaert, Steven},
  title =	{{Integrating Ontologies and Vector Space Embeddings Using Conceptual Spaces}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{3:1--3:30},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.3},
  URN =		{urn:nbn:de:0030-drops-160015},
  doi =		{10.4230/OASIcs.AIB.2022.3},
  annote =	{Keywords: Conceptual Spaces, Ontologies, Vector Space Embeddings, Learning and Reasoning}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.4
Combining Embeddings and Rules for Fact Prediction (Invited Paper)

Authors: Armand Boschin, Nitisha Jain, Gurami Keretchashvili, and Fabian Suchanek

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Knowledge bases are typically incomplete, meaning that they are missing information that we would expect to be there. Recent years have seen two main approaches to guess missing facts: Rule Mining and Knowledge Graph Embeddings. The first approach is symbolic, and finds rules such as "If two people are married, they most likely live in the same city". These rules can then be used to predict missing statements. Knowledge Graph Embeddings, on the other hand, are trained to predict missing facts for a knowledge base by mapping entities to a vector space. Each of these approaches has their strengths and weaknesses, and this article provides a survey of neuro-symbolic works that combine embeddings and rule mining approaches for fact prediction.
Cite as

Armand Boschin, Nitisha Jain, Gurami Keretchashvili, and Fabian Suchanek. Combining Embeddings and Rules for Fact Prediction (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 4:1-4:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{boschin_et_al:OASIcs.AIB.2022.4,
  author =	{Boschin, Armand and Jain, Nitisha and Keretchashvili, Gurami and Suchanek, Fabian},
  title =	{{Combining Embeddings and Rules for Fact Prediction}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{4:1--4:30},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.4},
  URN =		{urn:nbn:de:0030-drops-160021},
  doi =		{10.4230/OASIcs.AIB.2022.4},
  annote =	{Keywords: Rule Mining, Embeddings, Knowledge Bases, Deep Learning}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.5
Learning and Reasoning with Graph Data: Neural and Statistical-Relational Approaches (Invited Paper)

Authors: Manfred Jaeger

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Graph neural networks (GNNs) have emerged in recent years as a very powerful and popular modeling tool for graph and network data. Though much of the work on GNNs has focused on graphs with a single edge relation, they have also been adapted to multi-relational graphs, including knowledge graphs. In such multi-relational domains, the objectives and possible applications of GNNs become quite similar to what for many years has been investigated and developed in the field of statistical relational learning (SRL). This article first gives a brief overview of the main features of GNN and SRL approaches to learning and reasoning with graph data. It analyzes then in more detail their commonalities and differences with respect to semantics, representation, parameterization, interpretability, and flexibility. A particular focus will be on relational Bayesian networks (RBNs) as the SRL framework that is most closely related to GNNs. We show how common GNN architectures can be directly encoded as RBNs, thus enabling the direct integration of "low level" neural model components with the "high level" symbolic representation and flexible inference capabilities of SRL.
Cite as

Manfred Jaeger. Learning and Reasoning with Graph Data: Neural and Statistical-Relational Approaches (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 5:1-5:42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{jaeger:OASIcs.AIB.2022.5,
  author =	{Jaeger, Manfred},
  title =	{{Learning and Reasoning with Graph Data: Neural and Statistical-Relational Approaches}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{5:1--5:42},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.5},
  URN =		{urn:nbn:de:0030-drops-160035},
  doi =		{10.4230/OASIcs.AIB.2022.5},
  annote =	{Keywords: Graph neural networks, Statistical relational learning}
}
Document
Invited Paper
DOI: 10.4230/OASIcs.AIB.2022.6
Automating Moral Reasoning (Invited Paper)

Authors: Marija Slavkovik

Published in: OASIcs, Volume 99, International Research School in Artificial Intelligence in Bergen (AIB 2022)

Abstract
Artificial Intelligence ethics is concerned with ensuring a nonnegative ethical impact of researching, developing, deploying and using AI systems. One way to accomplish that is to enable those AI systems to make moral decisions in ethically sensitive situations, i.e., automate moral reasoning. Machine ethics is an interdisciplinary research area that is concerned with the problem of automating moral reasoning. This tutorial presents the problem of making moral decisions and gives a general overview of how a computational agent can be constructed to make moral decisions. The tutorial is aimed for students in artificial intelligence who are interested in acquiring a starting understanding of the basic concepts and a gateway to the literature in machine ethics.
Cite as

Marija Slavkovik. Automating Moral Reasoning (Invited Paper). In International Research School in Artificial Intelligence in Bergen (AIB 2022). Open Access Series in Informatics (OASIcs), Volume 99, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@InProceedings{slavkovik:OASIcs.AIB.2022.6,
  author =	{Slavkovik, Marija},
  title =	{{Automating Moral Reasoning}},
  booktitle =	{International Research School in Artificial Intelligence in Bergen (AIB 2022)},
  pages =	{6:1--6:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-228-0},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{99},
  editor =	{Bourgaux, Camille and Ozaki, Ana and Pe\~{n}aloza, Rafael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.AIB.2022.6},
  URN =		{urn:nbn:de:0030-drops-160043},
  doi =		{10.4230/OASIcs.AIB.2022.6},
  annote =	{Keywords: Machine ethics, artificial morality, artificial moral agents}
}
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-dev.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-dev.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-dev.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-dev.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-dev.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}
}
  • Refine by Author
  • 6 Ozaki, Ana
  • 3 Sciavicco, Guido
  • 2 Bourgaux, Camille
  • 2 Eder, Johann
  • 2 Franceschetti, Marco
  • Show More...

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

  • Refine by Keyword
  • 2 Conference Organization
  • 2 Front Matter
  • 2 Preface
  • 2 Table of Contents
  • 2 Temporal constraints
  • Show More...

  • Refine by Type
  • 30 document
  • 2 volume

  • Refine by Publication Year
  • 22 2020
  • 9 2022
  • 1 2018

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