30 search results - page 6 / 6 » Extensions of Constraint Solving for Proof Planning |
ISER
1995
Springer
13 years 8 months ago
1995
Springer
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...
AAAI
2008
13 years 6 months ago
2008
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
INFOCOM
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract—This paper solves the joint power control and SIR assignment problem through distributed algorithms in the uplink of multi-cellular wireless networks. The 1993 Foschini-...
COLING
1996
13 years 6 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
JSC
2010
12 years 11 months ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...