Titlebook: Automated Reasoning; First International Rajeev Goré,Alexander Leitsch,Tobias Nipkow Conference proceedings 2001 Springer-Verlag Berlin He

Nebulizer

Instructing Equational Set-Reasoning with Otter within the ground formalism .developed by Tarski and Givant. On top of a kernel axiomatization of map algebra we develop a layered formalization of basic set-theoretical concepts. A first-order theorem prover is exploited to obtain automated certification and validation of this layered architecture

歪曲道理

橫條

Ordered Resolution vs. Connection Graph resolutionxpected unrestricted connection graph (cg) resolution to be strongly complete until Eisinger proved that it was not. In this paper, ordered resolution is shown to be a special case of cg-resolution, and that relationship is used to prove that ordered cg-resolution is strongly complete. On the other

Emasculate

A Model-Based Completeness Proof of Extended Narrowing and Resolutioncontext of Theorem Proving Modulo. ENAR integrates narrowing with respect to a set of rewrite rules on propositions into automated first-order theorem proving by resolution. Our proof allows to impose ordering restrictions on ENAR and provides general redundancy criteria, which are crucial for findi

允許

A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equalitycontain at most two variables. This paper shows how resolution theorem-proving techniques can be used to provide an algorithm for deciding whether any given formula in .is satisfiable. Previous resolution-based techniques could deal only with the equality-free subset .of the two-variable fragment.

增強

Superposition and Chaining for Totally Ordered Divisible Abelian Groupsprevious superposition or chaining calculi for divisible torsion-free abelian groups and dense total orderings without endpoints. As its predecessors, it is refutationally complete and requires neither explicit inferences with the theory axioms nor variable overlaps. It offers thus an efficient way

Classify

Context Treess where terms are seen as strings and common prefixes are shared, and substitution trees, where terms keep their tree structure and all common contexts can be shared. Here we describe a new indexing data structure, called context trees, where, by means of a limited kind of context variables, also co

Coma704

On the Evaluation of Indexing Techniques for Theorem Provinglled the .), identify the subset . of . that consists of the terms . such that . holds. Terms in M will be called the .. Typical retrieval conditions used in first-order theorem proving are matching, generalization, unifiability, and syntactic equality. Such a retrieval of candidate terms in theorem

mastopexy

The Description Logic ,,, Extended with Concrete Domains: A Practically Motivated Approach this operator. This results in a limited expressivity w.r.t. concrete domains but is required to ensure the decidability of the language. We show that the results can be exploited for building practical description logic systems for solving e.g. configuration problems.

Gyrate

NExpTime-Complete Description Logics with Concrete DomainsTBoxes, inverse roles, and a role-forming concrete domain constructor—that make reasoning NExpTime-hard. As a corresponding upper bound, we show that reasoning with all three extensions . is in NExpTime.