FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

#
#SAT	Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth
A
Algebra	Declarative Dynamic Programming with Inverse Coupled Rewrite Systems
Atomic Formula	Lazy Automata Techniques for WS1S
Automaton State	Lazy Automata Techniques for WS1S
B
Brzozowski derivatives	A Derivative-Based Decision Procedure for WS1S
C
Constraint Language	ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What? Automated Constraint Modelling with Conjure
Constraint Modelling	ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What? Automated Constraint Modelling with Conjure
Constraint Solving	Automated Constraint Modelling with Conjure
Courcelle's Theorem	Courcelle’s Theorem – A Game-Theoretic Approach
D
decision procedure	A Derivative-Based Decision Procedure for WS1S Lazy Automata Techniques for WS1S
Decision Procedures	Decidable Linear Tree Constraints
Dynamic Programming	Declarative Dynamic Programming with Inverse Coupled Rewrite Systems Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth
F
Finite Automaton	Lazy Automata Techniques for WS1S
Fly-Automata	Monadic Second-Order Model Checking with Fly-Automata
Free Variable	Lazy Automata Techniques for WS1S
I
information flow	A Logic of Information Flows
interactive theorem proving	A Derivative-Based Decision Procedure for WS1S
Isabelle	A Derivative-Based Decision Procedure for WS1S
L
Linear Tree Constraints	Decidable Linear Tree Constraints
Logic	A Logic of Information Flows
M
model checking	Monadic Second-Order Model Checking with Fly-Automata
Model Checking Games	Courcelle’s Theorem – A Game-Theoretic Approach
Modular System	A Logic of Information Flows
Monadic Second Order Logic	Monadic Second-Order Model Checking with Fly-Automata Courcelle’s Theorem – A Game-Theoretic Approach
MSO	Monadic Second-Order Model Checking with Fly-Automata A Derivative-Based Decision Procedure for WS1S
P
Program Analysis	Decidable Linear Tree Constraints
R
Reformulation	Automated Constraint Modelling with Conjure
regular expressions	A Derivative-Based Decision Procedure for WS1S
Rewrite Systems	Declarative Dynamic Programming with Inverse Coupled Rewrite Systems
S
Specification Language	ESSENCE, A Language for Specifying Combinatorial Problems: What, Why and So What?
T
Tree Decompositions	Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth
treewidth	Solving #SAT by Parameterized Algorithms: Exploiting Small Treewidth
W
WS1S	A Derivative-Based Decision Procedure for WS1S

Disclaimer | Powered by EasyChair Smart Program