Cut-free Gentzen systems and their semantic-oriented variant, the tableau method,
constitute an established paradigm in proof-theory and are of considerable interest for …

By formalizing recent syntactic theories for natural languages Stabler shows how their
complexity can be handled without guesswork or oversimplification. By formalizing recent …

Les règles de transformation des problèmes equationnels sont donnes permettant, en
particulier, de décider de l'existence d'une solution fermée. Comme première application, il …

AI researchers are becoming increasingly aware of the importance of reasoning about
knowledge and belief. This paper reviews epistemic logic, a logic designed specifically for …

CHCL — A connectionist inference system Page 1 CHCL- A Connectionist Inference
System Steffen HSlldobler FG Intellektik, FB Informatik TIt Darmstadt Alexanderstraf~e 10 D-6100 …

In this paper, we define a framework in which the termination of Prolog programs can be
proved. This framework relies on a semantics of Prolog that takes Prolog's control into …

Many-valued logics are becoming increasingly important in all areas of computer science.
This is the second volume of an authoritative two-volume handbook on many valued logics …

The safety-critical nature of the application of knowledge-based systems to the field of
medicine requires the adoption of reliable engineering principles with a solid foundation for …

The conventional formalization of logic programming in classical logic explains very
convincingly the basic principles of this programming style. However, it gives no easy or …

An N-resolution proof is a resolution proof in which the resolution rule is restricted: one
clause to which it is applied must only consist of negative literals. N-resolution is complete …