Deciding Second-order Logics using Database Evaluation Techniques
We outline a novel technique that maps the satisfiability problems of second-order logics, in particular WSnS (weak monadic second-order logic with n successors), S1S (monadic second-order logic with one successor), and of μ-calculus, to the problem of query evaluation of Complex-value Datalog queri...
Main Author: | |
---|---|
Language: | en |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/4044 |