Nested satisfiability
Computational Complexity
2008-02-03 v1
Authors:
Donald E. Knuth
Abstract
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
Cite
@article{arxiv.cs/9301111,
title = {Nested satisfiability},
author = {Donald E. Knuth},
journal= {arXiv preprint arXiv:cs/9301111},
year = {2008}
}
Related papers
View all related →
Logic in Computer Science · Computer Science
Satisfiability for two-variable logic with two successor relations on finite linear orders
Diego Figueira
2015-03-20
Computational Complexity · Computer Science
Technical Notes on Complexity of the Satisfiability Problem
Marek A. Suchenek
2015-04-07
Logic in Computer Science · Computer Science
The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
Ian Pratt-Hartmann
2024-04-24
Artificial Intelligence · Computer Science
High-Fidelity Vector Space Models of Structured Data
Maxwell Crouse, Achille Fokoue, Maria Chang, Pavan Kapanipathi +5
2019-01-16
Dynamical Systems · Mathematics
Uniform solvability for families of linear systems on time scales
Sergey Kryzhevich
2022-03-31
Logic in Computer Science · Computer Science
Satisfiability for Knowing How over Linear Plans is NP-complete
Carlos Areces, Pablo Barceló, Valentin Cassano, Pablo F. Castro +2
2026-05-20
Data Structures and Algorithms · Computer Science
Planar Reachability in Linear Space and Constant Time
Jacob Holm, Eva Rotenberg, Mikkel Thorup
2015-04-07
Programming Languages · Computer Science
Proving Linearizability Using Partial Orders (Extended Version)
Artem Khyzha, Mike Dodds, Alexey Gotsman, Matthew Parkinson
2017-07-07
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Logic in Computer Science · Computer Science
Order-Invariance of Two-Variable Logic is Decidable
Thomas Zeume, Frederik Harwath
2016-04-21
Logic in Computer Science · Computer Science
Two-Variable Logic with Two Order Relations
Thomas Schwentick, Thomas Zeume
2015-07-01
Logic in Computer Science · Computer Science
Two-Variable Logic for Hierarchically Partitioned and Ordered Data
Oskar Fiuk, Emanuel Kieronski, Vincent Michielini
2025-12-11
Logic in Computer Science · Computer Science
The Complexity of Clausal Fragments of LTL
A. Artale, R. Kontchakov, V. Ryzhikov, M. Zakharyaschev
2013-10-11
Data Structures and Algorithms · Computer Science
On Satisfiability Problems with a Linear Structure
Serge Gaspers, Christos Papadimitriou, Sigve Hortemo Saether, Jan Arne Telle
2016-02-26
Logic in Computer Science · Computer Science
A Characterisation of First-Order Constraint Satisfaction Problems
Benoit Larose, Cynthia Loten, Claude Tardif
2015-07-01
Systems and Control · Computer Science
Herdability of Linear Systems Based on Sign Patterns and Graph Structures
Sebastian F Ruf, Magnus Egerstedt, Jeff S. Shamma
2019-04-19
Computational Complexity · Computer Science
Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and its Implications on P versus NP problem
Manoj Kumar
2021-05-25
Logic in Computer Science · Computer Science
A Short Note on Two-Variable Logic with a Linear Order Successor and a Preorder Successor
Amaldev Manuel, Thomas Schwentick, Thomas Zeume
2013-06-17
Computational Complexity · Computer Science
Hard satisfiable formulas for DPLL-type algorithms
Sergey I. Nikolenko
2007-05-23
Logic in Computer Science · Computer Science
Finite Satisfiability of Unary Negation Fragment with Transitivity
Daniel Danielski, Emanuel Kieronski
2019-07-01
Computational Complexity · Computer Science
Hardware-Oriented Group Solutions for Hard Problems
Mark Burgin
2007-05-23
Programming Languages · Computer Science
Higher-Order Linearisability
Andrzej S. Murawski, Nikos Tzevelekos
2016-10-26
Analysis of PDEs · Mathematics
Solvability of linear non-homogeneous higher order differential equation in the Schwartz space
Valerii Samoilenko, Yuliia Samoilenko
2017-11-28
Logic in Computer Science · Computer Science
Clausal Temporal Resolution
Michael Fisher, Clare Dixon, Martin Peim
2007-05-23
Logic in Computer Science · Computer Science
On amenability of constraint satisfaction problems
Michał R. Przybyłek
2020-03-31