wMSO theories as grammar formalisms
Theoretical Computer Science - Algebraic methods in language processing
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Decision Procedure for an Extension of WS1S
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Decision procedures for inductive Boolean functions based on alternating automata
Theoretical Computer Science
Hi-index | 0.00 |
Logic offers the possibility of modeling and reasoning about hardware and software. But which logic? We propose monadic logics of strings and trees as good candidates for many kinds of discrete systems. These logics are natural, decidable, yet substantially more expressive, extensions of Boolean logic. We motivate their applicability through examples.