Systematic Semantic Tableaux for PLTL | Zendy

Jose Gaintzarain | Zendy; Montserrat Hermo | Zendy; Paqui Lucio | Zendy; Marisa Navarro | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Systematic Semantic Tableaux for PLTL

Author(s) -

Jose Gaintzarain,

Montserrat Hermo,

Paqui Lucio,

Marisa Navarro

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.03.075

Subject(s) - finitary , sequent , satisfiability , sequent calculus , computer science , mathematics , natural deduction , discrete mathematics , calculus (dental) , algorithm , mathematical proof , medicine , geometry , dentistry

The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisfaction is made from the graph and it does not correspond with the application of rules in any calculus for PLTL. We present here a new method of semantic tableaux without using additional graphs. The method is based on a new complete finitary sequent calculus for PLTL which allows us to incorporate all the information in a tree. This approach makes our tableaux better suited for completely automatic theorem proving

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research