Have Spass with OCC1N=g

Authors:
Christian G. Fermüller;Georg Moser
Affiliations:
Technische Universität Wien, Austria;Technische Universität Wien, Austria
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 15
Cited 1

Increasing model building capabilities by constraint solving on terms with integer exponents

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Resolution Strategies as Decision Procedures

Journal of the ACM (JACM)
Resolution Methods for the Decision Problem

Resolution Methods for the Decision Problem
Ordered Paramodulation and Resolution as Decision Procedure

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Unification in Extension of Shallow Equational Theories

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Model Building by Resolution

CSL '92 Selected Papers from the Workshop on Computer Science Logic
Decision Procedures Using Model Building Techniques

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
On the Complexity of H-Subsumption

Proceedings of the 12th International Workshop on Computer Science Logic
Superposition with Simplification as a Desision Procedure for the Monadic Class with Equality

KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Resolution decision procedures

Handbook of automated reasoning
Combining superposition, sorts and splitting

Handbook of automated reasoning
Basic Paramodulation and Decidable Theories

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Superposition Decision Procedure for the Guarded Fragment with Equality

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Working with Arms: Complexity Results on Atomic Representations of Herbrand Models

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Representing and Building Models for Decidable Subclasses of Equational Clausal Logic

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that a particular superposition based inference operator decides a fragment of clause logic with equality, called OCC1Ng=. We also show that the theorem prover Spass not only implements the corresponding operator but also generates standard descriptions of unique term models for all satisfiable clause sets in OCC1Ng=.