VSL 2014: VIENNA SUMMER OF LOGIC 2014

This page contains an index consisting of author-provided keywords.

B
backdoor set	Backdoors into Heterogeneous Classes of SAT and CSP
backdoor sets	Backdoors into Two Occurrences Backdoors to Planning Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction Backdoors into Heterogeneous Classes of SAT and CSP
backdoors	Backdoors to Planning Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
C
causal graph	Backdoors to Planning
complexity	Intuitionistic modal logics: efficient fragments and parameterized complexity
complexity hierarchies	Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond
computational social choice	A Parameterized Complexity Analysis of Generalized CP-Nets
connection matrices	Connection matrices of finite rank instead of definability in Monadic Second Order Logic
constraint satisfaction	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction Backdoors into Heterogeneous Classes of SAT and CSP
CP-nets	A Parameterized Complexity Analysis of Generalized CP-Nets
D
derivability	Intuitionistic modal logics: efficient fragments and parameterized complexity
disjunctive answer set programming	Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond
F
fixed parameter tractability	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
fixed parameter tractable	Backdoors into Two Occurrences Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction A Parameterized Complexity Analysis of Generalized CP-Nets Connection matrices of finite rank instead of definability in Monadic Second Order Logic
fixed-parameter tractability	Backdoors into Two Occurrences
Fixed-parameter tractable algorithms	A Parameterized Complexity Analysis of Generalized CP-Nets
formulas with two occurrences	Backdoors into Two Occurrences
G
graph algorithms	Connection matrices of finite rank instead of definability in Monadic Second Order Logic
I
important separators	Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
intuitionistic modal logic	Intuitionistic modal logics: efficient fragments and parameterized complexity
P
parameterized complexity	Structural Decomposition Methods: How They Matter Backdoors to Planning Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond A Parameterized Complexity Analysis of Generalized CP-Nets Backdoors into Heterogeneous Classes of SAT and CSP
planning	Backdoors to Planning
S
satisfiability	Backdoors into Heterogeneous Classes of SAT and CSP
structural decompositions	Structural Decomposition Methods: How They Matter
T
treewidth	Structural Decomposition Methods: How They Matter
W
W[2]-hardness	Backdoors into Two Occurrences

Disclaimer | Powered by EasyChair Smart Program