Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving

View Statistics Email Alert RSS Feed

Primary Data

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
 

Grants

Funder/Funding Agency Fördergeber
FWF Fonds zur Förderung der wissenschaftlichen Forschung (FWF)
Grant number Förderkennnummer
P25607-N23
 

Publications

Filter:
Subject:  Theoretical Computer Science

Results 1-5 of 5 (Search time: 0.002 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
2Abseher, Michael ; Musliu, Nysret ; Woltran, Stefan htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and BeyondKonferenzbeitrag Inproceedings 2017
3Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan Implementing Courcelle's Theorem in a declarative framework for dynamic programmingArtikel Article 2017
4BICHLER, MANUEL ; MORAK, MICHAEL ; WOLTRAN, STEFAN The Power of Non-Ground Rules in Answer Set ProgrammingArtikel Article 2016
5BLIEM, BERNHARD ; MORAK, MICHAEL ; WOLTRAN, STEFAN D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set ProgrammingArtikel Article2012