FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

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

A
Algebraic crossover operators	Algebraic Crossover Operators for Permutations
Algebraic evolutionary computation	Algebraic Crossover Operators for Permutations
Answer Set Programming	Externally Supported Models for Efficient Computation of Paracoherent Answer Sets Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)
Automated configuration	On the Configuration of SAT Formulae
B
BDD	Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited
C
case study	Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network
CNF configuration	On the Configuration of SAT Formulae
combinatorial search algorithms	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
Constrained Optimization	Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)
Constraint Logic Programming on Finite Domains	Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)
Constraint programming	Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited
constraint satisfaction	Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems
critical complexity region	Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns
Curry-Howard isomorphism	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
Cutting and Packing	An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
D
Declarative Algorithms	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
G
Genetic algorithms	An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
Greedy Heuristics	Greedy Randomized Search for Scalable Compilation of Quantum Circuits
Guillotine Constraint	An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
H
heuristics	An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
hybrid system simulators	Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction.
L
Logic Programming	Externally Supported Models for Efficient Computation of Paracoherent Answer Sets Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
Logic Programming Applications	Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)
M
Mixed Integer Linear Programming	Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network
N
neighbourhood singleton arc consistency	Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems
Non-monotonic Reasoning	Externally Supported Models for Efficient Computation of Paracoherent Answer Sets
O
Optical Networks on Chip	Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)
Optimisation	Greedy Randomized Search for Scalable Compilation of Quantum Circuits Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network
P
Paracoherent Answer Sets	Externally Supported Models for Efficient Computation of Paracoherent Answer Sets
PB constraints	Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited
Permutation problems	Algebraic Crossover Operators for Permutations
Planning	Greedy Randomized Search for Scalable Compilation of Quantum Circuits
precision medicine	Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction.
premature convergence	An Enhanced Genetic Algorithm with the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
propositional implicational intuitionistic logic	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
Pseudo-Boolean Optimisation	Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network
Q
Quantum Computing	Greedy Randomized Search for Scalable Compilation of Quantum Circuits
R
Random Algorithms	Greedy Randomized Search for Scalable Compilation of Quantum Circuits
replaceability	Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns
S
SAT encoding	Encoding PB Constraints into SAT via Binary Adders and BDDs -- Revisited
Satisfiability	On the Configuration of SAT Formulae
Scheduling	Greedy Randomized Search for Scalable Compilation of Quantum Circuits
search	Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction.
simply typed lambda terms	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
singleton arc consistency	Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems
substitutability	Replaceability for constraint satisfaction problems: Algorithms, Inferences, and Complexity Patterns
T
theorem proving	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
type inference and type inhabitation	Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic
V
virtual physiological human	Computing Personalised Treatments through In Silico Clinical Trials. A Case Study on Downregulation in Assisted Reproduction.
W
Wireless Networks	Optimal Fault-Tolerant Placement of Relay Nodes in a Mission Critical Wireless Network

Disclaimer | Powered by EasyChair Smart Program