Search Results

Documents authored by Moore, J Strother

Found 3 Possible Name Variants:

Moore, J Strother

Document
DOI: 10.4230/DagRep.2.7.1
AI meets Formal Software Development (Dagstuhl Seminar 12271)

Authors: Alan Bundy, Dieter Hutter, Cliff B. Jones, and J Strother Moore

Published in: Dagstuhl Reports, Volume 2, Issue 7 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12271 ``AI meets Formal Software Development''. This seminar brought together researchers from formal methods and AI. The participants addressed the issue of how AI can aid the formal software development process, including modelling and proof. There was a pleasing number of participants from industry and this made it possible to ground the discussions on industrial-scale problems.
Cite as

Alan Bundy, Dieter Hutter, Cliff B. Jones, and J Strother Moore. AI meets Formal Software Development (Dagstuhl Seminar 12271). In Dagstuhl Reports, Volume 2, Issue 7, pp. 1-29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Article{bundy_et_al:DagRep.2.7.1,
  author =	{Bundy, Alan and Hutter, Dieter and Jones, Cliff B. and Moore, J Strother},
  title =	{{AI meets Formal Software Development (Dagstuhl Seminar 12271)}},
  pages =	{1--29},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{2},
  number =	{7},
  editor =	{Bundy, Alan and Hutter, Dieter and Jones, Cliff B. and Moore, J Strother},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.2.7.1},
  URN =		{urn:nbn:de:0030-drops-37318},
  doi =		{10.4230/DagRep.2.7.1},
  annote =	{Keywords: Learning of proof processes and strategies, Theory development, Formal software development, Automated reasoning, Formal modelling, Industrial use of formal methods}
}

Moore, Johanna

Document
DOI: 10.4230/DagSemRep.93
Principles of Natural Language Generation (Dagstuhl Seminar 9430)

Authors: Wolfgang Hoeppner, Helmut Horacek, and Johanna Moore

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Wolfgang Hoeppner, Helmut Horacek, and Johanna Moore. Principles of Natural Language Generation (Dagstuhl Seminar 9430). Dagstuhl Seminar Report 93, pp. 1-62, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1995)

Copy BibTex To Clipboard

@TechReport{hoeppner_et_al:DagSemRep.93,
  author =	{Hoeppner, Wolfgang and Horacek, Helmut and Moore, Johanna},
  title =	{{Principles of Natural Language Generation (Dagstuhl Seminar 9430)}},
  pages =	{1--62},
  ISSN =	{1619-0203},
  year =	{1995},
  type = 	{Dagstuhl Seminar Report},
  number =	{93},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.93},
  URN =		{urn:nbn:de:0030-drops-149811},
  doi =		{10.4230/DagSemRep.93},
}

Moore, Benjamin

Document
DOI: 10.4230/LIPIcs.MFCS.2018.75
Reconfiguration of Graph Minors

Authors: Benjamin Moore, Naomi Nishimura, and Vijay Subramanya

Published in: LIPIcs, Volume 117, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)

Abstract
Under the reconfiguration framework, we consider the various ways that a target graph H is a minor of a host graph G, where a subgraph of G can be transformed into H by means of edge contraction (replacement of both endpoints of an edge by a new vertex adjacent to any vertex adjacent to either endpoint). Equivalently, an H-model of G is a labeling of the vertices of G with the vertices of H, where the contraction of all edges between identically-labeled vertices results in a graph containing representations of all edges in H. We explore the properties of G and H that result in a connected reconfiguration graph, in which nodes represent H-models and two nodes are adjacent if their corresponding H-models differ by the label of a single vertex of G. Various operations on G or H are shown to preserve connectivity. In addition, we demonstrate properties of graphs G that result in connectivity for the target graphs K_2, K_3, and K_4, including a full characterization of graphs G that result in connectivity for K_2-models, as well as the relationship between connectivity of G and other H-models.
Cite as

Benjamin Moore, Naomi Nishimura, and Vijay Subramanya. Reconfiguration of Graph Minors. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 75:1-75:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{moore_et_al:LIPIcs.MFCS.2018.75,
  author =	{Moore, Benjamin and Nishimura, Naomi and Subramanya, Vijay},
  title =	{{Reconfiguration of Graph Minors}},
  booktitle =	{43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
  pages =	{75:1--75:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-086-6},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{117},
  editor =	{Potapov, Igor and Spirakis, Paul and Worrell, James},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.75},
  URN =		{urn:nbn:de:0030-drops-96573},
  doi =		{10.4230/LIPIcs.MFCS.2018.75},
  annote =	{Keywords: reconfiguration, graph minors, graph algorithms}
}
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