- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
1 Online-Ressource.
- Language
-
Englisch
- Bibliographic citation
-
SAT Meets Tableaux for Linear Temporal Logic Satisfiability ; volume:68 ; number:2 ; day:15 ; month:3 ; year:2024 ; pages:1-32 ; date:6.2024
Journal of automated reasoning ; 68, Heft 2 (15.3.2024), 1-32, 6.2024
- Creator
-
Geatti, Luca
Gigante, Nicola
Montanari, Angelo
Venturato, Gabriele
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10817-023-09691-1
- URN
-
urn:nbn:de:101:1-2405172112593.846116978334
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:50 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Geatti, Luca
- Gigante, Nicola
- Montanari, Angelo
- Venturato, Gabriele
- SpringerLink (Online service)
Other Objects (12)
Satisfiability thresholds for non-uniform random k-SAT
Parametrised complexity of satisfiability in temporal logic
A satisfiability algorithm for a typed feature logic
Variational satisfiability solving: efficiently solving lots of related SAT problems
The complexity of generalized satisfiability for linear temporal logic
New results on probabilistic verification : automata, logic and satisfiability
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Programming in propositional logic or reductions : back to the roots (satisfiability)
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Satisfiability thresholds for non-uniform random k-SAT
Parametrised complexity of satisfiability in temporal logic
A satisfiability algorithm for a typed feature logic
Variational satisfiability solving: efficiently solving lots of related SAT problems
The complexity of generalized satisfiability for linear temporal logic
New results on probabilistic verification : automata, logic and satisfiability
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Programming in propositional logic or reductions : back to the roots (satisfiability)
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Parameterised complexity of model checking and satisfiability in propositional dependence logic
Satisfiability thresholds for non-uniform random k-SAT
Parametrised complexity of satisfiability in temporal logic
A satisfiability algorithm for a typed feature logic
Variational satisfiability solving: efficiently solving lots of related SAT problems
The complexity of generalized satisfiability for linear temporal logic
New results on probabilistic verification : automata, logic and satisfiability
27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024)
26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023)
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)
Programming in propositional logic or reductions : back to the roots (satisfiability)
Parameterised complexity of model checking and satisfiability in propositional dependence logic