On the complexity of computing minimal unsatisfiable LTL formulas (original) (raw)
Related papers
The Complexity of Satisfiability Problems: P = NP = PSPACE
2005
Complexity results for quantified boolean formulae based on complete propositional languages
Florian Letombe, Pierre Marquis
2006
The complexity of the falsifiability problem for pure implicational formulas
Discrete Applied Mathematics, 1999
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Electronic Colloquium on Computational Complexity, 2006
On the computational complexity of satisfiability in propositional logics of programs
Theoretical Computer Science, 1982
… of Computer Science, 1999. 40th Annual …, 1999
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
Journal of Logic and Computation, 2007
Complexity and structural heuristics for propositional and quantified satisfiability
2007
On the Complexity of SAT (Revised)
2008
An Algorithm for the Class of Pure Implicational Formulas
Discrete Applied Mathematics, 1999
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
2005
On complexity of propositional linear-time temporal logic with finitely many variables
Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists, 2018
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
Lecture Notes in Computer Science, 2005
Complexity of computing with extended propositional logic programs
Annals of Mathematics and Artificial Intelligence, 1995
The complexity of minimum partial truth assignments and implication in negation-free formulae
Annals of Mathematics and Artificial Intelligence, 1996
The Complexity of the Satisfiability Problem for Krom Formulas
Theoretical Computer Science
Time-space lower bounds for satisfiability
Journal of the ACM ( …, 2005
Space Complexity in Propositional Calculus
SIAM Journal on Computing, 2002
The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Electronic Notes in Theoretical Computer Science, 2009
Proof Complexity of Resolution-based QBF Calculi
Electron. Colloquium Comput. Complex., 2014
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
2012
An upper bound for the circuit complexity of existentially quantified Boolean formulas
Theoretical Computer Science, 2010
The Complexity of the Boolean Formula Value Problem
Hard satisfiable formulas for DPLL-type algorithms
Computing Research Repository, 2003