Solving Queries for Boolean Fault Tree Logic via Quantified SAT.
Caz SaaltinkStefano M. NicolettiMatthias VolkErnst Moritz HahnMariëlle StoelingaPublished in: FTSCS (2023)
Keyphrases
- boolean queries
- fault tree
- davis putnam logemann loveland
- multi valued
- query language
- boolean logic
- boolean formula
- query processing
- qualitative analysis
- stochastic local search
- friendly interface
- np complete problems
- sat instances
- gas turbine
- computational properties
- automated reasoning
- variable ordering
- sat solving
- boolean satisfiability
- search algorithm
- logic programming
- sat encodings
- satisfiability problem
- sat solvers
- modal logic
- boolean functions
- sat problem