TALK KEYWORD INDEX
This page contains an index consisting of author-provided keywords.
( | |
(Counter-)Model Counting | |
(Counter-)Model Enumeration | |
A | |
action reversibility | |
analytic tableaux | |
answer set programming | |
Argument extraction | |
Argumentation | |
Automata Learning | |
automated reasoning | |
Axiomatization | |
B | |
balancing scale | |
belief base | |
Belief change | |
belief revision | |
Benchmark | |
Boolean inclusion | |
boolean ML model | |
C | |
c-inference | |
Case-based reasoning | |
certified optimization | |
cf2 | |
choice | |
choice semantics | |
classical planning | |
Compiled Propagators | |
completeness | |
completing arguments | |
computational argumentation | |
Computational complexity | |
conditional | |
conditional logic | |
Contrastive Explanations | |
countermodel construction | |
Cut admissibility | |
D | |
Data Repairs | |
decision procedure | |
Decision-DNNF | |
Deductive closure | |
Defeasible modalities | |
Defeasible rules | |
Definite descriptions | |
deontic logic | |
Deontic Planning | |
Deontic Reasoning | |
Description logics | |
detachment systems | |
dialectical systems | |
Direct access | |
discrete duality | |
Discrete Optimization | |
Diverse Satisfiability | |
dual tableaux | |
E | |
empirical evaluation | |
Encodings | |
epistemic spaces | |
Equivalence Checking | |
Explainable AI | |
Explainable Artificial Intelligence | |
Extension Semantics | |
F | |
fairness | |
formal verification | |
G | |
Grounding | |
Grounding Bottleneck | |
H | |
Higher-Order Logic | |
I | |
implementations | |
Implication problem | |
Inclusion dependency | |
incomplete | |
Inconsistency | |
infinite argumentation | |
intermediate logic | |
interpolation | |
iterated belief revision | |
K | |
Knowledge Graphs | |
Knowledge Representation and Reasoning | |
Kripke semantics | |
Kripke-completeness | |
L | |
Lambda-abstraction | |
learned behaviour | |
Legal case databases | |
lexicographic inference | |
limiting belief sets | |
Linear Programming | |
Lockean thesis | |
Logic | |
logic | |
logic programming | |
M | |
Machine Learning | |
Maximum Satisfiability | |
MaxSAT solver | |
measures of importance | |
minimal change | |
Minimal revision | |
modal Berman variety | |
modal logic | |
Modal logics | |
modal Ockham algebra | |
model checking | |
Model enumeration | |
model theory | |
Multi-objective optimization | |
multiagent logic | |
N | |
Neuro-symbolic system | |
Non-Classical Logic | |
Non-monotonic reasoning | |
Nonlinear Integer Programming | |
nonmonotonic reasoning | |
O | |
Ontologies | |
optimal-length | |
P | |
p-entailemnt | |
Partial Orders | |
Passive learning | |
planning as SAT | |
Polynomials | |
Preferences | |
Preferential semantics | |
Preprocessing techniques | |
principle-based analysis | |
Probabilistic Hoare Logic | |
Problem Modeling | |
Proof theory | |
Propositional Satisfiability | |
provability logic | |
pseudo-Boolean optimization | |
Python library | |
Q | |
QBF | |
QBF Solutions | |
Quadratic Integer Programming | |
quantified boolean formulas | |
R | |
Ranking | |
Reasoning with data | |
reasons | |
refinement | |
refutations | |
Reinforcement Learning | |
Reinforcement learning | |
restricted choice | |
robust strategies | |
robustness | |
S | |
safety | |
SAT | |
SAT solver | |
SAT-based approach | |
satisfiability modulo theories | |
SCC-recursiveness | |
Second order logic | |
semantics | |
Sentential Calculus with Identity | |
sequent and hypersequent calculi | |
Sequent calculi | |
Similarity | |
Standpoint logics | |
star frame | |
stg2 | |
Stopping criterion | |
structured argumentation | |
substructural logic | |
system W | |
system Z | |
T | |
Tableau | |
Tableaux system | |
Team semantics | |
Temporal logic | |
Temporal reference | |
Temporal referring expressions | |
termination | |
theory change | |
tree-like | |
U | |
Uniform sampling | |
unsatisfiability analysis | |
Unsupervised Learning | |
Utility Functions | |
UTVPI constraints | |
V | |
verification | |
W | |
weighing | |
Well-founded Semantics | |
Z | |
Zero Knowledge Proof |