Skip to Content

TU Wien Fakultät für Informatik DBAI Database and Artificial Intelligence Group
Top-level Navigation: Current-level Navigation:

Path: DBAI > Research > Projects > FAIR

Tools: Print

Project: FAIR - Fixed-Parameter Tractability in Artificial Intelligence and Reasoning

(funded by the Austrian Science Fund (FWF) under grant P25518)

Contents

Duration

The project has officially started on 2013-05-01 and had a duration of five years. The project finished on 2018-04-30. Top

Project team

Project leader

Project staff

Project partners

Top

Goal of the Project

Reasoning is a fundamental task in Computer Science. It is concerned with the derivation of conclusions from some data or knowledge base. It has many interesting applications - especially in Artificial Intelligence - such as answer-set programming, reasoning on the web with description logics, belief revision, argumentation, diagnosis, etc. These areas have received vivid research interest in recent years. Strong theoretical foundations have been laid and algorithms have been presented which, at least in theory, solve the most common computational tasks in these areas. However, in practice, it has turned out that the high inherent complexity of most of these tasks is a severe obstacle to the application of these algorithms to problem instances of realistic size. To this date, the high computational complexity of reasoning tasks has not been satisfactorily solved.

Over the past decade, Parameterized Complexity Theory has evolved as a promising way of dealing with high complexity. The primary goal of a parameterized complexity analysis for some hard problem is to identify so-called fixed-parameter tractable fragments, i.e., to identify problem parameters that allow for the efficient solution of intractable problems in case these parameters are small. The tools of Parameterized Complexity Theory have been successfully applied to many areas of Computer Science - above all to hard problems in Graph Theory. However, the application of these techniques to hard reasoning problems is still in its infancy.

In this project, we want to extend the successful application of parameterized complexity techniques to the area of Artificial Intelligence and Reasoning. In the first place, we will thus initiate a systematic exploration of possible problem parameters and analyze their potential in finding tractable fragments of otherwise intractable reasoning problems. We will then harness the results of the Parameterized Complexity study to develop new efficient algorithms for fragments of hard reasoning problems and to identify directions for the improvement of existing solution methods for these problems.

Top

Publications

2013

[1]
 Conjunctive Regular Path Queries in Lightweight Description Logics.
M. Bienvenu, M. Ortiz, M. Simkus.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 761-767. [ pdf ]
[2]
 Tractability Guarantees for DL-Lite Query Answering.
M. Bienvenu, M. Ortiz, M. Simkus, G. Xiao.
In Proceedings of the 26th International Workshop on Description Logics (DL 2013); CEUR Workshop Proceedings 1014, CEUR-WS.org; p. 41-52. [ pdf ]
[3]
 Tractability Guarantees for DL-Lite Query Answering.
M. Bienvenu, M. Ortiz, M. Simkus, G. Xiao.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 768-774. [ pdf ]
[4]
 Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.
B. Bliem, R. Pichler, S. Woltran.
In Proceedings of Parameterized and Exact Computation - 8th International Symposium (IPEC 2013); Springer LNCS 8246; p. 28-40. [ pdf ]
[5]
 Abstract Dialectical Frameworks Revisited.
G. Brewka, H. Strass, S. Ellmauthaler, J. Wallner, S. Woltran.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 803-809. [ pdf ]
[6]
 Evolving Graph Databases under Description Logic Constraints.
D. Calvanese, M. Ortiz, M. Simkus.
In Proceedings of the 26th International Workshop on Description Logics (DL 2013); CEUR Workshop Proceedings 1014, CEUR-WS.org; p. 120-131. [ pdf ]
[7]
 Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment?
N. Creignou, R. Pichler, S. Woltran.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 824-831. [ pdf ]
[8]
 Model-based recasting in answer-set programming.
T. Eiter, M. Fink, J. Puuml;hrer, H. Tompits, S. Woltran.
In Journal of Applied Non-Classical Logics 23(1-2): 75-104 (2013). [ pdf ]
[9]
 Computational Aspects of Nearly Single-Peaked Electorates.
G. Erdélyi, M. Lackner, A. Pfandler.
In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2013); AAAI Press. [ pdf ]
[10]
 Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines.
P. Kaufmann, M. Kronegger, A. Pfandler, M. Seidl, M. Widl.
In Proceedings of the 10th International Workshop on Model Driven Engineering, Verification and Validation (MoDeVVa 2013), CEUR Workshop Proceedings 1069, CEUR-WS.org; p. 31-40. [ pdf ]
[11]
 Parameterized Complexity of Optimal Planning: A Detailed Map.
M. Kronegger, A. Pfandler, R. Pichler.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 954-961. [ pdf ]
[12]
 Backdoors to Abduction.
A. Pfandler, S. Rümmele, S. Szeider.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013); IJCAI/AAAI; p. 1046-1052. [ pdf ]

2014

[13]
 The D-FLAT System for Dynamic Programming on Tree Decompositions.
M. Abseher, B. Bliem, G. Charwat, F. Dusberger, M. Hecher, S. Woltran.
In Proceedings of Logics in Artificial Intelligence - 14th European Conference (JELIA 2014); Springer LNCS 8761; p. 558—572. [ pdf ]
[14]
 Managing Change in Graph-Structured Data Using Description Logics.
S. Ahmetaj, D. Calvanese, M. Ortiz, M. Simkus.
In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press. [ pdf ]
[15]
 Planning and Change in Graph Structured Data under Description Logics Constraints.
S. Ahmetaj, D. Calvanese, M. Ortiz, M. Simkus.
In Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management (AMW 2014); CEUR Workshop Proceedings 1189; CEUR-WS.org. [ pdf ]
[16]
 Planning Problems for Graph Structured Data in Description Logic.
S. Ahmetaj, D. Calvanese, M. Ortiz, M. Simkus.
In Proceedings of the 27th International Workshop on Description Logics (DL 2014); CEUR Workshop Proceedings 1193; CEUR-WS.org. [ pdf ]
[17]
 Compact Argumentation Frameworks.
R. Baumann, W. Dvorak, T. Linsbichler, H. Strass, S. Woltran.
In Proceedings of the European Conference on Artificial Intelligence (ECAI 2014); Frontiers in Artificial Intelligence and Applications 163, IOS Press, p. 69-74. [ pdf ]
[18]
 Nested Regular Path Queries in Description Logics.
M. Bienvenu, D. Calvanese, M. Ortiz, M. Simkus.
In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (KR 2014); AAAI Press. [ pdf ]
[19]
 Nested Regular Path Queries in Description Logics.
M. Bienvenu, D. Calvanese, M. Ortiz, M. Simkus.
In Proceedings of the 8th Alberto Mendelzon Workshop on Foundations of Data Management (AMW 2014); CEUR Workshop Proceedings 1189; CEUR-WS.org. [ pdf ]
[20]
 Capturing Relational Schemas and Functional Dependencies in RDFS.
D. Calvanese, W. Fischl, R. Pichler, E. Sallinger, M. Simkus.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press; p. 1003-1011. [ pdf ]
[21]
 Shape and Content: Incorporating Domain Knowledge into Shape Analysis.
D. Calvanese, T. Kotek, M. Simkus, H. Veith, F. Zuleger.
In Proceedings of the 27th International Workshop on Description Logics (DL 2014); CEUR Workshop Proceedings 1193; CEUR-WS.org. [ pdf ]
[22]
 Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures.
D. Calvanese, T. Kotek, M. Simkus, H. Veith, F. Zuleger.
In Proceedings of Integrated Formal Methods - 11th International Conference (IFM 2014); Springer LNCS 8739; p. 3 - 17. [ pdf ]
[23]
 Complexity-sensitive decision procedures for abstract argumentation.
W. Dvorak, M. Jarvisalo, J. Wallner, S. Woltran.
In Artif. Intell. 206: 53-78 (2014). [ pdf ]
[24]
 Conformant Planning as a Case Study of Incremental QBF Solving.
U. Egly, M. Kronegger, F. Lonsing, A. Pfandler.
In Proceedings of Artificial Intelligence and Symbolic Computation - 12th International Conference (AISC 2014); Springer LNCS 8884; p. 120-131. [ pdf ]
[25]
 On Detecting Nearly Structured Preference Profiles.
E. Elkind, M. Lackner.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press; p. 661-667. [ pdf ]
[26]
 Expressiveness of guarded existential rule languages.
G. Gottlob, S. Rudolph, M. Simkus.
In Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2014); ACM; p. 27-38. [ pdf ]
[27]
 A SAT-Based Debugging Tool for State Machines and Sequence Diagrams.
P. Kaufmann, M. Kronegger, A. Pfandler, M. Seidl, M. Widl.
In Proceedings of Software Language Engineering - 7th International Conference (SLE 2014); Springer LNCS 8706; p. 21-40. [ pdf ]
[28]
 Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability.
T. Kotek, M. Simkus, H. Veith, F. Zuleger.
In Proceedings of the 27th International Workshop on Description Logics (DL 2014); CEUR Workshop Proceedings 1193; CEUR-WS.org. [ pdf ]
[29]
 Backdoors to Planning.
M. Kronegger, S. Ordyniak, A. Pfandler.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press; p. 2300-2307. [ pdf ]
[30]
 A Parameterized Complexity Analysis of Generalized CP-Nets.
M. Kronegger, M. Lackner, A. Pfandler, R. Pichler.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press; p. 1091-1097. [ pdf ]
[31]
 Incomplete Preferences in Single-Peaked Electorates.
M. Lackner.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014); AAAI Press; p. 742-748. [ pdf ]
[32]
 Revisiting the Hardness of Query Answering in Expressive Description Logics.
M. Ortiz, M. Simkus.
In Proceedings of Web Reasoning and Rule Systems - 8th International Conference (RR 2014); Springer LNCS 8741; p. 216-223. [ pdf ]
[33]
 Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
R. Pichler, S. Rümmele, S. Szeider, S. Woltran.
In TPLP 14(2): 141-164 (2014). [ pdf ]

2015

[34]
 Towards Reconciling SPARQL and Certain Answers.
S. Ahmetaj, W. Fischl, R. Pichler, M. Simkus, S. Skritek.
In Proceedings of the 24th International Conference on World Wide Web (WWW 2015); ACM; p. 23-33. [ pdf ]
[35]
 Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms.
M. Bienvenu, M. Ortiz, M. Simkus.
In J. Artif. Intell. Res. 53: 315-374 (2015). [ pdf ]
[36]
 Democratix: A Declarative Approach to Winner Determination.
G. Charwat, A. Pfandler.
In Proceedings of Algorithmic Decision Theory - 4th International Conference (ADT 2015); Springer LNCS 9346; p. 253-269. [ pdf ]
[37]
 Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams.
G. Charwat, S. Woltran.
In Proceedings of Logic Programming and Nonmonotonic Reasoning - 13th International Conference (LPNMR 2015); Springer LNCS 9349; p. 213-227. [ pdf ]
[38]
 Fixed-Parameter Tractable Reductions to SAT for Planning.
R. de Haan, M. Kronegger, A. Pfandler.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 2897-2903. [ pdf ]
[39]
 An Extension-Based Approach to Belief Revision in Abstract Argumentation.
M. Diller, A. Haret, T. Linsbichler, S. Rümmele, S. Woltran.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 2926-2932. [ pdf ]
[40]
 Characteristics of multiple viewpoints in abstract argumentation.
P. Dunne, W. Dvorak, T. Linsbichler, S. Woltran.
In Artif. Intell. 228: 153-178 (2015). [ Technical Report ]
[41]
 Complexity-Sensitive Decision Procedures for Abstract Argumentation.
W. Dvorak, M. Jarvisalo, J. Wallner, S. Woltran.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 4173-4177. [ pdf ]
[42]
The Complexity of Recognizing Incomplete Single-Crossing Preferences
E. Elkind, P. Faliszewski, M. Lackner, S. Obraztsova.
In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), AAAI Press; p, 865-871. [ pdf ]
[43]
 Structure in Dichotomous Preferences.
E. Elkind, M. Lackner.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 2019-2025. [ pdf ]
[44]
 Manipulation of k-Approval in Nearly Single-Peaked Electorates.
G. Erdélyi, M. Lackner, A. Pfandler.
In Proceedings of Algorithmic Decision Theory - 4th International Conference (ADT 2015); Springer LNCS 9346; p .71-85. [ pdf ]
[45]
 Dual-normal logic programs - the forgotten class.
J. Fichte, M. Truszczynski, S. Woltran.
In TPLP 15(4-5): 495-510 (2015). [ pdf ]
[46]
 Parameterized Complexity of Asynchronous Border Minimization.
R. Ganian, M. Kronegger, A. Pfandler, A. Popa.
In Proceedings of Theory and Applications of Models of Computation - 12th Annual Conference (TAMC 2015); Springer LNCS 9076; p. 428-440. [ pdf ]
[47]
 Merging in the Horn Fragment.
A. Haret, S. Rümmele, S. Woltran.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 3041-3047. [ pdf ]
[48]
 Intra- and interdiagram consistency checking of behavioral multiview models.
P. Kaufmann, M. Kronegger, A. Pfandler, M. Seidl, M. Widl.
In Computer Languages, Systems & Structures 44: 72-88 (2015). [ pdf ]
[49]
 Extending ALCQIO with Trees.
T. Kotek, M. Simkus, H. Veith, F. Zuleger.
In 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2015); IEEE Computer Society; p. 511-522. [ pdf ]
[50]
 Variable-Deletion Backdoors to Planning.
M. Kronegger, S. Ordyniak, A. Pfandler.
In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015), AAAI Press; p. 3305-3312. [ pdf ]
[51]
 The complexity of handling minimal solutions in logic-based abduction.
A. Pfandler, R. Pichler, S. Woltran.
In J. Log. Comput. 25(3): 805-825 (2015). [ pdf ]
[52]
 Distance-Bounded Consistent Query Answering.
A. Pfandler, E. Sallinger.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 2269-2269. [ pdf ]
[53]
 On the Parameterized Complexity of Belief Revision.
A. Pfandler, S. Rümmele, J. Wallner, S. Woltran.
In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015); AAAI Press; p. 3149-3155. [ pdf ]

2016

[54]
 D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy; Fundam.
B. Bliem, G. Charwat, M. Hecher, S. Woltran.
In Inform. 147(1): 27-61 (2016). [ pdf ]
[55]
 Clique-Width and Directed Width Measures for Answer¬Set Programming.
B. Bliem, S. Ordyniak, S. Woltran.
In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016); Frontiers in Artificial Intelligence and Applications 285; IOS Press; p. 1105-1113. [ pdf ]
[56]
 A Fast Algorithm for Permutation Pattern Matching Based on Alternating Runs.
M. Bruner, M. Lackner.
In Algorithmica 75(1): 84-117 (2016). [ pdf ]
[57]
 Belief Merging within Fragments of Propositional Logic.
N. Creignou, 0. Papini, S. Rümmele, S. Woltran.
In ACM Trans. Comput. Log. 17(3): 20:1-20:28 (2016). [ pdf ]
[58]
 Beyond IC Postulates: Classification Criteria for Merging Operators.
A Haret, A Pfandler, S. Woltran.
In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI 2016); Frontiers in Artificial Intelligence and Applications 285; IOS Press; p. 372-380. [ pdf ]

2017

[59]
 Managing Change in Graph-Structured Data Using Description Logics.
S. Ahmetaj, D. Calvanese, M. Ortiz, M. Simkus.
In ACM Trans. Comput. Log. 18(4): 27:1-27:35 (2017). [ pdf ]
[60]
 Implementing Courcelle's Theorem in a declarative framework for dynamic programming.
B. Bliem, R. Pichler, S. Woltran.
In J. Log. Com put. 27(4), p. 1067-1094 (2017). [ pdf ]
[61]
 On the Complexity of Hard Enumeration Problems.
N. Creignou, M. Kröll, R. Pichler, S. Skritek, H. Vollmer.
In Proceedings of Language and Automata Theory and Applications - 11th International Conference (LATA 2017), Springer LNCS 10168, p. 183-195. [ pdf ]
[62]
 Computational Social Choice in the Clouds.
T. Csar, M. Lackner, R. Pichler, E. Sallinger.
In Datenbanksysteme fuuml;r Business, Technologie und Web (BTW 2017), Workshopband; GI LNI P-266; p. 163-167. [ pdf ]
[63]
 Winner Determination in Huge Elections with MapReduce.
T. Csar, M. Lackner, R. Pichler, E. Sallinger.
In . Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017); AAAI Press p. 451-458. [ pdf ]
[64]
 Conformant Planning as a Case Study of Incremental QBF Solving.
U. Egly, M. Kronegger, F. Lansing, A. Pfandler.
In Ann. Math. Artif. Intell. 80(1): 21-45 (2017). [ pdf ]
[65]
 Computational Aspects of Nearly Single-Peaked Electorates.
G. Erdélyi, M. Lackner, A. Pfandler.
In J. Artif. lntell. Res. 58, p. 297-337 (2017). [ pdf ]
[66]
 Function Symbols in Tuple-Generating Dependencies: Expressive Power and Computability.
G. Gottlob, R. Pichler, E. Sallinger.
In Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW 2017), CEUR Workshop Proceedings 1912, CEUR-WS.org. [ pdf ]
[67]
 Merging in the Horn Fragment.
A. Haret, S. Rümmele, S. Woltran.
In ACM Trans. Comput. Log. 18(1): 6:1-6:32 (2017). [ pdf ]
[68]
 On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks.
M. Kröll, R. Pichler, S. Woltran.
In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence (IJCAI 2017); ijcai.org; p. 19-25. [ pdf ]

2018

[69]
 On the Complexity of Extended and Proportional Justified Representation.
H. Aziz, E. Elkind, S. Huang, M. Lackner, L.Sánchez Fernández, P. Skowron.
In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018); AAAI Press. [ pdf ]
[70]
 Multiwinner Elections With Diversity Constraints.
R. Bredereck, P. Faliszewski, A. Igarashi, M. Lackner, P. Skowron.
In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018); AAAI Press. [ pdf ]
[71]
 Enumeration Complexity of Conjunctive Queries with Functional Dependencies.
N. Carmeli, M. Kröll.
In Proceedings of the 21st International Conference on Database Theory (ICDT 2018);. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik; LIPIcs 98; p.11:1-11:17. [ pdf ]
[72]
 Computing the Schulze Method for Large-Scale Preference Data Sets; Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018); ijcai.
T. Csar, M. Lackner, R. Pichler.
In org; p.180-187. [ pdf ]
[73]
 Effective Heuristics for Committee Scoring Rules.
P. Faliszewski, M. Lackner, D. Peters, N. Talmon.
In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018); AAAI Press. [ pdf ]
[74]
 General and Fractional Hypertree Decompositions: Hard and Easy Cases (Extended Abstract).
W. Fischl, G. Gottlob, R. Pichler.
In Proceedings of the 12th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2018); CEUR Workshop Proceedings 2100, CEUR-WS.org. [ pdf ]
[75]
 General and Fractional Hypertree Decompositions: Hard and Easy Cases.
W. Fischl, G. Gottlob, R. Pichler.
In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2018); ACM; p. 17-32. [ pdf ]
[76]
 Consistent Approval-Based Multi-Winner Rules.
M. Lackner, P. Skowron.
In Proceedings of the 2018 ACM Conference on Economics and Computation (EC 2018); ACM; p. 47-48. [ pdf ]
[77]
 Approval-Based Multi-Winner Rules and Strategic Voting.
M. Lackner, P. Skowron.
In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018); ijcai.org; p.340-346. [ pdf ]
[78]
 Belief Update in the Horn Fragment.
N. Creignou, A. Haret, O. Papini, S. Woltran.
In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018); ijcai.org; p. 1781-1787 [ pdf ]
[79]
 Two Sides of the Same Coin: Belief Revision and Enforcing Arguments.
A. Haret, J.P. Wallner, S. Woltran.
In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018); ijcai.org; p. 1854-1860 [ pdf ]
[80]
Parameterized Complexity of Asynchronous Border Minimization.
R. Ganian, M. Kronegger, A. Pfandler, A. Popa.
In Algorithmica 2018; p. 1-23.
[81]
Backdoors to Planning.
M. Kronegger, S. Ordyniak, A. Pfandler.
In Artificial Intelligence Journal 2018; to appear.
Top
Last updated: 2018-09-11 16:40

Home / Kontakt / Webmaster / Offenlegung gemäß § 25 Mediengesetz: Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. Disclaimer / Datenschutzerklärung