233 search results - page 13 / 47 » Intelligent compilers |
ISMIS
2005
Springer
15 years 3 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...
AAAI
2006
14 years 11 months ago
2006
Even under polynomial restrictions on plan length, conformant planning remains a very hard computational problem as plan verification itself can take exponential time. This heavy ...
110
click to vote
AAAI
1990
14 years 10 months ago
1990
Qualitative reasoning can, and should, be decomposed into a model-building task, which creates a qualitative differential equation (QDE) as a model of a physical situation, and a ...
KR
2004
Springer
15 years 3 months ago
2004
Springer
While universal plans tell a system how to reach a goal regardless of what state it is in, such plans can be too large to represent. Hybrid systems execute plans where each action...
TABLEAUX
2009
Springer
15 years 2 months ago
2009
Springer
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...