892 search results - page 34 / 179 » Strategies in sentential reasoning |
103
Voted
CADE
1992
Springer
15 years 5 months 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 ...
137
Voted
LPAR
1994
Springer
15 years 5 months 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...
122
click to vote
LOPSTR
2004
Springer
15 years 7 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...
130
Voted
CADE
2007
Springer
16 years 2 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...
95
Voted
ICRA
2005
IEEE
15 years 7 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...