225
Voted
CSL
16 years 10 days ago
2001 Springer 
Hyper tableau reasoning is a version of clausal form tableau reasoning where all negative literals in a clause are resolved away in a single inference step. Constrained hyper table...
206
click to vote
CSL
16 years 10 days ago
2001 Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
236
Voted
CSL
16 years 10 days ago
2001 Springer 
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
220
Voted
CSL
16 years 10 days ago
2001 Springer
In this paper, we introduce decidable multimodal logics to describe and reason about navigation across object structures. The starting point of these navigation logics is the model...
|
Automated Reasoning