38 Search Results for "L�wes, Benedikt"

Document
DOI: 10.4230/LIPIcs.FSTTCS.2021.39
Local First-Order Logic with Two Data Values

Authors: Benedikt Bollig, Arnaud Sangnier, and Olivier Stietel

Published in: LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)

Abstract
We study first-order logic over unordered structures whose elements carry two data values from an infinite domain. Data values can be compared wrt. equality so that the formalism is suitable to specify the input-output behavior of various distributed algorithms. As the logic is undecidable in general, we introduce a family of local fragments that restrict quantification to neighborhoods of a given reference point. Our main result establishes decidability of the satisfiability problem for one of these non-trivial local fragments. On the other hand, already slightly more general local logics turn out to be undecidable. Altogether, we draw a landscape of formalisms that are suitable for the specification of systems with data and open up new avenues for future research.
Cite as

Benedikt Bollig, Arnaud Sangnier, and Olivier Stietel. Local First-Order Logic with Two Data Values. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 213, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{bollig_et_al:LIPIcs.FSTTCS.2021.39,
  author =	{Bollig, Benedikt and Sangnier, Arnaud and Stietel, Olivier},
  title =	{{Local First-Order Logic with Two Data Values}},
  booktitle =	{41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)},
  pages =	{39:1--39:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-215-0},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{213},
  editor =	{Boja\'{n}czyk, Miko{\l}aj and Chekuri, Chandra},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.39},
  URN =		{urn:nbn:de:0030-drops-155508},
  doi =		{10.4230/LIPIcs.FSTTCS.2021.39},
  annote =	{Keywords: first-order logic, data values, specification of distributed algorithms}
}
Document
Track B: Automata, Logic, Semantics, and Theory of Programming
DOI: 10.4230/LIPIcs.ICALP.2019.106
String-to-String Interpretations With Polynomial-Size Output (Track B: Automata, Logic, Semantics, and Theory of Programming)

Authors: Mikołaj Bojańczyk, Sandra Kiefer, and Nathan Lhote

Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)

Abstract
String-to-string MSO interpretations are like Courcelle’s MSO transductions, except that a single output position can be represented using a tuple of input positions instead of just a single input position. In particular, the output length is polynomial in the input length, as opposed to MSO transductions, which have output of linear length. We show that string-to-string MSO interpretations are exactly the polyregular functions. The latter class has various characterisations, one of which is that it consists of the string-to-string functions recognised by pebble transducers. Our main result implies the surprising fact that string-to-string MSO interpretations are closed under composition.
Cite as

Mikołaj Bojańczyk, Sandra Kiefer, and Nathan Lhote. String-to-String Interpretations With Polynomial-Size Output (Track B: Automata, Logic, Semantics, and Theory of Programming). In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 106:1-106:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2019.106,
  author =	{Boja\'{n}czyk, Miko{\l}aj and Kiefer, Sandra and Lhote, Nathan},
  title =	{{String-to-String Interpretations With Polynomial-Size Output}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{106:1--106:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.106},
  URN =		{urn:nbn:de:0030-drops-106821},
  doi =		{10.4230/LIPIcs.ICALP.2019.106},
  annote =	{Keywords: MSO, interpretations, pebble transducers, polyregular functions}
}
Document
DOI: 10.4230/LIPIcs.ICDT.2017.6
Combined Tractability of Query Evaluation via Tree Automata and Cycluits

Authors: Antoine Amarilli, Pierre Bourhis, Mikaël Monet, and Pierre Senellart

Published in: LIPIcs, Volume 68, 20th International Conference on Database Theory (ICDT 2017)

Abstract
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog fragment with stratified negation, intensional-clique-guarded Datalog (ICG-Datalog), with linear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular conjunctive queries with simplicial decompositions of bounded width, guarded negation fragment queries of bounded CQ-rank, or two-way regular path queries. Our result is shown by compiling to alternating two-way automata, whose semantics is defined via cyclic provenance circuits (cycluits) that can be tractably evaluated. Last, we prove that probabilistic query evaluation remains intractable in combined complexity under this parameterization.
Cite as

Antoine Amarilli, Pierre Bourhis, Mikaël Monet, and Pierre Senellart. Combined Tractability of Query Evaluation via Tree Automata and Cycluits. In 20th International Conference on Database Theory (ICDT 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 68, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{amarilli_et_al:LIPIcs.ICDT.2017.6,
  author =	{Amarilli, Antoine and Bourhis, Pierre and Monet, Mika\"{e}l and Senellart, Pierre},
  title =	{{Combined Tractability of Query Evaluation via Tree Automata and Cycluits}},
  booktitle =	{20th International Conference on Database Theory (ICDT 2017)},
  pages =	{6:1--6:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-024-8},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{68},
  editor =	{Benedikt, Michael and Orsi, Giorgio},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2017.6},
  URN =		{urn:nbn:de:0030-drops-70516},
  doi =		{10.4230/LIPIcs.ICDT.2017.6},
  annote =	{Keywords: query evaluation, tree automata, provenance, treewidth, circuits}
}
Document
DOI: 10.4230/LIPIcs.TYPES.2014.1
Terminal Semantics for Codata Types in Intensional Martin-Löf Type Theory

Authors: Benedikt Ahrens and Régis Spadotti

Published in: LIPIcs, Volume 39, 20th International Conference on Types for Proofs and Programs (TYPES 2014)

Abstract
We study the notions of relative comonad and comodule over a relative comonad. We use these notions to give categorical semantics for the coinductive type families of streams and of infinite triangular matrices and their respective cosubstitution operations in intensional Martin-Löf type theory. Our results are mechanized in the proof assistant Coq.
Cite as

Benedikt Ahrens and Régis Spadotti. Terminal Semantics for Codata Types in Intensional Martin-Löf Type Theory. In 20th International Conference on Types for Proofs and Programs (TYPES 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 39, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)

Copy BibTex To Clipboard

@InProceedings{ahrens_et_al:LIPIcs.TYPES.2014.1,
  author =	{Ahrens, Benedikt and Spadotti, R\'{e}gis},
  title =	{{Terminal Semantics for Codata Types in Intensional Martin-L\"{o}f Type Theory}},
  booktitle =	{20th International Conference on Types for Proofs and Programs (TYPES 2014)},
  pages =	{1--26},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-88-0},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{39},
  editor =	{Herbelin, Hugo and Letouzey, Pierre and Sozeau, Matthieu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2014.1},
  URN =		{urn:nbn:de:0030-drops-54891},
  doi =		{10.4230/LIPIcs.TYPES.2014.1},
  annote =	{Keywords: relative comonad, Martin-L\"{o}f type theory, coinductive type, computer theorem proving}
}
Document
Invited Report
DOI: 10.4230/OASIcs.CMN.2014.9
What Makes Stories Similar? Report on a Research Project, 2011-2014 (Invited Report)

Authors: Bernhard Fisseni and Benedikt Löwe

Published in: OASIcs, Volume 41, 2014 Workshop on Computational Models of Narrative

Abstract
We present a survey of the results and findings of the research project "What makes stories similar?" funded by the John Templeton Foundation from October 2011 to May 2014.
Cite as

Bernhard Fisseni and Benedikt Löwe. What Makes Stories Similar? Report on a Research Project, 2011-2014 (Invited Report). In 2014 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 41, pp. 9-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{fisseni_et_al:OASIcs.CMN.2014.9,
  author =	{Fisseni, Bernhard and L\"{o}we, Benedikt},
  title =	{{What Makes Stories Similar? Report on a Research Project, 2011-2014}},
  booktitle =	{2014 Workshop on Computational Models of Narrative},
  pages =	{9--12},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-71-2},
  ISSN =	{2190-6807},
  year =	{2014},
  volume =	{41},
  editor =	{Finlayson, Mark A. and Meister, Jan Christoph and Bruneau, Emile G.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2014.9},
  URN =		{urn:nbn:de:0030-drops-46405},
  doi =		{10.4230/OASIcs.CMN.2014.9},
  annote =	{Keywords: narratives, similarity, empirical studies}
}
Document
DOI: 10.4230/DagRep.4.1.83
Planning with epistemic goals (Dagstuhl Seminar 14032)

Authors: Thomas Agotnes, Gerhard Lakemeyer, Benedikt Löwe, and Bernhard Nebel

Published in: Dagstuhl Reports, Volume 4, Issue 1 (2014)

Abstract
This report documents the outcomes of Dagstuhl Seminar 14032 "Planning with epistemic goals". It brought together the communities of so far relatively separate research areas related to artificial intelligence and logic: automated planning on the one hand, and dynamic logics of interaction on the other. Significant overlap in motivation, theory and methods was discovered, and a good potential for cross fertilization became apparent.
Cite as

Thomas Agotnes, Gerhard Lakemeyer, Benedikt Löwe, and Bernhard Nebel. Planning with epistemic goals (Dagstuhl Seminar 14032). In Dagstuhl Reports, Volume 4, Issue 1, pp. 83-103, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{agotnes_et_al:DagRep.4.1.83,
  author =	{Agotnes, Thomas and Lakemeyer, Gerhard and L\"{o}we, Benedikt and Nebel, Bernhard},
  title =	{{Planning with epistemic goals (Dagstuhl Seminar 14032)}},
  pages =	{83--103},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{4},
  number =	{1},
  editor =	{Agotnes, Thomas and Lakemeyer, Gerhard and L\"{o}we, Benedikt and Nebel, Bernhard},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.4.1.83},
  URN =		{urn:nbn:de:0030-drops-45369},
  doi =		{10.4230/DagRep.4.1.83},
  annote =	{Keywords: planning, epistemic logic, modal logic}
}
Document
DOI: 10.4230/OASIcs.GCB.2013.110
Avoiding Ambiguity and Assessing Uniqueness in Minisatellite Alignment

Authors: Benedikt Löwes and Robert Giegerich

Published in: OASIcs, Volume 34, German Conference on Bioinformatics 2013

Abstract
Several algorithms have been suggested for minisatellite alignment. Their time complexity is high -- close to O(n^3) -- due to the necessary reconstruction of duplication histories. We investigate the uniqueness of optimal alignments computed under the common single-copy duplication model. To this extent, it is necessary to avoid ambiguity in the algorithm employed. We re-code the ARLEM algorithm in the form of a grammar, and apply a disambiguation technique which uses a mapping to a canonical representation of minisatellite alignments. Having arrived at a non-ambiguous algorithm this way, we demonstrate that the underlying model -- independent of the algorithm -- gives rise to an exorbitant number of different, co-optimal alignments when applied to real-world data. We conclude that alignment-free methods should be considered for minisatellite comparison.
Cite as

Benedikt Löwes and Robert Giegerich. Avoiding Ambiguity and Assessing Uniqueness in Minisatellite Alignment. In German Conference on Bioinformatics 2013. Open Access Series in Informatics (OASIcs), Volume 34, pp. 110-124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{lowes_et_al:OASIcs.GCB.2013.110,
  author =	{L\"{o}wes, Benedikt and Giegerich, Robert},
  title =	{{Avoiding Ambiguity and Assessing Uniqueness in Minisatellite Alignment}},
  booktitle =	{German Conference on Bioinformatics 2013},
  pages =	{110--124},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-59-0},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{34},
  editor =	{Bei{\ss}barth, Tim and Kollmar, Martin and Leha, Andreas and Morgenstern, Burkhard and Schultz, Anne-Kathrin and Waack, Stephan and Wingender, Edgar},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2013.110},
  URN =		{urn:nbn:de:0030-drops-42285},
  doi =		{10.4230/OASIcs.GCB.2013.110},
  annote =	{Keywords: minisatellite alignment, dynamic programming, ambiguity}
}
Document
Complete Volume
DOI: 10.4230/OASIcs.CMN.2013
OASIcs, Volume 32, CMN'13, Complete Volume

Authors: Mark A. Finlayson, Bernhard Fisseni, Benedikt Löwe, and Jan Christoph Meister

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
OASIcs, Volume 32, CMN'13, Complete Volume
Cite as

2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Proceedings{finlayson_et_al:OASIcs.CMN.2013,
  title =	{{OASIcs, Volume 32, CMN'13, Complete Volume}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013},
  URN =		{urn:nbn:de:0030-drops-41727},
  doi =		{10.4230/OASIcs.CMN.2013},
  annote =	{Keywords: Probability and statistics, Systems and Information Theory, User/Machine Systems, Models and Principles: Miscellaneous, Database applications, Content Analysis and Indexing, Information storage, Digital Libraries, Communications Applications, Multimedia Information Systems, User Interfaces}
}
Document
Front Matter
DOI: 10.4230/OASIcs.CMN.2013.i
Frontmatter, Table of Contents, Preface, Workshop Organization

Authors: Mark A. Finlayson, Bernhard Fisseni, Benedikt Löwe, and Jan Christoph Meister

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
Frontmatter, Table of Contents, Preface, Workshop Organization
Cite as

2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. i-xv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{finlayson_et_al:OASIcs.CMN.2013.i,
  author =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  title =	{{Frontmatter, Table of Contents, Preface, Workshop Organization}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{i--xv},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.i},
  URN =		{urn:nbn:de:0030-drops-41357},
  doi =		{10.4230/OASIcs.CMN.2013.i},
  annote =	{Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization}
}
Document
Invited Talk
DOI: 10.4230/OASIcs.CMN.2013.1
A Participatory Perspective on the Experience of Narrative Worlds (Invited Talk)

Authors: Richard Gerrig

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
As people experience narratives, they often behave as if they are participants in the narrative world. This talk embraces that claim to develop a participatory perspective on readers' and viewers' narrative experiences. This perspective asserts, for example, that readers encode participatory responses as reactions to characters' utterances and actions. The talk will review three areas of empirical research that have emerged from this perspective. The first area will be readers' experiences of narrative mysteries—circumstances in which a text raises questions that are not immediately settled. The second area will be the consequences of readers' participation as they weigh in on characters' actions and decisions. The third area will be the potential for changes in people's beliefs and attitudes as a product of their narrative experiences.
Cite as

Richard Gerrig. A Participatory Perspective on the Experience of Narrative Worlds (Invited Talk). In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{gerrig:OASIcs.CMN.2013.1,
  author =	{Gerrig, Richard},
  title =	{{A Participatory Perspective on the Experience of Narrative Worlds}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{1--2},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.1},
  URN =		{urn:nbn:de:0030-drops-41635},
  doi =		{10.4230/OASIcs.CMN.2013.1},
  annote =	{Keywords: Narrative, Knowledge Representation, Knowledge Revision}
}
Document
Invited Talk
DOI: 10.4230/OASIcs.CMN.2013.3
Plots as Summaries of Event Chains (Invited Talk)

Authors: Inderjeet Mani

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
The plot of a narrative addresses what happened, and why. While a number of interesting theories of plot have been explored, it has proved hard in narrative interpretation to automatically compute a representation of the plot. This talk describes how to build a representation of what happened by summarizing temporal chains of events that involve a particular protagonist. These chains, which are based on the work of Chambers, can be summarized by various methods, including pruning subgraphs in the representation. Linguistic challenges include habitual expressions and non-literal language. The talk concludes with suggestions for how to layer causal information on top of the representation of what happened.
Cite as

Inderjeet Mani. Plots as Summaries of Event Chains (Invited Talk). In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, p. 3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{mani:OASIcs.CMN.2013.3,
  author =	{Mani, Inderjeet},
  title =	{{Plots as Summaries of Event Chains}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{3--3},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.3},
  URN =		{urn:nbn:de:0030-drops-41623},
  doi =		{10.4230/OASIcs.CMN.2013.3},
  annote =	{Keywords: Narrative, Summarization, Event Chains}
}
Document
DOI: 10.4230/OASIcs.CMN.2013.4
CB-POCL: A Choice-Based Algorithm for Character Personality in Planning-based Narrative Generation

Authors: Julio César Bahamón and R. Michael Young

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
The quality and believability of a story can be significantly enhanced by the presence of compelling characters. Characters can be made more compelling by the portrayal of a distinguishable personality. This paper presents an algorithm that formalizes an approach previously described for the incorporation of character personality in narrative that is automatically generated. The approach is based on a computational model that operationalizes personality as behavior that results from the choices made by characters in the course of a story. This operationalization is based on the Big Five personality structure and results from behavioral psychology studies that link behavior to personality traits.
Cite as

Julio César Bahamón and R. Michael Young. CB-POCL: A Choice-Based Algorithm for Character Personality in Planning-based Narrative Generation. In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. 4-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{bahamon_et_al:OASIcs.CMN.2013.4,
  author =	{Baham\'{o}n, Julio C\'{e}sar and Young, R. Michael},
  title =	{{CB-POCL: A Choice-Based Algorithm for Character Personality in Planning-based Narrative Generation}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{4--23},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.4},
  URN =		{urn:nbn:de:0030-drops-41601},
  doi =		{10.4230/OASIcs.CMN.2013.4},
  annote =	{Keywords: Artificial Intelligence, Planning, Narrative Generation}
}
Document
DOI: 10.4230/OASIcs.CMN.2013.24
Cognitive Interpretation of Everyday Activities - Toward Perceptual Narrative Based Visuo-Spatial Scene Interpretation

Authors: Mehul Bhatt, Jakob Suchan, and Carl Schultz

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
We position a narrative-centred computational model for high-level knowledge representation and reasoning in the context of a range of assistive technologies concerned with visuo-spatial perception and cognition tasks. Our proposed narrative model encompasses aspects such as space, events, actions, change, and interaction from the viewpoint of commonsense reasoning and learning in large-scale cognitive systems. The broad focus of this paper is on the domain of human-activity interpretation in smart environments, ambient intelligence etc. In the backdrop of a smart meeting cinematography domain, we position the proposed narrative model, preliminary work on perceptual narrativisation, and the immediate outlook on constructing general-purpose open-source tools for perceptual narrativisation.
Cite as

Mehul Bhatt, Jakob Suchan, and Carl Schultz. Cognitive Interpretation of Everyday Activities - Toward Perceptual Narrative Based Visuo-Spatial Scene Interpretation. In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. 24-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{bhatt_et_al:OASIcs.CMN.2013.24,
  author =	{Bhatt, Mehul and Suchan, Jakob and Schultz, Carl},
  title =	{{Cognitive Interpretation of Everyday Activities - Toward Perceptual Narrative Based Visuo-Spatial Scene Interpretation}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{24--29},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.24},
  URN =		{urn:nbn:de:0030-drops-41480},
  doi =		{10.4230/OASIcs.CMN.2013.24},
  annote =	{Keywords: cognitive systems; human-computer interaction; spatial cognition and computation; commonsense reasoning; spatial and temporal reasoning; assistive tec}
}
Document
DOI: 10.4230/OASIcs.CMN.2013.30
Exploring the Betrothed Lovers

Authors: Andrea Bolioli, Matteo Casu, Maurizio Lana, and Renato Roda

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
We present the ongoing activities and the first results achieved in a research project concerning the understanding of narrative in the high school. Students and teachers experimented with new ways to learn linguistic and digital skills, by using a collaborative learning environment built around the novel I Promessi Sposi. We analyzed the literary text, extracting social networks of characters and other fundamental narrative elements (sequences, locations, etc.), in order to provide the students with appropriate tools and resources to conduct their own inquiries on the novel.
Cite as

Andrea Bolioli, Matteo Casu, Maurizio Lana, and Renato Roda. Exploring the Betrothed Lovers. In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. 30-35, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{bolioli_et_al:OASIcs.CMN.2013.30,
  author =	{Bolioli, Andrea and Casu, Matteo and Lana, Maurizio and Roda, Renato},
  title =	{{Exploring the Betrothed Lovers}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{30--35},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.30},
  URN =		{urn:nbn:de:0030-drops-41535},
  doi =		{10.4230/OASIcs.CMN.2013.30},
  annote =	{Keywords: Computational modelling of narratives, Educational content, Ontologies, Social Network Analytics}
}
Document
DOI: 10.4230/OASIcs.CMN.2013.36
The Disappearance of Moral Choice in Serially Reproduced Narratives

Authors: Fritz Breithaupt, Kevin M. Gardner, John K. Kruschke, Torrin M. Liddell, and Samuel Zorowitz

Published in: OASIcs, Volume 32, 2013 Workshop on Computational Models of Narrative

Abstract
How do narratives influence moral decision-making? Our ongoing studies use serial reproduction of narratives, that is multiple retellings as in the telephone game, of morally ambiguous situations. In particular, we tested stories that include a minor misdemeanor, but leave open whether the wrongdoer will be punished by a bystander. It turns out that serial reproduction (retelling) of stories tends to eliminate the possibility of intervention by the bystander under certain conditions. We reason that this effect can be explained either by preferences of the readers or by the reader's discomfort to get involved. A second finding is that retellings of third-person narratives of moral situations lead to a higher degree of change and invention of the outcome than first-person narratives.
Cite as

Fritz Breithaupt, Kevin M. Gardner, John K. Kruschke, Torrin M. Liddell, and Samuel Zorowitz. The Disappearance of Moral Choice in Serially Reproduced Narratives. In 2013 Workshop on Computational Models of Narrative. Open Access Series in Informatics (OASIcs), Volume 32, pp. 36-42, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@InProceedings{breithaupt_et_al:OASIcs.CMN.2013.36,
  author =	{Breithaupt, Fritz and Gardner, Kevin M. and Kruschke, John K. and Liddell, Torrin M. and Zorowitz, Samuel},
  title =	{{The Disappearance of Moral Choice in Serially Reproduced Narratives}},
  booktitle =	{2013 Workshop on Computational Models of Narrative},
  pages =	{36--42},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-57-6},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{32},
  editor =	{Finlayson, Mark A. and Fisseni, Bernhard and L\"{o}we, Benedikt and Meister, Jan Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.CMN.2013.36},
  URN =		{urn:nbn:de:0030-drops-41386},
  doi =		{10.4230/OASIcs.CMN.2013.36},
  annote =	{Keywords: Narrative, moral stories, side taking, serial reproduction, first-person versus third person narrative}
}
  • Refine by Author
  • 5 Fisseni, Bernhard
  • 4 Löwe, Benedikt
  • 2 Finlayson, Mark A.
  • 2 Meister, Jan Christoph
  • 1 Adornetti, Ines
  • Show More...

  • Refine by Classification
  • 1 Theory of computation → Formal languages and automata theory
  • 1 Theory of computation → Transducers

  • Refine by Keyword
  • 5 Narrative
  • 2 Human computer interaction
  • 2 Narrative Generation
  • 2 Narratives and story generation
  • 2 Natural language interfaces
  • Show More...

  • Refine by Type
  • 38 document

  • Refine by Publication Year
  • 32 2013
  • 2 2014
  • 1 2015
  • 1 2017
  • 1 2019
  • Show More...

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