Search Results for author:
Found 7 papers, 0 papers with code
Computational Short Cuts in Infinite Domain Constraint Satisfaction
We show that this kind of infinite-domain backdoors have many of the positive computational properties that finite-domain backdoors have: the associated computational problems are fixed-parameter tractable whenever the underlying constraint language is finite.
Solving Infinite-Domain CSPs Using the Patchwork Property
Additionally, our approach is not restricted to binary constraints, so it is applicable to a strictly larger class of problems than that of Huang et al.
On the Complexity of CCG Parsing
We study the parsing complexity of Combinatory Categorial Grammar (CCG) in the formalism of Vijay-Shanker and Weir (1994).
Parsing to Noncrossing Dependency Graphs
We study the generalization of maximum spanning tree dependency parsing to maximum acyclic subgraphs.
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
We approach the same problem from the perspective of standard complexity classes, and prove that planning is NP-hard for classes with unbounded components under an additional restriction we refer to as SP-closed.
Algorithms and Limits for Compact Plan Representations
In addition to this, we show that our results have consequences for what can be gained from reformulating planning into some other problem.
A Complete Parameterized Complexity Analysis of Bounded Planning
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions.
