Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Max Ostrowski"'
Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e584eae42fbcb036bf3f4689d329c9b5
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41241
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41241
Publikováno v:
Logic Programming and Nonmonotonic Reasoning ISBN: 9783030205270
LPNMR
LPNMR
We present an ASP-based solution to real-world train scheduling problems, involving routing, scheduling, and optimization. To this end, we pursue a hybrid approach that extends ASP withdifference constraints to account for a fine-grained timing. More
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fec71746f8e910bec5e26e442b61645b
https://doi.org/10.1007/978-3-030-20528-7_1
https://doi.org/10.1007/978-3-030-20528-7_1
Autor:
Gerhard Brewka, Javier Romero, Philipp Obermeier, Max Ostrowski, Gabriele Kern-Isberner, Torsten Schaub, Steffen Schieweck, Stefan Ellmauthaler
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::273dd8379548181a42225942bc4df137
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/52389
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/52389
We present the third generation of the constraint answer set system clingcon, combining Answer Set Programming (ASP) with finite domain constraint processing (CP). While its predecessors rely on a black-box approach to hybrid solving by integrating t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7023a12580085788c00590e138a3f0e2
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/46556
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/46556
Autor:
Roland Kaminski, Martin Gebser, Torsten Schaub, Javier Romero, Max Ostrowski, Philipp Obermeier, Sebastian Schellhorn, Patrick Lühne, Benjamin Kaufmann, Philipp Wanko
Publikováno v:
KI - Künstliche Intelligenz. 32:181-182
The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Co
Publikováno v:
BioSystems
BioSystems, 2016, ⟨10.1016/j.biosystems.2016.07.009⟩
BioSystems, Elsevier, 2016, ⟨10.1016/j.biosystems.2016.07.009⟩
BioSystems, 2016, ⟨10.1016/j.biosystems.2016.07.009⟩
BioSystems, Elsevier, 2016, ⟨10.1016/j.biosystems.2016.07.009⟩
Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logic models can be learned from a prior knowledge network structure and multiplex phosphoproteomics data. However, most eff
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b6041476f23f6d86040876430317a6d2
https://hal.science/hal-01354075/document
https://hal.science/hal-01354075/document
Autor:
Max Ostrowski, Torsten Schaub
Publikováno v:
Theory and Practice of Logic Programming. 12:485-503
We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Progra
Autor:
Martin Gebser, Benjamin Kaufmann, Marius Schneider, Torsten Schaub, Max Ostrowski, Roland Kaminski
Publikováno v:
AI Communications. 24:107-124
This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.
Autor:
Torsten Schaub, Andrea Peano, Martin Gebser, Max Ostrowski, Naoyuki Tamura, Katsumi Inoue, Mutsunori Banbara, Matthias Weise, Takehide Soh
Publikováno v:
Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15)
Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. pp.112-126, ⟨10.1007/978-3-319-23264-5_10⟩
Logic Programming and Nonmonotonic Reasoning ISBN: 9783319232638
LPNMR
Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'15), Sep 2015, Lexington, United States. pp.112-126, ⟨10.1007/978-3-319-23264-5_10⟩
Logic Programming and Nonmonotonic Reasoning ISBN: 9783319232638
LPNMR
International audience; Encoding finite linear CSPs as Boolean formulas and solving them byusing modern SAT solvers has proven to be highly effective by the award-winningsugar system. We here develop an alternative approach based on ASP that servestw
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::74c0cd7b173f18210a95bbe8881a3fdc
https://inria.hal.science/hal-01186996
https://inria.hal.science/hal-01186996
Publikováno v:
CMSB 2015-13th conference on Computational Methods for Systems Biology
CMSB 2015-13th conference on Computational Methods for Systems Biology, Sep 2015, Nantes, France. pp.170-181, ⟨10.1007/978-3-319-23401-4_15⟩
Computational Methods in Systems Biology ISBN: 9783319234007
CMSB
CMSB 2015-13th conference on Computational Methods for Systems Biology, Sep 2015, Nantes, France. pp.170-181, ⟨10.1007/978-3-319-23401-4_15⟩
Computational Methods in Systems Biology ISBN: 9783319234007
CMSB
International audience; Boolean networks (and more general logic models) are useful frameworks to study signal transduction across multiple pathways. Logical models can be learned from a prior knowledge network structure and multiplex phosphoproteomi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4465df93b226709cc9296967d9dca34d
https://hal.science/hal-01164751/document
https://hal.science/hal-01164751/document