On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results

Authors:
Viorica Sofronie-Stokkermans
Affiliations:
-
Venue:
CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Year:
1999

Citing 5
Cited 2

Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
Tarskian Set Constraints Are in NEXPTIME

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
SPASS & FLOTTER Version 0.42

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Tarskian Set Constraints

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Representation Theorems and Theorem Proving in Non-Classical Logics

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic

On Uniform Word Problems Involving Bridging Operators on Distributive Lattices

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A Proof System for Dependencies for Information Relations

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we establish a link between satisfiability of universal sentences with respect to varieties of distributive lattices with operators and satisfiability with respect to certain classes of relational structures. We use these results for giving a method for translation to clause form of universal sentences in such varieties, and then use results from automated theorem proving to obtain decidability and complexity results for the universal theory of some such varieties.