An environment for specifying properties of dyadic relations and reasoning about them II: relational presentation of non-classical logics

Authors:
Andrea Formisano;Eugenio G. Omodeo;Ewa Orłowska
Affiliations:
Dipartimento di Informatica, Università di L'Aquila, Italy;Dipartimento di Matematica e Informatica, Università di Trieste, Italy;National Institute of Telecommunications, Warsaw, Poland
Venue:
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Year:
2006

Citing 11
Cited 0

Proof system for weakest prespecification

Information Processing Letters
Temporal logics in a relational framework

Time and logic
Relational formalisation of nonclassical logics

Relational methods in computer science
Beyond modalities: sufficiency and mixed algebras

Relational methods for computer science applications
Incomplete Information: Structure, Inference, Complexity

Incomplete Information: Structure, Inference, Complexity
T-Resolution: Refinements and Model Elimination

Journal of Automated Reasoning
Compiling dyadic first-order specifications into map algebra

Theoretical Computer Science - Algebraic methods in language processing
Cut-free Display Calculi for Relation Algebras

CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
Instructing Equational Set-Reasoning with Otter

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Encoding two-valued nonclassical logics in classical logic

Handbook of automated reasoning
Relational correspondences for lattices with operators

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper contributes to the vast literature on relational renderings of non-classical logics providing a general schema for automatic translation. The translation process is supported by a flexible Prolog tool. Many specific translations are already implemented, typically leading from an unquantified logic into the calculus of binary relations. Thanks to the uniformity of the translation pattern, additional source languages (and, though less commonly, new target languages) can be installed very easily into this Prolog-based translator. The system also integrates an elementary graphical proof assistant based on Rasiowa-Sikorski dual-tableau rules.