Skip to main content
University of Oxford Department of Computer Science
Search for
Search
Toggle
Main Menu
Home
Study with us
Research
(current)
News
Events
About Us
Student Space
Partner with us
Home
Research
Publications
D−FLAT: Declarative problem solving using tree decompositions and answer−set programming
D−FLAT: Declarative problem solving using tree decompositions and answer−set programming
Bernhard Bliem‚ Michael Morak and Stefan Woltran
Journal
TPLP
Number
4−5
Pages
445–464
Volume
12
Year
2012
Links
BibTeX
Link
DOI
(10.1017/S1471068412000129)
See Also
Michael Morak
Algorithms and Complexity Theory
Artificial Intelligence and Machine Learning
Automated Verification
Computational Biology and Health Informatics
Data, Knowledge and Action
Human Centered Computing
Programming Languages
Quantum
Security
Systems
Back to Top