Logic programming approach to automata-based decision procedures

Yükleniyor...
Küçük Resim

Tarih

2017-01

Dergi Başlığı

Dergi ISSN

Cilt Başlığı

Yayıncı

Elsevier Science Inc

Erişim Hakkı

info:eu-repo/semantics/closedAccess

Araştırma projeleri

Organizasyon Birimleri

Dergi sayısı

Özet

We propose a novel technique that reduces the decision problem of WSnS (weak monadic second-order logic with n successors) to the problem of evaluation of Complex-value Datalog queries. We then show how the use of advanced implementation techniques for Logic Programs, in particular the use of tabling in the XSB system, yields a considerable improvement in performance over more traditional approaches. We also explore various optimizations of the proposed technique based on variants of tabling and goal reordering. Although our primary focus is on WS1S, the logic of single successor, we show that it is straightforward to adapt our approach for other logics with existing automata-theoretic decision procedures, for example WS2S.

Açıklama

Anahtar Kelimeler

WS1S, WS2S, Automata complex-value datalog (Datalog(CV)), Magic sets, SLG-resolution, Model checking, Mu-calculus

Kaynak

Journal of Logical and Algebraic Methods in Programming

WoS Q Değeri

Q1

Scopus Q Değeri

Q1

Cilt

86

Sayı

1
SI

Künye

Unel, G., & Toman, D. (2017). Logic programming approach to automata-based decision procedures. Journal of Logical and Algebraic Methods in Programming, 86(1), 391-407. doi:10.1016/j.jlamp.2016.02.005