Norbert Eisinger

Learn More
A s u b s u m p t i o n t e s t b a s e d o n t h e p r i n c i p a l i d e a o f K o w a l s k i ' s c o n n e c t i o n g r a p h p r o o f p r o c e d u r e i s d e v e l o p e d . I n c o n t r a s t t o t h e s t a n d a r d t e s t t h i s new t e s t i s s u f f i c i e n t l y e f f i c i e n t t o p e r m i t t h e u n r e s t r i c t e d use o f t(More)
This survey article introduces into the essential concepts and methods underlying rule-based query languages. It covers four complementary areas: declarative semantics based on adaptations of mathematical logic, operational semantics, complexity and expressive power, and optimisation of query evaluation. The treatment of these areas is foundation-oriented,(More)
Satchmo is an automated theorem prover for rst-order predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and deenite speciications, but also normative and indeenite ones. The implementation(More)
Inference rules for resolution based systems can be classified into deduction rules, which add new objects, and reduction rules, which remove objects. Traditional reduction rules like subsumption do not actively contribute to a solution, but they help to avoid redundancies in the search space. We present a number of advanced reduction rules, which can cope(More)
This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present(More)