Search Results

Documents authored by Cabalar, Pedro

Document
DOI: 10.4230/DagRep.11.11.1
Representing and Solving Spatial Problems (Dagstuhl Seminar 21492)

Authors: Pedro Cabalar, Zoe Falomir, Paulo E. Santos, and Thora Tenbrink

Published in: Dagstuhl Reports, Volume 11, Issue 11 (2022)

Abstract
Everyday life takes place in space and time, and spatial experience lies at the heart of our existence. Understanding how we conceive spatial relations, and how we solve spatio-temporal problems, is therefore key to understanding human cognition. Spatial cognition research has advanced considerably over the past decades, with major successes particularly in computational implementations of knowledge representation and reasoning methods. Still, a range of key issues continue to pose major challenges. The goal of this report is to discuss the various options for the formalisation, implementation and automated solution of spatial problems including the following issues: the identification and specification of relevant concepts as expressed in human language; modules for automated understanding of domain descriptions; the use of spatial structures and affordances for direct spatial problem solving; and, the development of efficient planning systems capable of providing feasible solutions to spatial problems. This report documents the program and the outcomes of Dagstuhl Seminar 21492 "Representing and Solving Spatial Problems".
Cite as

Pedro Cabalar, Zoe Falomir, Paulo E. Santos, and Thora Tenbrink. Representing and Solving Spatial Problems (Dagstuhl Seminar 21492). In Dagstuhl Reports, Volume 11, Issue 11, pp. 1-55, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)

Copy BibTex To Clipboard

@Article{cabalar_et_al:DagRep.11.11.1,
  author =	{Cabalar, Pedro and Falomir, Zoe and Santos, Paulo E. and Tenbrink, Thora},
  title =	{{Representing and Solving Spatial Problems (Dagstuhl Seminar 21492)}},
  pages =	{1--55},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{11},
  number =	{11},
  editor =	{Cabalar, Pedro and Falomir, Zoe and Santos, Paulo E. and Tenbrink, Thora},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.11.11.1},
  URN =		{urn:nbn:de:0030-drops-159387},
  doi =		{10.4230/DagRep.11.11.1},
  annote =	{Keywords: knowledge representation, language analysis and cognitive processes, problem solving, spatial reasoning}
}
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
DOI: 10.4230/LIPIcs.ICLP.2012.290
Paving the Way for Temporal Grounding

Authors: Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, and Concepción Vidal

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)

Abstract
In this paper we consider the problem of introducing variables in temporal logic programs under the formalism of Temporal Equilibrium Logic (TEL), an extension of Answer Set Programming (ASP) for dealing with linear-time modal operators. We provide several fundamental contributions that pave the way for the implementation of a grounding process, that is, a method that allows replacing variables by ground instances in all the possible (or better, relevant) ways.
Cite as

Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, and Concepción Vidal. Paving the Way for Temporal Grounding. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 290-300, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{aguado_et_al:LIPIcs.ICLP.2012.290,
  author =	{Aguado, Felicidad and Cabalar, Pedro and Di\'{e}guez, Mart{\'\i}n and P\'{e}rez, Gilberto and Vidal, Concepci\'{o}n},
  title =	{{Paving the Way for Temporal Grounding}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{290--300},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.290},
  URN =		{urn:nbn:de:0030-drops-36301},
  doi =		{10.4230/LIPIcs.ICLP.2012.290},
  annote =	{Keywords: ASP, linear temporal logic, grounding, temporal equilibrium logic}
}
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 About DROPS Imprint Privacy Contact