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:  alliances in graphs

Results 1-2 of 2 (Search time: 0.002 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Bliem, Bernhard ; Woltran, Stefan Defensive alliances in graphs of bounded treewidthArtikel Article 31-Dec-2018
2Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan Computing Secure Sets in Graphs using Answer Set Programming.Konferenzbeitrag Inproceedings 2014