The following pages link to Reinhard Pichler (Q167065):
Displaying 50 items.
- Relaxed notions of schema mapping equivalence revisited (Q359884) (← links)
- Belief revision within fragments of propositional logic (Q386044) (← links)
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- Fuzzy data exchange (Q679813) (← links)
- Complexity of counting the optimal solutions (Q837174) (← links)
- On the parameterized intractability of motif search problems (Q858110) (← links)
- Counting complexity of propositional abduction (Q988576) (← links)
- On the complexity of equational problems in CNF (Q1404988) (← links)
- Limits of schema mappings (Q1650918) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- On the knowledge complexity of \(\mathcal N\mathcal P\) (Q1848028) (← links)
- Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- Fast and parallel decomposition of constraint satisfaction problems (Q2079275) (← links)
- The HyperTrac project: recent progress and future research directions on hypergraph decompositions (Q2110383) (← links)
- Towards practical feasibility of core computation in data exchange (Q2268853) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- A complexity theory for hard enumeration problems (Q2274092) (← links)
- (Q2723900) (← links)
- Similarity search in high-dimensional vector spaces (Thesis, ETH Zürich 2000) (Q2739548) (← links)
- (Q2754181) (← links)
- The Challenge of Optional Matching in SPARQL (Q2807080) (← links)
- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem (Q2867070) (← links)
- Monadic datalog over finite structures of bounded treewidth (Q2946620) (← links)
- (Q2999223) (← links)
- Counting and Enumeration Problems with Bounded Treewidth (Q3066110) (← links)
- Implementing Courcelle's Theorem in a declarative framework for dynamic programming (Q3133156) (← links)
- Multicut on Graphs of Bounded Clique-Width (Q3167354) (← links)
- Complexity of Counting the Optimal Solutions (Q3511323) (← links)
- Counting Complexity of Minimal Cardinality and Minimal Weight Abduction (Q3532468) (← links)
- Model Representation over Finite and Infinite Signatures (Q3533129) (← links)
- The complexity of XPath query evaluation and XML typing (Q3546299) (← links)
- Multicut Algorithms via Tree Decompositions (Q3563001) (← links)
- Foundations of Rule-Based Query Answering (Q3603501) (← links)
- Belief Revision with Bounded Treewidth (Q3643123) (← links)
- (Q4246970) (← links)
- (Q4263159) (← links)
- (Q4263808) (← links)
- (Q4503912) (← links)
- (Q4503913) (← links)
- (Q4535802) (← links)
- (Q4553280) (← links)
- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width (Q4651468) (← links)
- (Q4809059) (← links)
- A Dynamic-Programming Based ASP-Solver (Q4930781) (← links)
- Complexity Analysis of Generalized and Fractional Hypertree Decompositions (Q5056426) (← links)
- (Q5089208) (← links)
- Datalog: Bag Semantics via Set Semantics (Q5091129) (← links)
- HyperBench (Q5102056) (← links)
