Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

Conditional rewriting modulo axioms with rich types makes specifications and declarative
programs very expressive and succinct and is used in all well-known rule-based languages …

Building rules on top of ontologies is the ultimate goal of the logical layer of the Semantic
Web. To this aim, an ad-hoc markup language for this layer is currently under discussion. It …

Deductive databases that interact with, and are accessed by, reasoning agents in the real
world (such as logic controllers in automated manufacturing, weapons guidance systems …

The usage of sorts in rst-order automated deduction has brought greater conciseness of
representation and a considerable gain in e ciency by reducing the search spaces involved …

This paper presents a method for automated deduction in first-order modal logic. The modal
logic systems under consideration are arbitrary systems of type KD, KD4, KT, KT4, KT5 …

Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are
ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to useful …

Abstract The Why2-Atlas tutoring system presents students with qualitative physics
questions and encourages them to explain their answers through natural language …

Even though it is not very often admitted, partial functions do play a significant role in many
practical applications of deduction systems. Kleene has already given a semantic account of …

Rewriting logic is both a logical framework where many logics can be naturally represented,
and a semantic framework where many computational systems and programming …