BibTeX Export for Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming

Copy to Clipboard Download

@InProceedings{trinh_et_al:LIPIcs.CP.2023.35,
  author =	{Trinh, Van-Giang and Benhamou, Belaid and Soliman, Sylvain},
  title =	{{Efficient Enumeration of Fixed Points in Complex Boolean Networks Using Answer Set Programming}},
  booktitle =	{29th International Conference on Principles and Practice of Constraint Programming (CP 2023)},
  pages =	{35:1--35:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-300-3},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{280},
  editor =	{Yap, Roland H. C.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2023.35},
  URN =		{urn:nbn:de:0030-drops-190720},
  doi =		{10.4230/LIPIcs.CP.2023.35},
  annote =	{Keywords: Computational systems biology, Boolean network, Fixed point, Answer set programming}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode