SPASS: Combining Superposition, Sorts and Splitting Page 1 SPASS: Combining
Superposition, Sorts and Splitting Christoph Weidenbach Max-Planck-Institute for Computer …

The History of the Book In August 1992 the author had the opportunity to give a course on
resolution theorem proving at the Summer School for Logic, Language, and Information in …

The formalization of abductive reasoning is still an open question: there is no general
agreement on the boundary of some basic concepts, such as preference criteria for …

Machine Learning from examples may be used, within Artificial Intelligence, as a way to
acquire general knowledge or associate to a concrete problem solving system. Inductive …

Many forms of inductive logic programming (ILP) use metarules, second-order Horn clauses,
to define the structure of learnable programs and thus the hypothesis space. Deciding which …

This paper deals with the problem of removing redundant literals from a given clause. We
first consider condensing, a weak type of redundancy elimination. A clause is condensed if it …

Automated deduction for many-valued logics | Handbook of automated reasoning skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …

The paper gives an overview of theoretical results in the rapidly growing field of inductive
logic programming (ILP). The ILP learning situation (generality model, background …

Meta-interpretive learning (MIL) is a form of inductive logic programming. MIL uses second-
order Horn clauses, called metarules, as a form of declarative bias. Metarules define the …

Undecidability of the horn-clause implication problem Page 86 Undecidability of the Horn-Clause
Implication Problem Jerzy Marcinkowski1 and Leszek Pacholski2 1 Introduction In this paper …