Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving


Project Acronym Projekt Kurzbezeichnung
D-Flat
 
Project Title (de) Projekttitel (de)
Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving
 
Project Title (en) Projekttitel (en)
Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving
 
Consortium Coordinator Koordinator des Konsortiums
 
Principal Investigator Projektleiter_in
 
Funder/Funding Agency Fördergeber
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
Grant number Förderkennnummer
P25607-N23
 

Results 1-20 of 37 (Search time: 0.007 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan Computing Secure Sets in Graphs using Answer Set ProgrammingArtikel Article Jun-2020
2Bliem, Bernhard ; Woltran, Stefan Defensive alliances in graphs of bounded treewidthArtikel Article 31-Dec-2018
3Bliem, Bernhard ; Woltran, Stefan Complexity of Secure SetsArtikel Article 2018
4Bliem, Bernhard ; Woltran, Stefan Equivalence between answer-set programs under (partially) fixed inputArtikel Article 2018
5Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard Dynamic Programming on Tree Decompositions with {D-FLAT}Artikel Article 2018
6Morak, Michael ; Bichler, Manuel ; Woltran, Stefan lpopt: A Rule Optimization Tool for Answer Set ProgrammingKonferenzbeitrag Inproceedings 2017
7Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan The Impact of Treewidth on ASP Grounding and SolvingKonferenzbeitrag Inproceedings 2017
8Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and BeyondKonferenzbeitrag Inproceedings 2017
9Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan Implementing Courcelle's Theorem in a declarative framework for dynamic programmingArtikel Article 2017
10Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine LearningArtikel Article 2017
11Bliem, Bernhard ; Woltran, Stefan Equivalence Between Answer-Set Programs Under (Partially) Fixed InputKonferenzbeitrag Inproceedings 2016
12Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan ASP for Anytime Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
13Bliem, Bernhard ; Hecher, Markus ; Woltran, Stefan On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
14Bliem, Bernhard ; Woltran, Stefan Complexity of Secure SetsKonferenzbeitrag Inproceedings 2016
15Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan Subset Minimization in Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
16Bichler, Manuel ; Morak, Michael ; Woltran, Stefan lpopt: A Rule Optimization Tool for Answer Set ProgrammingKonferenzbeitrag Inproceedings 2016
17BICHLER, MANUEL ; MORAK, MICHAEL ; WOLTRAN, STEFAN The Power of Non-Ground Rules in Answer Set ProgrammingArtikel Article 2016
18Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made EasyArtikel Article 2016
19Abseher, Michael ; Gebser, Martin ; Musliu, Nysret ; Schaub, Torsten ; Woltran, Stefan Shift Design with Answer Set ProgrammingArtikel Article 2016
20Charwat, Günther ; Woltran, Stefan Dynamic Programming-based QBF SolvingKonferenzbeitrag Inproceedings 2016