LPAR-IWIL 2018:Keyword Index

KeywordPapers
A
Answer Set ProgrammingSymmetry breaking in a new stable model search method
C
computational complexityOn Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic
D
Data MiningTowards Efficient Metaquery Generator
DPLL(T)Extending a Verified Simplex Algorithm
F
functorHoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography
G
GroupoidHoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography
H
Halpern-Shoham logicOn Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic
Higher Inductive TypeHoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography
homotopy type theoryHoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography
I
interval logicOn Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic
Isabelle/HOLExtending a Verified Simplex Algorithm
L
Linear Rational ArithmeticExtending a Verified Simplex Algorithm
logic programmingSymmetry breaking in a new stable model search method
M
metaqueriesTowards Efficient Metaquery Generator
R
relational databaseTowards Efficient Metaquery Generator
S
stable modelsSymmetry breaking in a new stable model search method
Sub-propositional FragmentsOn Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic
symmetry breakingSymmetry breaking in a new stable model search method
T
theory solverExtending a Verified Simplex Algorithm
U
univalenceHoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography
unsatisfiable coreExtending a Verified Simplex Algorithm