Stefan Rümmele
Título
Citado por
Citado por
Año
An extension-based approach to belief revision in abstract argumentation
M Diller, A Haret, T Linsbichler, S Rümmele, S Woltran
International Journal of Approximate Reasoning 93, 395-423, 2018
552018
Backdoors to abduction
A Pfandler, S Rümmele, S Szeider
Twenty-Third International Joint Conference on Artificial Intelligence, 2013
352013
Tractable answer-set programming with weight constraints: Bounded treewidth is not enough
R Pichler, S Rümmele, S Szeider, S Woltran
Theory and Practice of Logic Programming 14 (2), 141-164, 2014
192014
Counting and enumeration problems with bounded treewidth
R Pichler, S Rümmele, S Woltran
International Conference on Logic for Programming Artificial Intelligence …, 2010
182010
The parameterized complexity of abduction
MR Fellows, A Pfandler, FA Rosamond, S Rümmele
Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012
152012
Fast counting with bounded treewidth
M Jakl, R Pichler, S Rümmele, S Woltran
International Conference on Logic for Programming Artificial Intelligence …, 2008
152008
A dynamic-programming based ASP-solver
M Morak, R Pichler, S Rümmele, S Woltran
European Workshop on Logics in Artificial Intelligence, 369-372, 2010
142010
Merging in the Horn fragment
A Haret, S Rümmele, S Woltran
ACM Transactions on Computational Logic (TOCL) 18 (1), 1-32, 2017
122017
Evaluating tree-decomposition based algorithms for answer set programming
M Morak, N Musliu, R Pichler, S Rümmele, S Woltran
International Conference on Learning and Intelligent Optimization, 130-144, 2012
112012
Multicut algorithms via tree decompositions
R Pichler, S Rümmele, S Woltran
International Conference on Algorithms and Complexity, 167-179, 2010
102010
Belief merging within fragments of propositional logic
N Creignou, O Papini, S Rümmele, S Woltran
ACM Transactions on Computational Logic (TOCL) 17 (3), 1-28, 2016
92016
Belief revision with bounded treewidth
R Pichler, S Rümmele, S Woltran
International Conference on Logic Programming and Nonmonotonic Reasoning …, 2009
92009
Turbocharging treewidth heuristics
S Gaspers, J Gudmundsson, M Jones, J Mestre, S Rümmele
Algorithmica 81 (2), 439-475, 2019
82019
Multicut on graphs of bounded clique-width
M Lackner, R Pichler, S Rümmele, S Woltran
International Conference on Combinatorial Optimization and Applications, 115-126, 2012
82012
Benchmarking database systems for graph pattern matching
N Pobiedina, S Rümmele, S Skritek, H Werthner
International Conference on Database and Expert Systems Applications, 226-241, 2014
62014
The parameterized complexity of positional games
É Bonnet, S Gaspers, A Lambilliotte, S Rümmele, A Saffidine
arXiv preprint arXiv:1704.08536, 2017
52017
A New Tree-Decomposition Based Algorithm for Answer Set Programming.
M Morak, N Musliu, R Pichler, S Rümmele, S Woltran
ICTAI 11, 916-918, 2011
52011
On the parameterized complexity of belief revision
A Pfandler, S Rümmele, JP Wallner, S Woltran
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
32015
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements
S Gaspers, J Gudmundsson, J Mestre, S Rümmele
arXiv preprint arXiv:1709.10285, 2017
12017
Minesweeper with Limited Moves
S Gaspers, S Rümmele, A Saffidine, K Tran
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20