FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

A
automated reasoning	Do Lawyers Use Automated Reasoning?
automated theorem proving	Advancing Automated Theorem Proving for the Modal Logics D and S5 Solving QMLTP Problems by Translation to Higher-order Logic
automation	Automated verification of deontic correspondences in Isabelle/HOL - First results
B
betterness relation	Automated verification of deontic correspondences in Isabelle/HOL - First results
C
conditional obligation	Automated verification of deontic correspondences in Isabelle/HOL - First results
Coq	Towards a Coq formalization of a quantified modal logic
correspondence	Automated verification of deontic correspondences in Isabelle/HOL - First results
D
deductive forgetting	Advances and Challenges in the Development and Application of Forgetting Tools
deontic cube	Automated verification of deontic correspondences in Isabelle/HOL - First results
Description Logics	Reasoning in Non-normal Modal Description Logics
dyadic deontic logic	Automated verification of deontic correspondences in Isabelle/HOL - First results
F
feasible fragments	Towards a Coq formalization of a quantified modal logic
fixpoint logic	(Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
forgetting tools	Advances and Challenges in the Development and Application of Forgetting Tools
formalization	Towards a Coq formalization of a quantified modal logic
H
Higher-order logic	Solving QMLTP Problems by Translation to Higher-order Logic
higher-order modal logic	Intuitionistic derivability in Anderson's variant of the ontological argument
I
intuitionistic logic	Intuitionistic derivability in Anderson's variant of the ontological argument
Isabelle/HOL	Automated verification of deontic correspondences in Isabelle/HOL - First results
K
Kripke semantics	Towards a Coq formalization of a quantified modal logic
L
laws	Do Lawyers Use Automated Reasoning?
M
modal logic	Advancing Automated Theorem Proving for the Modal Logics D and S5 Towards a Coq formalization of a quantified modal logic
N
non-classical logics	Solving QMLTP Problems by Translation to Higher-order Logic Do Lawyers Use Automated Reasoning?
Non-normal modal logics	Reasoning in Non-normal Modal Description Logics
O
ontological argument	Intuitionistic derivability in Anderson's variant of the ontological argument
P
parameterised Boolean equation systems	(Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
prefix unification	Advancing Automated Theorem Proving for the Modal Logics D and S5
Q
Quantified modal logics	Solving QMLTP Problems by Translation to Higher-order Logic
quantifier elimination	(Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
S
semantic forgetting	Advances and Challenges in the Development and Application of Forgetting Tools
strictly positive logic	Towards a Coq formalization of a quantified modal logic
T
Tableau algorithms	Reasoning in Non-normal Modal Description Logics

Disclaimer | Powered by EasyChair Smart Program