Algorithms and complexity of difference logic

Cites work

scientific article; zbMATH DE number 3560737 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 1007358 (Why is no real title available?)
scientific article; zbMATH DE number 3793772 (Why is no real title available?)
scientific article; zbMATH DE number 2102690 (Why is no real title available?)
scientific article; zbMATH DE number 1448980 (Why is no real title available?)
scientific article; zbMATH DE number 3227181 (Why is no real title available?)
scientific article; zbMATH DE number 2234775 (Why is no real title available?)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
A complete annotated bibliography of work related to Sidon sequences
A model-theoretic view on qualitative constraint reasoning
A tableau algorithm for description logics with concrete domains and general TBoxes
A unifying approach to temporal constraint reasoning
An approach to temporal planning and scheduling in domains with predictable exogenous events
An exact algorithm for the channel assignment problem
An interdisciplinary experimental evaluation on the disjunctive temporal problem
Backtracking algorithms for disjunctions of temporal constraints
Complexity of Finding Embeddings in a k-Tree
Complexity of infinite-domain constraint satisfaction
Computational complexity of linear constraints over the integers
Conjunctive-query containment and constraint satisfaction
Constraint satisfaction problems over numeric domains
Constraint satisfaction with bounded treewidth revisited
Datalog and constraint satisfaction with infinite templates
Decomposition and tractability in qualitative spatial and temporal reasoning
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Efficient solution techniques for disjunctive temporal reasoning problems
Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen.
Fixed-parameter complexity in AI and nonmonotonic reasoning
Fundamentals of parameterized complexity
General lower bounds and improved algorithms for infinite-domain CSPs
Graph minors. III. Planar tree-width
Group activity selection with few agent types
Handle-rewriting hypergraph grammars
Incremental satisfiability and implication for UTVPI constraints
Maintaining knowledge about temporal intervals
Nonserial dynamic programming
On a Problem of Sidon in Additive Number Theory, and on some Related Problems
On relation between constraint answer set programming and satisfiability modulo theories
On solving Boolean combinations of UTVPI constraints.
On structural parameterizations of the bounded-degree vertex deletion problem
On the complexity of DNA physical mapping
On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Parametrized complexity theory.
Satisfiability problems on intervals and unit intervals
Slightly superexponential parameterized problems
Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
Solving infinite-domain CSPs using the patchwork property
Speeding up the constraint-based method in difference logic
Stable models and difference logic
Strong Controllability of Disjunctive Temporal Problems with Uncertainty
Temporal constraint networks
The Max-Atom Problem and Its Relevance
The Time Complexity of Constraint Satisfaction
The complexity landscape of decompositional parameters for ILP
The complexity of satisfiability of small depth circuits
The complexity of theorem-proving procedures
The impact of treewidth on grounding and solving of answer set programs
Tight lower bound for the channel assignment problem
Tractability in constraint satisfaction problems: a survey
Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
Treewidth. Computations and approximations
Upper bounds to the clique width of graphs
Verification of timed automata via satisfiability checking
Which problems have strongly exponential complexity?
Why are CSPs based on partition schemes computationally hard?
\(k\)-NLC graphs and polynomial algorithms

This page was built for publication: Algorithms and complexity of difference logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7239834)