On uniform word problems involving bridging operators on distributive lattices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2381 LNAI, Issue , 2002, Pages 235-250

  Sofronie Stokkermans, Viorica ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CALCULATIONS; DATA DESCRIPTION; FORMAL LOGIC; LATTICE THEORY;

ALGEBRAIC MODELS; DESCRIPTION LOGIC; DISTRIBUTIVE LATTICE; HYPER-RESOLUTION; NUMERICAL FEATURES; NUMERICAL VALUES; RELATIONAL STRUCTURES; UNIVERSAL THEORY; LATTICE ELEMENTS;

LATTICE THEORY; FORMAL LOGIC;

EID: 84885207318     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45616-3_17     Document Type: Conference Paper

References (13)

1. A.R. Anderson and N.D. Belnap. Entailment - The Logic of Relevance and Necessity. Princeton University Press, 1975.
2. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier, 2001.
3. R. Goldblatt. Varieties of complex algebras. Annals of Pure and Applied Logic, 44(3):153-301, 1989.
4. U. Hustadt and R. A. Schmidt. On the relation of resolution and tableaux proof systems for description logics. In T. Dean, editor, Proceedings of IJCAI'99, Volume 1, pages 110-115. Morgan Kaufmann, 1999.
5. U. Hustadt and R. A. Schmidt. Using resolution for testing modal satisfiability and building models. In I. P. Gent, H. van Maaren, and T. Walsh, editors, Proceedings of SAT 2000, Volume 63 of Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam, 2000.
6. B. Jónsson and A. Tarski. Boolean algebras with operators, Part I&II. American Journal of Mathematics, 73&74:891-939&127-162, 1951&1952.
7. H.J. Ohlbach. Set description languages and reasoning about numerical features of sets. Technical Report PMS-FB-2001-1, Institut f. Informatik, LMU, München, April 2001.
8. H. Ono. Semantics for substructural logics. In P. Schroeder-Heister and K. Došen, editors, Substructural Logics, pages 259-291. Oxford University Press, 1993.
9. H.A. Priestley. Representation of distributive lattices by means of ordered Stone spaces. Bull. London Math. Soc., 2:186-190, 1970.
10. V. Sofronie-Stokkermans. On the universal theory of varieties of distributive lattices with operators: Some decidability and complexity results. In Proceedings of CADE-16, LNAI 1632, pages 157-171, Trento, Italy, 1999. Springer.
11. V. Sofronie-Stokkermans. Duality and canonical extensions of bounded distributive lattices with operators, and applications to the semantics of non-classical logics I. Studia Logica, 64(1):93-132, 2000.
12. V. Sofronie-Stokkermans. Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators. Research Report MPI-I-2001-2-005, Max-Planck-Institut für Informatik, Saarbrücken, Germany, September 2001.
13. V. Sofronie-Stokkermans. Representation theorems and the semantics of non-classical logics and applications to automated theorem proving. In M. Fitting and E. Orlowska, editors, Theory and Applications of Multiple-Valued Logic Springer-Verlag series Studies in Fuzziness and Soft Computing, to appear, 2002.