z-logo
open-access-imgOpen Access
The Complexity of LTL on Finite Traces: Hard and Easy Fragments
Author(s) -
Valeria Fionda,
Gianluigi Greco
Publication year - 2016
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v30i1.10104
Subject(s) - satisfiability , boolean satisfiability problem , theoretical computer science , semantic reasoner , property (philosophy) , computer science , computational complexity theory , domain (mathematical analysis) , pspace , algorithm , mathematics , discrete mathematics , artificial intelligence , mathematical analysis , philosophy , epistemology

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom