Results 1  10
of
90
Detecting and Exploiting Subproblem Tractability
"... Constraint satisfaction problems may be nearly tractable. For instance, most of the relations in a problem might belong to a tractable language. We introduce a method to take advantage of this fact by computing a backdoor to this tractable language. The method can be applied to many tractable classe ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Constraint satisfaction problems may be nearly tractable. For instance, most of the relations in a problem might belong to a tractable language. We introduce a method to take advantage of this fact by computing a backdoor to this tractable language. The method can be applied to many tractable
Backdoors to Tractable AnswerSet Programming
 PROCEEDINGS OF THE TWENTYSECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
"... We present a unifying approach to the efficient evaluation of propositional answerset programs. Our approach is based on backdoors which are small sets of atoms that represent “clever reasoning shortcuts” through the search space. The concept of backdoors is widely used in the areas of propositiona ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
of propositional satisfiability and constraint satisfaction. We show how this concept can be adapted to the nonmonotonic setting and how it allows to augment various known tractable subproblems, such as the evaluation of Horn and acyclic programs. In order to use backdoors we need to find them first. We utilize
Tractable Monotone Temporal Planning
"... This paper describes a polynomiallysolvable subproblem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each subgoal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monoton ..."
Abstract
 Add to MetaCart
This paper describes a polynomiallysolvable subproblem of temporal planning. Polynomiality follows from two assumptions. Firstly, by supposing that each subgoal fluent can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly
Equivalence and Tractability Results for SAS+ Planning
 Proceedings of the 3rd International Conference on Principles on Knowledge Representation and Reasoning (KR92
, 1992
"... We define the SAS + planning formalism, which generalizes the previously presented SAS formalism. The SAS + formalism is compared with some betterknown propositionalplanning formalisms with respect to expressiveness. Contrary to intuition, all formalisms turn out to be equally expressive in a v ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
very strong sense. We further present the SAS + PUS planning problem which generalizes the previously presented, tractable SASPUS problem. We prove that also the SAS +  PUS problem is tractable by devising a provably correct polynomial time algorithm for this problem. 1 Introduction Much effort
Limited But Tractable Type Inference Against Races
, 2004
"... this report, I describe a limited form of that type system, and its polynomialtime algorithm. Two unproven conjectures are curently required in the proof of correctness of the algorithm. 2 The Language and Type System The language used is shown in Figure 1 and is derivative of RFJ2 used by Flanaga ..."
Abstract
 Add to MetaCart
by Flanagan and Freund.[3] Each class definition is parameterized by a single ghost variable, which can occur in any of the annotations within the class body. In addition to the limitation to a single class paramater, note the removal of method ghost parameters. The first is key to finding a tractable subproblem
Tractable Constraints Closed Under A Binary Operation
 Oxford University
, 2000
"... Many combinatorial search problems can be expressed as instances of the "constraint satisfaction problem" (CSP). This class of problems is known to be NPcomplete in general, so to ensure tractability it is natural to consider restricted subproblems in which the constraints have certain sp ..."
Abstract

Cited by 15 (7 self)
 Add to MetaCart
Many combinatorial search problems can be expressed as instances of the "constraint satisfaction problem" (CSP). This class of problems is known to be NPcomplete in general, so to ensure tractability it is natural to consider restricted subproblems in which the constraints have certain
The Role of Macros in Tractable Planning over Causal Graphs
"... The complexity of existing planners is bounded by the length of the resulting plan, a fact that limits planning to domains with relatively short solutions. We present a novel planning algorithm that uses the causal graph of a domain to decompose it into subproblems and stores subproblem plans in mem ..."
Abstract
 Add to MetaCart
The complexity of existing planners is bounded by the length of the resulting plan, a fact that limits planning to domains with relatively short solutions. We present a novel planning algorithm that uses the causal graph of a domain to decompose it into subproblems and stores subproblem plans
The Role of Macros in Tractable Planning over Causal Graphs
"... The complexity of existing planners is bounded by the length of the resulting plan, a fact that limits planning to domains with relatively short solutions. We present a novel planning algorithm that uses the causal graph of a domain to decompose it into subproblems and stores subproblem plans in mem ..."
Abstract
 Add to MetaCart
The complexity of existing planners is bounded by the length of the resulting plan, a fact that limits planning to domains with relatively short solutions. We present a novel planning algorithm that uses the causal graph of a domain to decompose it into subproblems and stores subproblem plans
Tractable MultiAgent Path Planning on Grid Maps
"... Multiagent path planning on grid maps is a challenging problem and has numerous reallife applications. Running a centralized, systematic search such as A * is complete and costoptimal but scales up poorly in practice, since both the search space and the branching factor grow exponentially in the ..."
Abstract

Cited by 15 (3 self)
 Add to MetaCart
in the number of mobile units. Decentralized approaches, which decompose a problem into several subproblems, can be faster and can work for larger problems. However, existing decentralized methods offer no guarantees with respect to completeness, running time, and solution quality. To address such limitations
The tractability of CSP classes defined by forbidden patterns
 J. Artif. Intell. Res. (JAIR
"... The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NPhard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
known hybrid tractable classes. Although we are not close to obtaining a complete characterisation concerning the tractability of general forbidden patterns, we prove a dichotomy in a special case: classes of problems that arise when we can only forbid binary negative patterns (generic subproblems
Results 1  10
of
90