Nondeterministic algebraic specifications and nonconfluent term rewriting
Journal of Logic Programming
A complete calculus for the multialgebraic and functional semantics of nondeterminism
ACM Transactions on Programming Languages and Systems (TOPLAS)
A relational formalisation of a generic many—valued modal logic
Relational methods for computer science applications
Proceedings of the First International Conference on Temporal Logic
ICTL '94 Proceedings of the First International Conference on Temporal Logic
A Many Sorted Logic with Possibly Empty Sorts
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Quantifier-free logic for nondeterministic theories
Theoretical Computer Science - Logic, language, information and computation
A Multi-modal Logic for Disagreement and Exhaustiveness
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
A new methodology for developing deduction methods
Annals of Mathematics and Artificial Intelligence
A Multi-modal Logic for Disagreement and Exhaustiveness
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
| Hi-index | 5.23 |
A Rasiowa-Sikorski system is a sequence-type formalization of logics. The system uses invertible decomposition rules which decompose a formula into sequences of simpler formulae whose validity is equivalent to validity of the original formula. There may also be expansion rules which close indecomposable sequences under certain properties of relations appearing in the formulae, like symmetry or transitivity. Proofs are finite decomposition trees with leaves having "fundamental", valid labels. The author describes a general method of applying the RS formalism to develop complete deduction systems for various brands of C.S and A.I. logic, including a logic for reasoning about relative similarity, a three-valued software specification logic with McCarthy's connectives and Kleene quantifiers, a logic for nondeterministic specifications, many-sorted FOL with possibly empty carriers of some sorts, and a three-valued logic for reasoning about concurrency.