892 search results - page 34 / 179 » Strategies in sentential reasoning |
CADE
1992
Springer
14 years 17 days ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
LPAR
1994
Springer
14 years 17 days ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...
LOPSTR
2004
Springer
14 years 1 months ago
2004
Springer
We address the problem of an efficient rewriting strategy for general term rewriting systems. Several strategies have been proposed over the last two decades for rewriting, the mos...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
We show how theorem proving and methods for handling real algebraic constraints can be combined for hybrid system verification. In particular, we highlight the interaction of deduc...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...