Paramodulation-Based Theorem Proving.

TL;DR: E is a sound and complete prover for clausal first order logic with equality and has a very flexible interface for specifying search control heuristics, and an efficient inference engine.

TL;DR: A Concurrent Kleene Algebra is investigated in terms of a primitive independence relation between the traces, and a series of richer algebras are developed; the richest validates a proof calculus for programs similar to that of a Jones style rely/guarantee calculus.

TL;DR: An overview of the system architecture is presented and the main ideas behind the indexing data structures and the novel reasoning algorithms of RDFox are highlighted, which supports materialisation-based parallel datalog reasoning and SPARQL query answering.

TL;DR: In this article, an algorithm is described which is capable of solving certain word problems: i.e., deciding whether or not two words composed of variables and operators can be proved equal as a consequence of a given set of identities satisfied by the operators.

TL;DR: The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity the authors show completeness in some complexity class.

TL;DR: This paper gives new results, and presents old ones, concerning ChurchRosser theorems for rewrmng systems, depending solely on axioms for a binary relatton called reduction, and how these criteria yield new methods for the mechanizaUon of equattonal theories.

TL;DR: This book discusses Negation in Logic Programming, a Theory of Declarative Knowledge, and its Applications in Deductive Databases and Implementation, as well as other topics.