![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Markus Triska
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Björn Lellmann
, Philipp Marek, Markus Triska:
Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description). FLOPS 2024: 151-164 - [i6]David C. Norris, Markus Triska:
An Executable Specification of Oncology Dose-Escalation Protocols with Prolog. CoRR abs/2402.08334 (2024) - [i5]Björn Lellmann, Philipp Marek, Markus Triska:
Grants4Companies: Applying Declarative Methods for Recommending and Reasoning About Business Grants in the Austrian Public Administration (System Description). CoRR abs/2406.15293 (2024)
2010 – 2019
- 2018
- [j5]Markus Triska:
Boolean constraints in SWI-Prolog: A comprehensive system description. Sci. Comput. Program. 164: 98-115 (2018) - 2016
- [c6]Markus Triska:
The Boolean Constraint Solver of SWI-Prolog (System Description). FLOPS 2016: 45-61 - 2014
- [j4]Tom Schrijvers
, Bart Demoen, Markus Triska, Benoit Desouter:
Tor: Modular search with hookable disjunction. Sci. Comput. Program. 84: 101-120 (2014) - 2012
- [j3]Markus Triska, Nysret Musliu
:
An effective greedy heuristic for the Social Golfer Problem. Ann. Oper. Res. 194(1): 413-425 (2012) - [j2]Markus Triska, Nysret Musliu
:
An improved SAT formulation for the social golfer problem. Ann. Oper. Res. 194(1): 427-438 (2012) - [j1]Jan Wielemaker
, Tom Schrijvers
, Markus Triska, Torbjörn Lager:
SWI-Prolog. Theory Pract. Log. Program. 12(1-2): 67-96 (2012) - [c5]Markus Triska:
The Finite Domain Constraint Solver of SWI-Prolog. FLOPS 2012: 307-316 - [c4]Tom Schrijvers
, Markus Triska, Bart Demoen:
Tor: extensible search with hookable disjunction. PPDP 2012: 103-114 - 2011
- [i4]Markus Triska:
Domain-specific Languages in a Finite Domain Constraint Programming System. CoRR abs/1108.6007 (2011) - 2010
- [i3]Jan Wielemaker, Tom Schrijvers, Markus Triska, Torbjörn Lager:
SWI-Prolog. CoRR abs/1011.5332 (2010)
2000 – 2009
- 2009
- [i2]Markus Triska, Ulrich Neumerkel, Jan Wielemaker:
Better Termination for Prolog with Constraints. CoRR abs/0903.2168 (2009) - [i1]Adrian Prantl, Jens Knoop, Markus Schordan, Markus Triska:
Constraint solving for high-level WCET analysis. CoRR abs/0903.2251 (2009) - 2008
- [c3]Ulrich Neumerkel, Markus Triska, Jan Wielemaker
:
Declarative language extensions for prolog courses. FDPE@ICFP 2008: 73-78 - [c2]Markus Triska:
Generalising Constraint Solving over Finite Domains. ICLP 2008: 820-821 - 2006
- [c1]Stefan Kral, Markus Triska, Christoph W. Ueberhuber:
Compiler Technology for Blue Gene Systems. Euro-Par 2006: 279-288
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint