Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Ostrowski, Max"'
Publikováno v:
Theory and Practice of Logic Programming 21 (2021) 317-347
We present a solution to real-world train scheduling problems, involving routing, scheduling, and optimization, based on Answer Set Programming (ASP). To this end, we pursue a hybrid approach that extends ASP with difference constraints to account fo
Externí odkaz:
http://arxiv.org/abs/2003.08598
Autor:
Janhunen, Tomi, Kaminski, Roland, Ostrowski, Max, Schaub, Torsten, Schellhorn, Sebastian, Wanko, Philipp
The recent series 5 of the ASP system clingo provides generic means to enhance basic Answer Set Programming (ASP) with theory reasoning capabilities. We instantiate this framework with different forms of linear constraints, discuss the respective imp
Externí odkaz:
http://arxiv.org/abs/1707.04053
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:
http://arxiv.org/abs/1705.04569
Autor:
Ostrowski, Max, Schaub, Torsten
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
Externí odkaz:
http://arxiv.org/abs/1210.2287
Publikováno v:
Theory and Practice of Logic Programming, 27th Int'l. Conference on Logic Programming (ICLP'11) Special Issue, volume 11, issue 4-5, pages 749-766, 2011
Building biological models by inferring functional dependencies from experimental data is an im- portant issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase th
Externí odkaz:
http://arxiv.org/abs/1107.5671
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______266::4f08353f37cfea8033ba894768f6a8a0
https://publishup.uni-potsdam.de/files/41390/pmnr579.pdf
https://publishup.uni-potsdam.de/files/41390/pmnr579.pdf
Autor:
Ostrowski, Max (Dr.)
Answer Set Programming (ASP) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance solving capabilities. Although this has already resulted in various applications, certain aspects of such appl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______266::ac6c117971d1697e3a4559c7011b526f
https://publishup.uni-potsdam.de/files/40779/ostrowski_diss.pdf
https://publishup.uni-potsdam.de/files/40779/ostrowski_diss.pdf
Autor:
Gebser, Martin, Kaminski, Roland, Kaufmann, Benjamin, Ostrowski, Max, Schaub, Torsten, Wanko, Philipp
Answer Set Programming (ASP) is a model, ground, and solve paradigm. The integration of application- or theory-specific reasoning into ASP systems thus impacts on many if not all elements of its workflow, viz. input language, grounding, intermediate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::141b963942d4d795bc3e70c0f6dbc422
Autor:
Banbara, Mutsunori, Gebser, Martin, Inoue, Katsumi, Ostrowski, Max, Peano, Andrea, Schaub, Torsten, Soh, Takehide, Tamura, Naoyuki, Weise, Matthias
Publikováno v:
Computer Safety, Reliability & Security: 34th International Conference, SAFECOMP 2015 Delft, The Netherlands, September 23-25, 2015. Proceedings; 2015, p112-126, 15p
