FLOC 2022: FEDERATED LOGIC CONFERENCE 2022

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

(
(Probabilistic) Integer Programs	(WST22) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
-
- Data Mining	(CP 2022) On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
- High Utility Itemsets	(CP 2022) On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
- Propositional Satisfiability	(CP 2022) On the Enumeration of Frequent High Utility Itemsets: A symbolic AI Approach
0
0-1 integer linear decision problem	(SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
0-1 laws	(LICS 2022) Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
2
25-years	(SAT 2022) (25 years of SAT)
3
3D Space	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
A
A.I. in legal practice	(ASPOCP 2022)
AB axioms	(HoTT/UF 2022)
abduction	(IJCAR 2022) Connection-minimal Abduction in EL via translation to FOL (GDE 2022) A Query Evaluation Method for ASP with Abduction (ICLP 2022) Abduction in Probabilistic Logic Programs (NMR 2022) Connection-Minimal Abduction in EL via Translation to FOL (DL 2022) Connection-minimal Abduction in EL via translation to FOL (Extended Abstract) (DL 2022) Concept Abduction for Description Logics (DL 2022) An API for DL Abduction Solvers (XLoKR 2022) An API for DL Abduction Solvers
abductive explanations	(CP 2022) Formal Explainable AI
abductive intuitionistic logic	(ICLP 2022) Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
abductive logics	(NMR 2022) Abductive Reasoning with Sequent-Based Argumentation (Extended Abstract)
ABox abduction	(NMR 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results (DL 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results
ABox approximation	(DL 2022) Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract)
absolute value maximization	(PCCR2022) MaxSAT: Parameterized, Parallel, Absolute
Abstract Argumentation	(KR 2022) Abstract Argumentation with Markov Networks (Extended Abstract) (KR 2022) Rediscovering Argumentation Principles Utilizing Collective Attacks (KR 2022) Impact of Logic Paradigms on Abstract Argumentation (KR 2022) Matthias König's Thesis: Graph Parameters for Abstract Argumentation (PCCR2022) Tractable Abstract Argumentation via Backdoor-Treewidth
Abstract Argumentation Frameworks	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach
Abstract machines	(LICS 2022) Reasonable Space for the Lambda-Calculus, Logarithmically
abstract rewriting	(FSCD 2022) Strategies for Asymptotic Normalization
Abstract simplicial complexes	(TLLA-LINEARITY-2022)
abstracted action models	(KR 2022) Discovering User-Interpretable Capabilities of Black-Box Planning Agents
abstraction	(XLoKR 2022) Using Abstraction for Interpretable Robot Programs in Stochastic Domains
abstraction and refinement	(CAV 2022) Trainify: A CEGAR-Driven Training and Verification Framework for Verifiable Deep Reinforcement Learning
abstraction refinement	(IJCAR 2022) Cooperating Techniques for Solving nonlinear arithmetic in the cvc5 SMT solver (System Description)
Abstraction-Refinement	(CAV 2022) Abstraction-Refinement for Hierarchical Probabilistic Models
AC-Unification	(FSCD 2022) A Certified Algorithm for AC-Unification
access control	(PCCR2022) Parameterized algorithmics in access control: linking theory and practice (CSF 2022) IFCIL: An Information Flow Configuration Language for SELinux
Accessibility	(Isabelle 2022) Towards Accessible Formal Mathematics with ISAC and Isabelle/VSCode
ACL2(r)	(ITP 2022) A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(r)
Acquisition of conjectures	(CP 2022) Acquiring Maps of Interrelated Conjectures on Sharp Bounds
Acting and Sensing	(KR 2022) Online Grounding of Symbolic Planning Domains in Unknown Environments
Action and change	(ASPOCP 2022)
Action languages	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
action model learning	(KR 2022) Data Efficient Paradigms for Personalized Assessment of Taskable AI Systems
Actions	(IJCAR 2022) Actions over Core-closed Knowledge Bases
active action model learning	(KR 2022) Discovering User-Interpretable Capabilities of Black-Box Planning Agents
active learning	(LICS 2022) Active learning for sound negotiations
activity recognition systems	(PLP 2022) Online Reasoning under Uncertainty with the Event Calculus
Actual Causality	(CAV 2022) Explaining Hyperproperty Violations
acyclicity notions	(KR 2022) Chasing streams with existential rules
ad-hoc overloading	(ITP 2022) A Verified Cyclicity Checker
Adaptive Search Heuristic	(CP 2022) A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
additive combinatorics	(ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean
Administrative Discretion	(GDE 2022) Modeling Administrative Discretion Using Goal-Directed Answer Set Programming
adversarial contexts	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
adversarial robustness	(CAV 2022) Shared Certificates for Neural Network Verification (CSF 2022) Adversarial Robustness Verification and Attack Synthesis in Stochastic Systems
Adversarial Training	(CAV 2022) Neural Network Robustness as a Verification Property: A Principled Case Study
adversary argument	(ITP 2022) Formalizing Algorithmic Bounds in the Query Model in EasyCrypt
Agda	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities (FSCD 2022) Division by two, in homotopy type theory (HoTT/UF 2022)
Agent autonomy	(KR 2022) Act for Your Duties but Maintain Your Rights
agent interrogation	(KR 2022) Discovering User-Interpretable Capabilities of Black-Box Planning Agents (KR 2022) Data Efficient Paradigms for Personalized Assessment of Taskable AI Systems
agent programs	(XLoKR 2022) Using Abstraction for Interpretable Robot Programs in Stochastic Domains
aggregates	(ICLP 2022) Strong Equivalence of Logic Programs with Counting (ICLP 2022) Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
AI ethics	(Isabelle 2022) Automating Kantian Ethics in Isabelle: A Case Study
AI Safety	(SMT 2022) Goose: A Meta Solver for Deep Neural Network Verification
Airline scheduling	(ICLP 2022) A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem
ALC	(DL 2022) Fine-Grained Forgetting for the Description Logic ALC
algebra interpretations	(FSCD 2022) Cutting a Proof into Bite-Sized Chunks: Incrementally Proving Termination in Higher-Order Term Rewriting (WST22) Things WANDA cannot do
Algebraic Circuits	(LICS 2022) Identity testing for radical expressions
Algebraic Data Types	(ICLP 2022) Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
Algebraic Geometry	(LICS 2022) A functorial excursion between algebraic geometry and linear logic
algebraic graph rewriting	(TERMGRAPH 2022) A PBPO+ Graph Rewriting Tutorial
algebraic hierarchy	(ITP 2022) Use and abuse of instance parameters in the Lean mathematical library
Algebraic Measures	(NMR 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (NMR 2022) (DL 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
Algebraic Model Counting	(ICLP 2022) Efficient Knowledge Compilation Beyond Weighted Model Counting
algebraic number theory	(ITP 2022) Formalizing the ring of adèles of a global field
algebraic structures	(ITP 2022) Reflexive tactics for algebra, revisited
Algorithm Portfolio	(ModRef2022) A portfolio-based analysis method for competition results
Algorithm Selection	(ModRef2022) A portfolio-based analysis method for competition results (SMT 2022) Goose: A Meta Solver for Deep Neural Network Verification
Algorithms	(KR 2022) Matthias König's Thesis: Graph Parameters for Abstract Argumentation (CP 2022) All Questions Answered
almost stable matching	(CP 2022) Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
almost-sat	(SAT 2022) On the Parallel Parameterized Complexity of MaxSAT Variants (PDAR 2022) On the Parallel Parameterized Complexity of MaxSAT Variants
alpha-equivalence	(PAAR 2022) Reuse of Introduced Symbols in Automatic Theorem Provers (UNIF 2022) Nominal Anti-Unification of Letrec-Expressions
alphabetic equivalence	(LICS 2022) Size measures and alphabetic equivalence in the mu-calculus
amalgamation property	(iPRA 2022) Interpolation via Finitely Subdirectly Irreducible Algebras
Ambiguity	(GDE 2022) Modeling Administrative Discretion Using Goal-Directed Answer Set Programming
amortised cost analysis	(CAV 2022) Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
analytic tableaux	(iPRA 2022) When iota Meets lambda
Angluin algorithm	(LICS 2022) Active learning for sound negotiations
answer set	(ASPOCP 2022)
Answer Set Counting	(MC-2022) Rushing and Strolling among Answer Sets - Navigation Made Easy
Answer Set Navigation	(KR 2022) Rushing and Strolling among Answer Sets -- Navigation Made Easy (Extended Abstract) (MC-2022) Rushing and Strolling among Answer Sets - Navigation Made Easy
Answer Set Programming	(KR 2022) A General Framework for Stable Roommates Problems using Answer Set Programming (KR 2022) LACE: A Logical Approach to Collective Entity Resolution (KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming (KR 2022) Lifting Symmetry Breaking Constraints with Inductive Logic Programming (KR 2022) Rushing and Strolling among Answer Sets -- Navigation Made Easy (Extended Abstract) (KR 2022) Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework (KR 2022) Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings (KR 2022) Neural-Probabilistic Answer Set Programming (KR 2022) Computational Aspects of Structured Argumentation (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (GDE 2022) Embedding s(CASP) in Prolog (GDE 2022) A Hybrid Neuro-Symbolic Approach for Text-Based Games using Inductive Logic Programming (GDE 2022) Modeling Administrative Discretion Using Goal-Directed Answer Set Programming (GDE 2022) First order logic and commonsense reasoning: a path less travelled (ICLP 2022) Strong Equivalence of Logic Programs with Counting (ICLP 2022) Building Information Modeling using Constraint Logic Programming (ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data (ICLP 2022) An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases (ICLP 2022) Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (ICLP 2022) Efficient lifting of symmetry breaking constraints for complex combinatorial problems (ICLP 2022) Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling (ICLP 2022) On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model? (ICLP 2022) A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers (ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases (ICLP 2022) Solving Problems in PH with ASP(Q) (ICLP 2022) On Syntactic Forgetting under Uniform Equivalence (ICLP 2022) Large-Neighbourhood Search for ASP Optimisation (ICLP 2022) Rushing and Strolling among Answer Sets – Navigation Made Easy (ICLP 2022) Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming (ICLP 2022) Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers (ICLP 2022) ASP-Based Declarative Process Mining (ICLP 2022) Model Reconciliation in Logic Programs (ICLP 2022) A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem (ICLP 2022) Applications of Answer Set Programming to Smart Devices and Large Scale Reasoning (ICLP 2022) Transforming Gringo Rules into Formulas in a Natural Way (ICLP 2022) ApproxASP – A Scalable Approximate Answer Set Counter (ICLP 2022) Treewidth-aware Reductions of Normal ASP to SAT– Is Normal ASP Harder than SAT after All? (NMR 2022) Hybrid Anwer Set Programming: Opportunities and Challenges (DL 2022) Hybrid Anwer Set Programming: Opportunities and Challenges (MC-2022) Rushing and Strolling among Answer Sets - Navigation Made Easy
Answer Set Programming (ASP)	(ASPOCP 2022)
Answer set programming in dynamic domains	(ASPOCP 2022)
Answer Sets	(ICLP 2022) Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
answer-set programming	(KR 2022) ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (ASPOCP 2022) (ICLP 2022) A Neuro-Symbolic ASP Pipeline for Visual Question Answering
Anti-Unification	(IJCAR 2022) A framework for approximate generalization in quantitative theories (ONLINE) (FSCD 2022) Nominal Anti-Unification with Atom-Variables (UNIF 2022) Nominal Anti-Unification of Letrec-Expressions
Any-space Algorithms	(CP 2022) Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
Anytime MaxSAT	(SAT 2022) Introducing Intel(R) SAT Solver
API	(SAT 2022) Incremental Maximum Satisfiability
Application	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
Applications	(GDE 2022) GDE of ASP: applications, potential and future directions
Applied topology	(HoTT/UF 2022)
Approval Voting	(KR 2022) The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion
approximate counting	(ICLP 2022) ApproxASP – A Scalable Approximate Answer Set Counter
Approximate Reasoning	(UNIF 2022) Fuzzy Order-Sorted Feature Term Unification
Approximation Fixpoint Theory	(ICLP 2022) Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
Archive of Formal Proofs	(Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation
argument mining	(NMR 2022) Fallacious arguments: the place where Knowledge Representation and Argument Mining meet each other
Argumentation	(KR 2022) Forecasting Argumentation Frameworks (KR 2022) A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation (KR 2022) Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems (KR 2022) Computational Aspects of Structured Argumentation (NMR 2022) The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View (XLoKR 2022) Invited Talk: Explaining and Arguing with Facts and Rules (ABR 2022)
Argumentation and law	(GDE 2022) Automating Defeasible Reasoning in Law with Answer Set Programming
Argumentation Framework	(NMR 2022) Bipolar Argumentation Frameworks with Explicit Conclusions: Connecting Argumentation and Logic Programming
arithmetic	(LICS 2022) Geometric decision procedures and the VC dimension of linear arithmetic theories
Arithmetic Circuits	(SMT 2022) On Satisfiability of Polynomial Equations over Large Prime Fields
arithmetic constraints	(IJCAR 2022) CTL* model checking for data-aware dynamic systems with arithmetic
Arrays	(SMT 2022) CDSAT for nondisjoint theories with shared predicates: arrays with abstract length
Artificial Intelligence	(ICLP 2022) MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (ICLP 2022) Rushing and Strolling among Answer Sets – Navigation Made Easy (XLoKR 2022) Dialogue-Based Explanations of Reasoning in Rule-based Systems (WOLVERINE 2022)
Artin gluing	(FSCD 2022) Sheaf semantics of termination-insensitive noninterference (HoTT/UF 2022)
ASP	(ASPOCP 2022) (GDE 2022) A Query Evaluation Method for ASP with Abduction (GDE 2022) LTL Model Checking using Coinductive Answer Set programming (GDE 2022) Incremental Learning with Defeaters (GDE 2022) Tutorial: Automating Commonsense reasoning with ASP and s(CASP) (GDE 2022) GDE of ASP: applications, potential and future directions (ICLP 2022) Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP (ICLP 2022) Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended Abstract) (NMR 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (NMR 2022) (DL 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
ASPIC+	(KR 2022) Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework (KR 2022) Computational Aspects of Structured Argumentation
Assemblies	(HoTT/UF 2022)
Associativity	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic
Assume-Guarantee Synthesis	(CAV 2022) Information Flow Guided Synthesis
Assumption-based argumentation	(KR 2022) On Dynamics in Structured Argumentation Formalisms (KR 2022) Computational Aspects of Structured Argumentation (NMR 2022) Argumentation Frameworks induced by Assumption-based Argumentation: Relating Size and Complexity
assumption-based reasoning	(ASPOCP 2022) (PAAR 2022) QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers
assumptions	(ABR 2022) (ABR 2022) (SAT 2022) Incremental Maximum Satisfiability
Asynchronicity	(LICS 2022) Temporal Team Semantics Revisited
at least three keywords must be specified	(WST22) Certified Matchbox
attacker advantage	(CSF 2022) Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes
auditable solving	(CP 2022) Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming
authenticated encryption	(CSF 2022) Bringing State-Separating Proofs to EasyCrypt - A Security Proof for Cryptobox
authentication	(CSF 2022) Unlinkability of an Improved Key Agreement Protocol for EMV 2nd Gen Payments
automata	(KR 2022) Act for Your Duties but Maintain Your Rights (KR 2022) Verification and Realizability in Finite-Horizon Multiagent Systems (CAV 2022) Reasoning about Data Trees using CHCs (LICS 2022) Reasoning on Data Words over Numeric Domains (LICS 2022) Size measures and alphabetic equivalence in the mu-calculus
automata theory	(LICS 2022) The Regular Languages of First-Order Logic with One Alternation (LICS 2022) Temporal Team Semantics Revisited (FOMEO'22) Automata Tutor
automated algorithm configuration	(CP 2022) Improved Learning Bounds for Branch-and-Cut (CP 2022) A framework for generating informative benchmark instances
automated algorithm design	(CP 2022) Improved Learning Bounds for Branch-and-Cut
Automated Deduction	(KR 2022) Filippo De Bortoli - Reasoning Efficiently with Description Logics that Count (SYNT 2022) Towards Synthesis in Superposition
Automated ethics	(Isabelle 2022) Automating Kantian Ethics in Isabelle: A Case Study
automated grading	(FOMEO'22) Automata Tutor
automated instance generation	(CP 2022) A framework for generating informative benchmark instances
Automated planning	(ICLP 2022) Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers
automated planning and scheduling	(CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics (CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics
Automated proofs	(CSF 2022) A Complete Characterization of Security for Linicrypt Block Cipher Modes
Automated reasoning	(IJCAR 2022) GK: Implementing Full First Order Default Logic for Commonsense Reasoning (System Description) (IJCAR 2022) Lash 1.0 (System Description) (IJCAR 2022) Guiding an Automated Theorem Prover with Neural Rewriting (KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract) (KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (PAAR 2022) Automated Reasoning in Non-classical Logics in the TPTP World (SMT 2022) cvc5: A Versatile and Industrial-Strength SMT Solver (UNIF 2022) Higher-Order Unification with Definition by Cases (UNIF 2022) Unification types in modal logics (UNIF 2022) Unification Decision Procedures using Basic Narrowing modulo an Equational Theory
Automated Testing	(CAV 2022) Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers
automated theorem proving	(IJCAR 2022) Goéland : A Concurrent Tableau-Based Theorem Prover (System Description) (IJCAR 2022) Guiding an Automated Theorem Prover with Neural Rewriting (IJCAR 2022) Bayesian Ranking for Strategy Scheduling in Automated Theorem Provers (PAAR 2022) Optimal Strategy Schedules for Everyone (PAAR 2022) An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning (PAAR 2022) TBA (ITP 2022) The Isabelle ENIGMA (ARQNL 2022) Advancing Automated Theorem Proving for the Modal Logics D and S5 (ARQNL 2022) Solving QMLTP Problems by Translation to Higher-order Logic (PDAR 2022) Goéland : A Concurrent Tableau-Based Theorem Prover
Automatic Complexity Analysis	(FSCD 2022) mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity (VeriProp 2022) Inferring Expected Runtimes and Sizes (WST22) Improved Automatic Complexity Analysis of Integer Programs (WST22) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
Automatic program verification	(PAAR 2022) Exploring Representation of Horn clauses using GNNs
automatic reformulation	(ModRef2022) Solving XCSP3 constraint problems using tools from software verification
automatic structures	(LICS 2022) Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
automatic test-case reduction	(ITP 2022) Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq
automatic theorem proving	(Isabelle 2022) Lessons of Teaching Formal Methods with Isabelle (PAAR 2022) Reuse of Introduced Symbols in Automatic Theorem Provers (ITP 2022) Seventeen Provers under the Hammer
automatic verification	(CAV 2022) Sound Automation of Magic Wands
Automating Commonsense Reasoning	(GDE 2022) Tutorial: Automating Commonsense reasoning with ASP and s(CASP)
automation	(CP 2022) Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization (CAV 2022) Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (IWC 2022) On Confluence of Parallel-Innermost Term Rewriting (ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results (Coq2022) 10 Years of Superlinear Slowness in Coq
automatizability of proof systems	(PC 2022) Simulations between proof systems
Autonomous systems	(VeriProp 2022) Safe Sampling-Based Planning for Stochastic Systems with Uncertain Dynamics
auxiliary	(DL 2022) DL Opening Remarks
availability	(CSF 2022) Applying consensus and replication securely with FLAQR
Average-case complexity	(PC 2022) Average-Case Hardness of Proving Tautologies and Theorems
awards	(SAT 2022) awards / competitions event
axiom of choice	(FSCD 2022) Division by two, in homotopy type theory
Axiomatic Systems	(Isabelle 2022) On Axiomatic Systems for Classical Propositional Logic
B
back-and-forth method	(ITP 2022) Computational Back-and-Forth Arguments in Constructive Type Theory
back-translation	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
backdoor attack	(CAV 2022) Verifying Neural Networks Against Backdoor Attacks
backdoor depth	(CP 2022) CSP Beyond Tractable Constraint Languages
backdoor sets	(CP 2022) CSP Beyond Tractable Constraint Languages
Backdoors	(PCCR2022) Tractable Abstract Argumentation via Backdoor-Treewidth
Backreferences	(FSCD 2022) On Lookaheads in Regular Expressions with Backreferences
Backtracking	(SAT 2022) Introducing Intel(R) SAT Solver
Banach-Tarski	(ITP 2022) A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(r)
Bar Recursion	(LICS 2022) A direct computational interpretation of second-order arithmetic via update recursion
Basic education	(ThEdu'22) A Rule-Based Theorem Prover: an Introduction to Proofs at 7th Year
battle of Hercules and Hydra	(WST22) Hydra Battles and AC Termination
Bayesian Machine Learning	(IJCAR 2022) Bayesian Ranking for Strategy Scheduling in Automated Theorem Provers
Bayesian network classifiers	(KR 2022) Influence-Driven Explanations for Bayesian Network Classifiers
Bayesian Network Structure Learning	(CP 2022) Structured Set Variable Domains in Bayesian Network Structure Learning
BDD	(SAT 2022) (BDD event)
Behavioural equivalence	(LICS 2022) Graded Monads and Behavioural Equivalence Games
Belief	(NMR 2022) A situation-calculus model of Knowledge and Belief based on Thinking about Justifications
Belief Base	(KR 2022) Kernel Contraction and the Order of Relevance
belief base change	(KR 2022) Hyperintensional Partial Meet Contractions
Belief bases	(KR 2022) Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models
belief change	(KR 2022) An Axiomatic Approach to Revising Preferences (Extended Abstract) (KR 2022) Hyperintensional Partial Meet Contractions (KR 2022) Kernel Contraction and the Order of Relevance (KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs (NMR 2022) Truth-Tracking with Non-Expert Information Sources (NMR 2022) Trust Graphs for Belief Revision: Framework and Implementation (NMR 2022) Rectifying Classifiers (BCORE-22) (DL 2022) Rectifying Classifiers
Belief Contraction	(KR 2022) Kernel Contraction and the Order of Relevance
Belief Fusion	(KR 2022) The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion (KR 2022) Doctoral Consortium Application
Belief Merging	(KR 2022) Region-Based Merging of Open-Domain Terminological Knowledge (KR 2022) Who’s the Expert? On Multi-source Belief Revision (KR 2022) On Merging of Open-Domain Ontologies
Belief Revision	(KR 2022) On Paraconsistent Belief Revision in LP (Extended Abstract) (KR 2022) An Axiomatic Approach to Revising Preferences (Extended Abstract) (KR 2022) Iterated Belief Change, Computationally (KR 2022) Darwiche and Pearl's Epistemic States are not Total Preorders (KR 2022) Who’s the Expert? On Multi-source Belief Revision (KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs (KR 2022) Do Humans Find Postulates of Belief Change Plausible? (ICLP 2022) On Paraconsistent Belief Revision: the Case of Priest’s Logic of Paradox (NMR 2022) Repairing Ontologies via Kernel Pseudo-Contraction (NMR 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics (BCORE-22) (DL 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics (DL 2022) Repairing Ontologies via Kernel Pseudo-Contraction
belief update	(KR 2022) Do Humans Find Postulates of Belief Change Plausible?
benchmarking	(IJCAR 2022) Local Reductions for the Modal Cube (CP 2022) A framework for generating informative benchmark instances
benchmarks	(DL 2022) Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract) (PAAR 2022) TBA (SMT 2022) SMT-Lib Update Report (ASL 2022) Report on SL-COMP
Bernays–Schönfinkel Fragment	(IJCAR 2022) An Efficient Subsumption Test Pipeline for BS(LRA) Clauses
Beth Definability Property	(DL 2022) More on Interpolants and Explicit Definitions for Description Logics with Nominals and/or Role Inclusions
betterness relation	(NMR 2022) On some weakenings of transitivity in the logic of norms (extended abstract) (ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
Beyond NP	(ICLP 2022) Solving Problems in PH with ASP(Q)
bi-objective optimization	(SAT 2022) MaxSAT-Based Bi-Objective Boolean Optimization
Biased graphs	(PCCR2022) Resolving Inconsistency of Linear Equations
Bicategories	(FSCD 2022) A combinatorial approach to higher-order structure for polynomial functors
bidirected	(LICS 2022) The complexity of bidirected reachability in valence systems
big data	(ICLP 2022) Applications of Answer Set Programming to Smart Devices and Large Scale Reasoning (LMML 2022) MCP: Capturing Big Data by Satisfiability
binary codes	(IJCAR 2022) Binary codes that do not preserve primitivity
Binary Constraint Tree	(CP 2022) CNF Encodings of Binary Constraint Trees
Biological Systems	(ASPOCP 2022)
bipolar argumentation	(KR 2022) Explaining Causal Models with Argumentation: the Case of Bi-variate Reinforcement (NMR 2022) Bipolar Argumentation Frameworks with Explicit Conclusions: Connecting Argumentation and Logic Programming
bisimilarity	(LICS 2022) Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (CSF 2022) Unlinkability of an Improved Key Agreement Protocol for EMV 2nd Gen Payments
bisimulation	(DL 2022) Comonadic Semantics for Description Logics Games
bit pigeonhole principle	(PC 2022) Proof complexity of natural formulas via communication arguments
Bit-precise Reasoning	(SMT 2022) Bit-Precise Reasoning via Int-Blasting
Bit-vectors	(SMT 2022) Bit-Precise Reasoning via Int-Blasting
blackboard	(FOMEO'22) Tableaunoir: an online blackboard for teaching formal methods and making slides
Blake Canonical Form	(SAT 2022) A generalization of the Satisfiability Coding Lemma and its applications
Block cipher modes	(CSF 2022) A Complete Characterization of Security for Linicrypt Block Cipher Modes
blockchain	(CSF 2022) Contingent payments from two-party signing and verification for abelian groups
Boolean algebra	(LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability
Boolean algebras	(KR 2022) Compound conditionals as random quantities and Boolean algebras
boolean classifiers	(NMR 2022) Rectifying Classifiers (DL 2022) Rectifying Classifiers
boolean games	(KR 2022) Verification and Realizability in Finite-Horizon Multiagent Systems
Boolean Network Synthesis	(ASPOCP 2022)
Bounded arithmetic	(PC 2022) Proof complexity of CSP on algebras with linear congruence
bounded cliquewidth	(KR 2022) Ontology-Mediated Querying on Databases of Bounded Cliquewidth
bounded expansion	(LICS 2022) Treelike decompositions for transductions of sparse graphs
Bounded model checking	(CAV 2022) Proof-guided Underapproximation Widening for Bounded Model Checking
bounded value iteration	(VeriProp 2022) Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games
bounded-depth Frege	(LICS 2022) On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
boundedness problem	(LICS 2022) The boundedness and zero isolation problems for weighted automata over nonnegative rationals
bounds	(CP 2022) Acquiring Maps of Interrelated Conjectures on Sharp Bounds
BPMN	(TERMGRAPH 2022) Formalization and analysis of BPMN using graph grammars
branch-and-bound	(CP 2022) Improved Learning Bounds for Branch-and-Cut (CP 2022) Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
branch-and-cut	(CP 2022) Improved Learning Bounds for Branch-and-Cut
branching bisimulation	(PDAR 2022) A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
browser	(GDE 2022) s(CASP) Playground based on Ciao Prolog
Bryant	(SAT 2022) (BDD event)
bug minimizer	(ITP 2022) Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq
Building Design	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Building Information Modelling	(ICLP 2022) Building Information Modeling using Constraint Logic Programming
Bunched Logic	(ASL 2022) Labelled Tableaux for Linear Time Bunched Implication Logic
bundled fragment	(DECFOML2022) Are Bundles Good Deals for FOML?
business meeting	(DL 2022) Business Meeting
Büchi automata	(CAV 2022) FORQ-based Language Inclusion Formal Testing (CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition (CAV 2022) Complementing Büchi Automata with Ranker
C
Cache	(CP 2022) Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
cache coherence	(CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols
Calculus of Names	(IJCAR 2022) Le\'sniewski's Ontology -- Proof-Theoretic Characterization
Call by value	(TLLA-LINEARITY-2022)
Call-by-name	(FSCD 2022) Solvability for Generalized Applications
call-by-push-value	(FSCD 2022) Galois connecting call-by-value and call-by-name
Call-by-value	(FSCD 2022) Solvability for Generalized Applications
canonical structures	(ITP 2022) Reflexive tactics for algebra, revisited
canonicity	(FSCD 2022) A stratified approach to Lob induction
canonization	(LICS 2022) Choiceless Polynomial Time with Witnessed Symmetric Choice
capabilities	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
capability machines	(CSF 2022) Proving full-system security properties under multiple attacker models on capability machines
Cardinal Directional Calculus	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Cardinality Constraints	(KR 2022) Filippo De Bortoli - Reasoning Efficiently with Description Logics that Count
case study	(CP 2022) Plotting: A Planning Problem With Complex Transitions
Catamorphisms	(ICLP 2022) Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
Categorical models	(FSCD 2022) A combinatorial approach to higher-order structure for polynomial functors (TLLA-LINEARITY-2022)
categorical semantics	(FSCD 2022) Galois connecting call-by-value and call-by-name (TLLA-LINEARITY-2022) (LICS 2022) Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings (LICS 2022) Normalization for Multimodal Type Theory
categories with families	(HoTT/UF 2022)
Category	(LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
category theory	(TERMGRAPH 2022) PBPO+ Graph Rewriting in Context (DL 2022) Category-based Semantics for the Description Logic ALC and Reasoning (CAV 2022) The Lattice-Theoretic Essence of Property Directed Reachability Analysis (LICS 2022) The Pebble-Relation Comonad in Finite Model Theory
Cauchy integral formula	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
Cauchy-Goursat theorem	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
causal graph	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
causal graphs	(ASPOCP 2022)
causal inference	(MC-2022) Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
causality	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting (PLP 2022) Explainability, causality and computational and-or graphs (ABR 2022) (ABR 2022)
CDCL	(PC 2022) QCDCL with Cube Learning or Pure Literal Elimination – What is best? (PAAR 2022) A Two-Watched Literal Scheme for First-Order Logic (SAT 2022) Quantified CDCL with Universal Resolution
CDCL based Sampling	(MC-2022) Designing Samplers is Easy: The Boon of Testers
CDSAT	(SMT 2022) CDSAT for nondisjoint theories with shared predicates: arrays with abstract length
certificate checking	(ITP 2022) Dandelion: Certified Approximations of Elementary Functions
Certificates	(SAT 2022) Pedant: A Certifying DQBF Solver
certification	(WST22) CeTA — Efficient Certification of Termination Proofs (WST22) CeTA – A certifier for termCOMP 2022
Certified Algorithms	(FSCD 2022) A Certified Algorithm for AC-Unification
certifying algorithms	(CP 2022) Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming
characterization	(LICS 2022) Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Chase termination	(KR 2022) Normalisations of Existential Rules: Not so Innocuous!
Checked C	(CSF 2022) A Formal Model of Checked C
cheminformatics	(KR 2022) Structure-based ontology extensions
chi-boundedness	(LICS 2022) Stable graphs of bounded twin-width
Choice logics	(IJCAR 2022) Sequent Calculi for Choice Logics
choice operator	(UNIF 2022) Higher-Order Unification with Definition by Cases
Choice sequences	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
Choiceless Polynomial Time	(LICS 2022) Choiceless Polynomial Time with Witnessed Symmetric Choice
chordal graphs	(MC-2022) Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
choreography	(ITP 2022) Kalas: A Verified, End-to-End Compiler for a Choreographic Language
Chu construction	(TLLA-LINEARITY-2022)
Church encoding	(TERMGRAPH 2022) Ideograph: A Language for Expressing and Manipulating Structured Data
Church's thesis	(FSCD 2022) An Analysis of Tennenbaum's Theorem in Constructive Type Theory
Chvátal-Gomory cuts	(CP 2022) Improved Learning Bounds for Branch-and-Cut
circuit complexity	(LICS 2022) Complexity of Modular Circuits
circuit satisfiability	(LICS 2022) Complexity of Modular Circuits
Circular proofs	(FSCD 2022) Decision problems for linear logic with least and greatest fixed points (LICS 2022) Bouncing threads for circular and non-wellfounded proofs
Circumscription	(NMR 2022) Pointwise Circumscription in Description Logics (DL 2022) Pointwise Circumscription in Description Logics
class field theory	(ITP 2022) Formalizing the ring of adèles of a global field
Class hierarchy	(KR 2022) Learning Typed Rules over Knowledge Graphs
Classical Logic	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
Classical Model of Science (CMS)	(ASPOCP 2022)
classical planning	(KR 2022) Learning generalized policies without supervision using GNNs
classical realizability	(LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability
Classification	(DL 2022) Next Steps for ReAD: Modules for Classification Optimisation
classification instance	(PCCR2022) Learning Small Decision Trees (PCCR2022)
clausal tableaux	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
clause learning from simple models	(IJCAR 2022) SCL(EQ): SCL for First-Order Logic with Equality
clause redundancy	(IJCAR 2022) Clause Redundancy and Preprocessing in Maximum Satisfiability
clause sharing	(PDAR 2022) Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving
clique	(Isabelle 2022) From P != NP to monotone circuits of super-polynomial size
clique-width	(LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Closed Form	(WST22) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
closure redundancy	(IJCAR 2022) Ground joinability and connectedness in the superposition calculus
Cloud Security	(IJCAR 2022) Actions over Core-closed Knowledge Bases
Clustering	(KR 2022) Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings (XLoKR 2022) Clustering-Based Approaches for Symbolic Knowledge Extraction
CNF	(CP 2022) CNF Encodings of Binary Constraint Trees
CNF encoding	(SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
CNF translation	(SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
Co-stable Model Semantics	(ICLP 2022) Graph-based Interpretation of Normal Logic Programs
coalgebra	(VeriProp 2022) Probabilistic Guarded Kleene Algebra with Tests (LICS 2022) Graded Monads and Behavioural Equivalence Games (LICS 2022) Monoidal Streams for Dataflow Programming
Cognitive Reasoning	(MC-2022) Cognitive Reasoning in ASP
Cognitive robotics	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
coherence	(KR 2022) Compound conditionals as random quantities and Boolean algebras (LICS 2022) Syllepsis in Homotopy Type Theory
Coinduction	(GDE 2022) LTL Model Checking using Coinductive Answer Set programming (Isabelle 2022) On Termination for Hybrid Tableaux (LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
coinductive type	(WPTE 2022) Towards Corecursion Without Corecursion in Coq
collective attacks	(KR 2022) Rediscovering Argumentation Principles Utilizing Collective Attacks
Collective Entity Resolution	(KR 2022) LACE: A Logical Approach to Collective Entity Resolution
collusion-free protocols	(CSF 2022) Collusion-Preserving Computation without a Mediator
collusion-preserving protocols	(CSF 2022) Collusion-Preserving Computation without a Mediator
Color refinement algorithm	(CP 2022) Weisfeiler-Leman Invariant Promise Valued CSPs
Coloring	(KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents
Combination Problem	(FSCD 2022) Combined Hierarchical Matching: The Regular Case
combinatorial optimisation	(MC-2022) Stochastic Constraint Optimisation with Applications in Network Analysis
Combinatorial optimization	(CP 2022) Parallel Hybrid Best-First Search (CP 2022) Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation
combinatorial proofs	(FSCD 2022) Normalization without syntax
combinatorics	(KR 2022) Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation (ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean (ITP 2022) Formalising Fisher’s Inequality: Formal Linear Algebraic Techniques in Combinatorics
combinatorics on words	(Isabelle 2022) Auxiliary tools for Combinatorics on Words
combinators	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
combinatory logic	(FSCD 2022) On Quantitative Algebraic Higher-Order Theories
combining decision procedures	(CAV 2022) Reasoning about Data Trees using CHCs
Commonsense reasoning	(IJCAR 2022) GK: Implementing Full First Order Default Logic for Commonsense Reasoning (System Description) (GDE 2022) First order logic and commonsense reasoning: a path less travelled (ICLP 2022) Building Information Modeling using Constraint Logic Programming
Commutation	(IWC 2022) A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
Commutativity	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic
comonads	(DL 2022) Comonadic Semantics for Description Logics Games
compatibility	(ICLP 2022) Making ProB compatible with SICStus and SWI-Prolog
Competition	(IWC 2022) Confluence Competition (SMT 2022) SMT-COMP Report and Tool Presentations (SYNT 2022) SYNTCOMP Results (SYNT 2022) SyGuS-IF + SemGuS Results
competitions	(ModRef2022) A portfolio-based analysis method for competition results (SAT 2022) awards / competitions event
compilation	(ITP 2022) Kalas: A Verified, End-to-End Compiler for a Choreographic Language
compilation scheme	(DL 2022) Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract)
Compiler	(CSF 2022) A Formal Model of Checked C
compiler verification	(CAV 2022) SMT-based Translation Validation for Machine Learning Compiler (ITP 2022) Accelerating Verified-Compiler Development with a Verified Rewriting Engine
complementation	(CAV 2022) Complementing Büchi Automata with Ranker
complete proof system	(LICS 2022) Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
Complete Search Algorithms	(CP 2022) Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
Completeness	(IWC 2022) Uniform Completeness (iPRA 2022) When iota Meets lambda (ITP 2022) Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL (CSF 2022) Prophecy Variables for Hyperproperty Verification (Coq2022) A Coq Library for Mechanised First-Order Logic
Completeness guarantees	(CAV 2022) Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
Completeness/Soundness	(Isabelle 2022) On Axiomatic Systems for Classical Propositional Logic
Completion of an Ordering	(PCCR2022) Kemeny Rank Aggregation: Width Measure and Diversity Notion
complex analysis	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
Complexit and decidability	(UNIF 2022) Restricted Unification in the Description Logic FLbot
Complexity	(IJCAR 2022) Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems (KR 2022) A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation (KR 2022) Verification and Realizability in Finite-Horizon Multiagent Systems (KR 2022) Interpolants and Explicit Definitions in Extensions of the Description Logic EL (KR 2022) Matthias König's Thesis: Graph Parameters for Abstract Argumentation (Isabelle 2022) From P != NP to monotone circuits of super-polynomial size (NMR 2022) The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View (DECFOML2022) Forward Guarded Fragment: A tamed higher-arity extension of ALC (DL 2022) Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract) (DL 2022) Category-based Semantics for the Description Logic ALC and Reasoning (CP 2022) Complexity of Minimum-Size Arc-Inconsistency Explanations (LICS 2022) Stochastic Games with Synchronizing Objectives (LICS 2022) Reasoning on Data Words over Numeric Domains (LICS 2022) The complexity of bidirected reachability in valence systems (LICS 2022) The complexity of soundness in workflow nets (LICS 2022) Size measures and alphabetic equivalence in the mu-calculus (SYNT 2022) Complexity of Relational Query Synthesis (WST22) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (WST22) AProVE 2022 (WST22) CeTA – A certifier for termCOMP 2022
complexity analysis	(IJCAR 2022) Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) (IJCAR 2022) Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (KR 2022) LACE: A Logical Approach to Collective Entity Resolution (ICLP 2022) Treewidth-aware Reductions of Normal ASP to SAT– Is Normal ASP Harder than SAT after All? (LICS 2022) Quantum Expectation Transformers for Cost Analysis (WST22) Tuple Interpretations and Applications to Higher-Order Runtime Complexity (WST22) Runtime complexity of parallel-innermost term rewriting at TermComp 2022
component based modeling	(SMT 2022) NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems
composite event recognition	(KR 2022) Optimisation Methods for Complex Event Recognition
Compositional Synthesis	(CAV 2022) Information Flow Guided Synthesis
Compositional Verification	(ITP 2022) Compositional Verification of Interacting Systems using Event Monads
Compound conditionals	(KR 2022) Compound conditionals as random quantities and Boolean algebras
comprehensibility	(DL 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies
Computability	(KR 2022) Iterated Belief Change, Computationally
computability theory	(FSCD 2022) Certified Decision Procedures for Two-Counter Machines (ITP 2022) Synthetic Kolmogorov Complexity in Coq
Computable analysis	(LICS 2022) Computable PAC Learning of Continuous Features
computable isomorphisms	(ITP 2022) Computational Back-and-Forth Arguments in Constructive Type Theory
computational and-or graphs	(PLP 2022) Explainability, causality and computational and-or graphs
computational aspects of argumentation	(KR 2022) Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework
Computational Complexity	(KR 2022) Simulating Multiwinner Voting Rules in Judgment Aggregation (KR 2022) On Dynamics in Structured Argumentation Formalisms (KR 2022) Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework (KR 2022) Computational Aspects of Structured Argumentation (NMR 2022) Argumentation Frameworks induced by Assumption-based Argumentation: Relating Size and Complexity (DL 2022) Pointwise Circumscription in Description Logics (DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (LICS 2022) Identity testing for radical expressions
computational effect	(FSCD 2022) Galois connecting call-by-value and call-by-name
computational interpretation	(TERMGRAPH 2022) A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
Computational Law	(GDE 2022) Automating Defeasible Reasoning in Law with Answer Set Programming
computational models of argument	(NMR 2022) Fallacious arguments: the place where Knowledge Representation and Argument Mining meet each other
Computational Security	(CSF 2022) Cracking the Stateful Nut -- Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant
computer-aided cryptography	(CSF 2022) Bringing State-Separating Proofs to EasyCrypt - A Security Proof for Cryptobox
computer-assisted proof	(KR 2022) Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation
computer-checked proofs	(LICS 2022) Semantics for two-dimensional type theory (HoTT/UF 2022)
Computing Education	(ICLP 2022) A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers
computing explanations	(LMML 2022) TBA (LMML 2022) The Exciting Theory of Formal Explanations
computing termination probability	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
concentration inequalities	(ITP 2022) Mechanizing Soundness of Off-Policy Evaluation
Concept Referring Expressions	(DL 2022) Computing Concept Referring Expressions with Standard OWL Reasoners
conceptual design	(REAI 2022) (REAI 2022)
Concrete sheaves	(LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
concurrency	(IJCAR 2022) Goéland : A Concurrent Tableau-Based Theorem Prover (System Description) (FSCD 2022) Type-Based Termination for Futures (ITP 2022) Kalas: A Verified, End-to-End Compiler for a Choreographic Language (PDAR 2022) Goéland : A Concurrent Tableau-Based Theorem Prover (FOMEO'22) Teaching Concurrency with pseuCo Book
concurrency theory	(FOMEO'22) Teaching Concurrency with pseuCo Book
Concurrent Programs	(SYNT 2022) Interactive Debugging of Concurrent Programs under Relaxed Memory Models
Concurrent Separation Logic	(ITP 2022) Refinement of Parallel Algorithms down to LLVM (PDAR 2022) Refinement of Parallel Algorithms down to LLVM (ASL 2022) Proving Logical Atomicity using Lock Invariants (ASL 2022) Functional correctness specifications for concurrent data structures: Logical Atomicity in Iris
condensed detachment	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
Conditional belief base	(KR 2022) Inference with System W Satisfies Syntax Splitting
Conditional effects	(KR 2022) On the Expressive Power of Intermediate and Conditional Effects in Temporal Planning
conditional logic	(KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs
Conditional logics	(KR 2022) A conditional, a fuzzy and a probabilistic interpretation of self-organising maps (Abstract)
Conditional objects	(KR 2022) Compound conditionals as random quantities and Boolean algebras
conditional obligation	(ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
Conditional planning	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
Conditional previsions	(KR 2022) Compound conditionals as random quantities and Boolean algebras
conditional reasoning	(KR 2022) A General Framework for Modelling Conditional Reasoning - Preliminary Report (NMR 2022) Situated Conditionals - A Brief Introduction
Conditional Term Rewriting Systems	(IWC 2022) A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
Conditionals	(KR 2022) A Conditional Perspective for Reasoning, Revision and Relevance
Condorcet Jury Theorem	(KR 2022) The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion (KR 2022) Doctoral Consortium Application
Conflict Analysis	(ASPOCP 2022)
conflict management	(NMR 2022) Modelling Multiple Perspectives by Standpoint-Enhanced Description Logics
Conflict Resolution	(ASPOCP 2022)
Conflict-driven constraint learning	(ASPOCP 2022)
conflicts	(XLoKR 2022) Explaining Soft-Goal Conflicts through Constraint Relaxations
confluence	(FSCD 2022) Compositional Confluence Criteria (WPTE 2022) Transforming Text to (and from) XML (IWC 2022) Proving Confluence with CONFident (IWC 2022) A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems (IWC 2022) On local confluence of conditional rewrite systems (IWC 2022) Development Closed Critical Pairs: Towards a Formalized Proof (IWC 2022) On Confluence of Parallel-Innermost Term Rewriting (IWC 2022) Confluence Competition (WST22) CeTA – A certifier for termCOMP 2022
Conformance Checking	(ICLP 2022) ASP-Based Declarative Process Mining
congruence extension property	(iPRA 2022) Interpolation via Finitely Subdirectly Irreducible Algebras
Conjunctive Queries	(KR 2022) Unique Characterisability and Learnability of Temporal Instance Queries
Conjunctive query entailment	(KR 2022) Normalisations of Existential Rules: Not so Innocuous!
connectedness	(IJCAR 2022) Ground joinability and connectedness in the superposition calculus
connection structure calculus	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
Connection tableaux	(PAAR 2022) Lazy Paramodulation in Practice
consensus	(CSF 2022) Applying consensus and replication securely with FLAQR
consequence relations	(IJCAR 2022) Finite two-dimensional proof systems for non-finitely axiomatizable logics
conservative extensions	(KR 2022) Conservative Extensions for Existential Rules
consistency	(ICLP 2022) Tree-Like Justification Systems are Consistent
Consistency Checking	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
constant depth Frege	(PC 2022) An observation about (a)symmetries in LK_d proofs
constrained default logic	(ASPOCP 2022)
Constrained Horn Clauses	(ICLP 2022) Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (CAV 2022) Reasoning about Data Trees using CHCs (CAV 2022) SolCMC: Solidity Compiler’s Model Checker (SMT 2022) An SMT-LIB Theory of Heaps
Constrained Single-Row Facility Layout Problem	(CP 2022) Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
constrained term rewriting	(WPTE 2022) Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
constraint	(ICLP 2022) Building Information Modeling using Constraint Logic Programming (CP 2022) CNF Encodings of Binary Constraint Trees
Constraint Acquisition	(CP 2022) Constraint Acquisition Based on Solution Counting
Constraint and logic programming	(ModRef2022) Automatic Generation of Dominance Breaking Nogoods for Constraint Optimization
Constraint Horn clauses	(PAAR 2022) Exploring Representation of Horn clauses using GNNs
Constraint learning	(CP 2022) Learning Constraint Programming Models from Data using Generate-and-Aggregate (CP 2022) Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation
Constraint Modelling	(CP 2022) A framework for generating informative benchmark instances (CP 2022) Understanding how people approach constraint modelling and solving (ModRef2022) Constraint modelling and solving: Learning from observing people (ModRef2022) A Constraint-Based Tool for Generating Benchmark Instances
Constraint Optimisation Problems	(ModRef2022) Automatic Generation of Dominance Breaking Nogoods for Constraint Optimization
Constraint Optimization Problems	(CP 2022) Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization
constraint programming	(CP 2022) Sequence Variables for Routing Problems (CP 2022) Learning Constraint Programming Models from Data using Generate-and-Aggregate (CP 2022) Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming (CP 2022) Complexity of Minimum-Size Arc-Inconsistency Explanations (CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry (CP 2022) Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (CP 2022) Computing relaxations for the three-dimensional stable matching problem with cyclic preferences (CP 2022) Explaining Propagation for Gini and Spread with Variable Mean (CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling (CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (CP 2022) MDD-Based Constraint Programming in Haddock (ModRef2022) A portfolio-based analysis method for competition results (XLoKR 2022) Stepwise Explanations of Unsatisfiable Constraint Programs (Extended abstract) (MC-2022) Stochastic Constraint Optimisation with Applications in Network Analysis
Constraint propagation	(CP 2022) Complexity of Minimum-Size Arc-Inconsistency Explanations (CP 2022) Isomorphisms between STRIPS problems and sub-problems
constraint satisfaction	(CP 2022) On Redundancy in Constraint Satisfaction Problems (CP 2022) CSP Beyond Tractable Constraint Languages (ModRef2022) Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended abstract)
Constraint Satisfaction Problem	(CP 2022) A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
Constraint satisfaction problems	(PC 2022) Proof complexity of CSP on algebras with linear congruence (CP 2022) All Questions Answered
Constraint simplification	(CAV 2022) Distilling Constraints in Zero-Knowledge Protocols
constraint solving	(CAV 2022) Synthesizing Fair Decision Trees via Iterative Constraint Solving (CAV 2022) Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (SMT 2022) cvc5: A Versatile and Industrial-Strength SMT Solver
Constraint tableaux	(IJCAR 2022) Paraconsistent Gödel modal logic
Constraints	(ICLP 2022) Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming (ICLP 2022) ApproxASP – A Scalable Approximate Answer Set Counter (ICLP 2022) Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended Abstract) (ModRef2022) Constraint-based Part-of-Speech Tagging
Constraints translation	(KR 2022) Data Quality in Ontology-Based Data Access
constructive algebra	(HoTT/UF 2022)
constructive matemathics	(ITP 2022) Synthetic Kolmogorov Complexity in Coq
constructive mathematics	(FSCD 2022) Certified Decision Procedures for Two-Counter Machines
constructive type theory	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities (FSCD 2022) An Analysis of Tennenbaum's Theorem in Constructive Type Theory (ITP 2022) Synthetic Kolmogorov Complexity in Coq (ITP 2022) Computational Back-and-Forth Arguments in Constructive Type Theory
Contamination Constraints	(CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
Context-free languages	(LICS 2022) On the Satisfiability of Context-free String Constraints with Subword Ordering
continuous processes	(CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics (CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics
continuous reachability	(CAV 2022) Verifying generalised and structural soundness of workflow nets via relaxations
Contracts	(ICLP 2022) Verifying Catamorphism-Based Contracts using Constrained Horn Clauses
contrastive explanations	(CP 2022) Formal Explainable AI
control synthesis	(WOLVERINE 2022)
Control-Flow Refinement	(WST22) Improved Automatic Complexity Analysis of Integer Programs (WST22) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
Controlled Natural Language	(GDE 2022) Integration of Logical English and s(CASP)
controlled natural languages	(ICLP 2022) Knowledge Authoring with Factual English
Controller Synthesis	(CAV 2022) Playing Against Fair Adversaries in Stochastic Games with Total Rewards
convex polyhedra	(LICS 2022) Geometric decision procedures and the VC dimension of linear arithmetic theories
Cooperative agents	(NMR 2022) Modelling Agents Roles in the Epistemic Logic L-DINF
copy-discard categories	(LICS 2022) Probability monads with submonads of deterministic states
Coq	(FSCD 2022) Certified Decision Procedures for Two-Counter Machines (FSCD 2022) An Analysis of Tennenbaum's Theorem in Constructive Type Theory (CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols (WPTE 2022) Towards Corecursion Without Corecursion in Coq (WPTE 2022) A Machine-Checked Formalisation of Erlang Modules (ITP 2022) Synthetic Kolmogorov Complexity in Coq (ITP 2022) Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3,2) using the Coq Proof Assistant (ITP 2022) Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq (ITP 2022) Computational Back-and-Forth Arguments in Constructive Type Theory (ITP 2022) Undecidability of Dyadic First-Order Logic in Coq (ITP 2022) The Zoo of Lambda-Calculus Reduction Strategies, and Coq (ITP 2022) Reflexive tactics for algebra, revisited (ITP 2022) (Invited) Modelling and Verifying Properties of Biological Neural Networks (CSF 2022) Adversary Safety by Construction in a Language of Cryptographic Protocols (CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation (ARQNL 2022) Towards a Coq formalization of a quantified modal logic (HoTT/UF 2022) (Coq2022) jsCoq: Literate Proof Documents Dressed for the Web (Coq2022) Discussion with Coq Core Development Team (Coq2022) Coq Community Survey 2022: Summary of Results (Coq2022) 10 Years of Superlinear Slowness in Coq
Coq community	(Coq2022) Coq Community Survey 2022: Summary of Results
Coq library	(Coq2022) QuantumLib: A Library for Quantum Computing in Coq
coq plugin	(Coq2022) Autogenerating Natural Language Proofs
Coq-Elpi	(Coq2022) Trakt: a generic pre-processing tactic for theory-based proof automation
core extraction	(SAT 2022) Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
corecursive function	(WPTE 2022) Towards Corecursion Without Corecursion in Coq
correct-by-construction	(CAV 2022) Trainify: A CEGAR-Driven Training and Verification Framework for Verifiable Deep Reinforcement Learning
correction sets	(SAT 2022) Analysis of Core-Guided MaxSAT Using Cores and Correction Sets
correspondence	(ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
cost function network	(CP 2022) Parallel Hybrid Best-First Search
cost models	(LICS 2022) Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (LICS 2022) Reasonable Space for the Lambda-Calculus, Logarithmically
countably basic monad	(LICS 2022) Varieties of quantitative algebras and their monads
counter automata	(FSCD 2022) Certified Decision Procedures for Two-Counter Machines
counter systems	(IJCAR 2022) CTL* model checking for data-aware dynamic systems with arithmetic
Counterexamples	(CAV 2022) Explaining Hyperproperty Violations
counterfactual explanations	(XLoKR 2022) Should counterfactual explanations always be data instances?
Counterfactual Reasoning	(NMR 2022) Situated Conditionals - A Brief Introduction (CAV 2022) Explaining Hyperproperty Violations
Counterfactuals	(NMR 2022) Semantic Edits as Counterfactual Explanations (DL 2022) Semantic Edits as Counterfactual Explanations
countermodel construction	(IJCAR 2022) SAT-based Proof Search in Intermediate Propositional Logics
Counting Complexity	(MC-2022) Counting Complexity for Projected Reasoning in Abstract Argumentation
Counting Proof Systems	(SAT 2022) Proofs for Propositional Model Counting
Counting queries	(KR 2022) Counting queries over ELHI⊥ ontologies (DL 2022) Complexity Landscape for Counting Queries (Extended abstract)
covert channels	(CSF 2022) Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games
CPAchecker	(iPRA 2022) Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification
Craig interpolants	(DL 2022) More on Interpolants and Explicit Definitions for Description Logics with Nominals and/or Role Inclusions (iPRA 2022) Interpolants and Interference
Craig interpolation	(iPRA 2022) When iota Meets lambda (iPRA 2022) Application of Interpolation in Networks
Critical Pair	(IWC 2022) Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Critical Pairs	(IWC 2022) A Critical Pair Criterion for Level-Commutation of Conditional Term Rewriting Systems
cryptography	(ITP 2022) Accelerating Verified-Compiler Development with a Verified Rewriting Engine (CSF 2022) Adversary Safety by Construction in a Language of Cryptographic Protocols
CS education	(Coq2022) Autogenerating Natural Language Proofs
CS-TRSs	(IWC 2022) Proving Confluence with CONFident
CTL*	(IJCAR 2022) CTL* model checking for data-aware dynamic systems with arithmetic
CTRSs	(IWC 2022) Proving Confluence with CONFident
cube-and-conquer	(PDAR 2022) Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems
cubical sets	(HoTT/UF 2022)
Cubical Type Theory	(LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Curry-Howard	(LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability
Curry-Howard correspondence	(FSCD 2022) Normalization without syntax (TERMGRAPH 2022) A Computational Interpretation of Girard’s Intuitionistic Proof-Nets (LICS 2022) Bouncing threads for circular and non-wellfounded proofs (LICS 2022) Curry and Howard Meet Borel
Cut Elimination	(IJCAR 2022) Le\'sniewski's Ontology -- Proof-Theoretic Characterization (FSCD 2022) A Graphical Proof Theory of Logical Time (LICS 2022) Bouncing threads for circular and non-wellfounded proofs
cut-elimination	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic
cutting planes	(CP 2022) Improved Learning Bounds for Branch-and-Cut (CP 2022) An Auditable Constraint Programming Solver (SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
cyclic dependencies	(KR 2022) Stream Reasoning with Cycles
cyclic proof	(WPTE 2022) On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs
Cyclic proofs	(IJCAR 2022) Cyclic Proofs, Hypersequents, and Transitive Closure Logic (LICS 2022) Cyclic Implicit Complexity
cyclicity	(ITP 2022) A Verified Cyclicity Checker
cylindrical algebraic coverings	(IJCAR 2022) Cooperating Techniques for Solving nonlinear arithmetic in the cvc5 SMT solver (System Description)
D
d-privacy	(CSF 2022) Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes
Darwiche-Pearl	(KR 2022) Iterated Belief Change, Computationally
Data analysis	(IJCAR 2022) Synthetic tableaux: minimal tableau search heuristics
data federation	(DL 2022) (DL 2022) Ontology-based Data Federation (Extended Abstract)
data graphs	(ICLP 2022) Jumping Evaluation of Nested Regular Path Queries
data logics	(CAV 2022) Reasoning about Data Trees using CHCs
Data mining	(ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
Data Quality	(KR 2022) Data Quality in Ontology-Based Data Access
data representation	(TERMGRAPH 2022) Ideograph: A Language for Expressing and Manipulating Structured Data
Data Structures	(ASL 2022) Deciding Separation Logic with Heap Lists
Data Transfer	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
data words	(LICS 2022) Reasoning on Data Words over Numeric Domains
data-driven algorithm design	(CP 2022) Improved Learning Bounds for Branch-and-Cut
Data-driven invariant learning	(CAV 2022) Data-Driven Invariant Learning for Probabilistic Programs
Data-driven methods	(CAV 2022) Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
databases	(DL 2022) Ontology-based Data Federation (Extended Abstract)
dataflow programming	(LICS 2022) Monoidal Streams for Dataflow Programming
Datalog	(KR 2022) On the Relationship between Shy and Warded Datalog+/- (KR 2022) Faithful Approaches to Rule Learning (ASPOCP 2022) (ICLP 2022) MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (ICLP 2022) Jumping Evaluation of Nested Regular Path Queries
Datalog rules	(KR 2022) Revisiting Semiring Provenance for Datalog
Datalog±	(ICLP 2022) MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations
DCOP	(CP 2022) Completeness Matters: Towards Efficient Caching in Tree-based Synchronous Backtracking Search for DCOPs
DDoS attacks	(CSF 2022) N-Tube: Formally Verified Secure Bandwidth Reservation in Path-Aware Internet Architectures
debugging	(XLoKR 2022) Stepwise Explanations of Unsatisfiable Constraint Programs (Extended abstract) (ITP 2022) Automatic Test-Case Reduction in Proof Assistants: A Case Study in Coq (SYNT 2022) Interactive Debugging of Concurrent Programs under Relaxed Memory Models
decidability	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic (IJCAR 2022) Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems (FSCD 2022) Certified Decision Procedures for Two-Counter Machines (DECFOML2022) Decidability Questions beyond Satisfiability for First-order Modal Logics (DECFOML2022) Are Bundles Good Deals for FOML? (DECFOML2022) The Quantified Reflection Calculus as a Modal Logic (DECFOML2022) Decidable Fragments of Term Modal Logic (DL 2022) Charting the Borderland – Decidability in Description Logics and Beyond (LICS 2022) Bouncing threads for circular and non-wellfounded proofs (LICS 2022) The complexity of bidirected reachability in valence systems (LICS 2022) On the Skolem Problem and the Skolem Conjecture (CSF 2022) A small bound on the number of sessions for security protocols
decidable fragments	(DL 2022) Charting the Borderland – Decidability in Description Logics and Beyond
Decidable Subclasses	(IJCAR 2022) Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (WST22) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
deciding almost sure termination	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
decision diagrams	(CP 2022) Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (CP 2022) Heuristics for MDD Propagation in Haddock (CP 2022) Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
decision procedure	(PAAR 2022) Exploring Partial Models with SCL (SAT 2022) Quantifier Elimination in Stochastic Boolean Satisfiability (SAT 2022) Pedant: A Certifying DQBF Solver (WST22) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity (ASL 2022) Deciding Separation Logic with Heap Lists
decision tree	(CAV 2022) Synthesizing Fair Decision Trees via Iterative Constraint Solving
Decision trees	(CP 2022) Structured Set Variable Domains in Bayesian Network Structure Learning
Declarative Framework	(KR 2022) LACE: A Logical Approach to Collective Entity Resolution
declarative modeling language	(CP 2022) MDD-Based Constraint Programming in Haddock
declarative problem solving	(KR 2022) A General Framework for Stable Roommates Problems using Answer Set Programming
Declarative Process Mining	(ICLP 2022) ASP-Based Declarative Process Mining
declarative programming	(KR 2022) Computational Aspects of Structured Argumentation (ASPOCP 2022)
Decomposition	(ICLP 2022) Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
decreasing diagrams	(FSCD 2022) Compositional Confluence Criteria
Deducibility	(UNIF 2022) Graph-Embedded Term Rewrite Systems and Applications (A Preliminary Report)
Deductive Database Method	(ThEdu'22) Rule Based Geometry Automated Theorem Provers
Deductive database method for geometry	(ThEdu'22) A Rule-Based Theorem Prover: an Introduction to Proofs at 7th Year
deductive interpolation property	(iPRA 2022) Interpolation via Finitely Subdirectly Irreducible Algebras
Deductive System	(KR 2022) A Minimal Deductive System for RDFS with Negative Statements
Dedukti	(FSCD 2022) Adequate and computational encodings in the logical framework Dedukti (PAAR 2022) EuroProofNet presentation on proofs in Dedukti
Deep Embedding	(ITP 2022) Deeper Shallow Embeddings
deep generative models	(SAT 2022) On the performance of deep generative models of realistic SAT instances
Deep inference	(FSCD 2022) A Graphical Proof Theory of Logical Time (FSCD 2022) A Methodology for Designing Proof Search Calculi for Non-Classical Logics
deep learning	(KR 2022) Structure-based ontology extensions (ICLP 2022) Exploiting Parameters Learning for Hyper-parameters Optimization in Deep Neural Networks (NMR 2022) There and Back Again: Combining Nonmonotonic Logical Reasoning and Deep Learning on an Assistive Robot (SAT 2022) On the performance of deep generative models of realistic SAT instances (SYNT 2022) LTL Synthesis with Transformer Neural Networks
Deep Learning Compiler	(CAV 2022) SMT-based Translation Validation for Machine Learning Compiler
deep neural networks	(WOLVERINE 2022)
Deep Probabilistic Modelling	(KR 2022) Neural-Probabilistic Answer Set Programming
Deep Probabilistic Programming Languages	(KR 2022) Neural-Probabilistic Answer Set Programming
Deep reinforcement learning	(CAV 2022) Trainify: A CEGAR-Driven Training and Verification Framework for Verifiable Deep Reinforcement Learning
Default logic	(IJCAR 2022) GK: Implementing Full First Order Default Logic for Commonsense Reasoning (System Description) (GDE 2022) First order logic and commonsense reasoning: a path less travelled
Defeasible and preferential logics	(KR 2022) A conditional, a fuzzy and a probabilistic interpretation of self-organising maps (Abstract)
Defeasible Knowledge	(NMR 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (NMR 2022) (DL 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
defeasible reasoning	(KR 2022) A General Framework for Modelling Conditional Reasoning - Preliminary Report (GDE 2022) Automating Defeasible Reasoning in Law with Answer Set Programming (NMR 2022) Situated Conditionals - A Brief Introduction (NMR 2022) From Weighted Conditionals to a Gradual Argumentation Semantics and back (NMR 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (NMR 2022) Defeasible reasoning in RDFS (NMR 2022) Conditional Syntax Splitting, Lexicographic Entailment and the Drowning Effect (DL 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (DL 2022) Defeasible reasoning in RDFS
Defeat Notions	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach
Defeaters	(GDE 2022) Incremental Learning with Defeaters
Defense Notions	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach
definability	(KR 2022) Interpolants and Explicit Definitions in Extensions of the Description Logic EL (DECFOML2022) Decidability Questions beyond Satisfiability for First-order Modal Logics
definite descriptions	(iPRA 2022) When iota Meets lambda
definition by cases	(UNIF 2022) Higher-Order Unification with Definition by Cases
Definition Variables	(QBF2022)
definitions	(IJCAR 2022) Implicit Definitions with Differential Equations for KeYmaera X (System Description) (ITP 2022) A Verified Cyclicity Checker
degrees of explainability	(ASPOCP 2022)
Delegate Reasoner	(DL 2022) Next Steps for ReAD: Modules for Classification Optimisation
Denotational semantics	(FSCD 2022) A combinatorial approach to higher-order structure for polynomial functors (FSCD 2022) Sheaf semantics of termination-insensitive noninterference (VeriProp 2022) Verifying Probabilistic Programs using Generating Functions (TLLA-LINEARITY-2022) (CAV 2022) Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions (LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks (LICS 2022) Probability monads with submonads of deterministic states
density	(LICS 2022) Computing the Density of the Positivity Set for Linear Recurrence Sequences
deontic cube	(ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
Deontic Logic	(KR 2022) Dynamic Deontic Logic for Permitted Announcements (KR 2022) Deontic Logic for Epistemic Actions (Isabelle 2022) Automating Kantian Ethics in Isabelle: A Case Study
dependency pairs	(FSCD 2022) Cutting a Proof into Bite-Sized Chunks: Incrementally Proving Termination in Higher-Order Term Rewriting (WST22) Things WANDA cannot do
dependency trees	(ICLP 2022) A Gaze into the Internal Logic of Graph Neural Networks, with Logic
dependent right adjoints	(LICS 2022) Normalization for Multimodal Type Theory
dependent type theory	(FSCD 2022) A stratified approach to Lob induction (ITP 2022) Deeper Shallow Embeddings (ITP 2022) Use and abuse of instance parameters in the Lean mathematical library
dependent types	(WPTE 2022) Towards a Refactoring Tool for Dependently-Typed Programs (work in progress) (UNIF 2022) Higher-order unification from E-unification with second-order equations and parametrised metavariables
Description Logic	(IJCAR 2022) Evonne: Interactive Proof Visualization for Description Logics (System Description) (IJCAR 2022) Actions over Core-closed Knowledge Bases (KR 2022) Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs (KR 2022) Unique Characterisability and Learnability of Temporal Instance Queries (KR 2022) Ontology-Mediated Querying on Databases of Bounded Cliquewidth (KR 2022) Interpolants and Explicit Definitions in Extensions of the Description Logic EL (DECFOML2022) Forward Guarded Fragment: A tamed higher-arity extension of ALC (DL 2022) Fine-Grained Forgetting for the Description Logic ALC (DL 2022) More on Interpolants and Explicit Definitions for Description Logics with Nominals and/or Role Inclusions (DL 2022) A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals (DL 2022) Advanced languages of terms for ontologies
Description Logic EL	(IJCAR 2022) Hyper-graph based Inference Rules for Computing EL+-Ontology Justifications (IJCAR 2022) Connection-minimal Abduction in EL via translation to FOL (DL 2022) Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract) (DL 2022) Connection-minimal Abduction in EL via translation to FOL (Extended Abstract)
Description Logics	(KR 2022) Counting queries over ELHI⊥ ontologies (KR 2022) Decidability Limits of Finite Ontology-Mediated Query Entailment (KR 2022) Filippo De Bortoli - Reasoning Efficiently with Description Logics that Count (NMR 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (NMR 2022) Repairing Ontologies via Kernel Pseudo-Contraction (NMR 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (NMR 2022) (NMR 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results (NMR 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics (NMR 2022) Pointwise Circumscription in Description Logics (NMR 2022) Semantic Edits as Counterfactual Explanations (BCORE-22) (BCORE-22) (DL 2022) Rule-Based Explanations using Knowledge Graphs (DL 2022) Complexity Landscape for Counting Queries (Extended abstract) (DL 2022) SAT-Based Axiom Pinpointing Revisited (DL 2022) Computing Concept Referring Expressions with Standard OWL Reasoners (DL 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (DL 2022) Accessing Document Data Sources using Referring Expression Types (DL 2022) Concept Abduction for Description Logics (DL 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics (DL 2022) Semantic Edits as Counterfactual Explanations (DL 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results (DL 2022) An API for DL Abduction Solvers (DL 2022) Uniform and Modular Sequent Systems for Description Logics (DL 2022) Repairing Ontologies via Kernel Pseudo-Contraction (DL 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (DL 2022) Charting the Borderland – Decidability in Description Logics and Beyond (DL 2022) Knowledge Extraction Based on Forgetting and Subontology Generation (XLoKR 2022) An API for DL Abduction Solvers (XLoKR 2022) Explaining Description Logic Entailments in Practice with Evee and Evonne (ARQNL 2022) Reasoning in Non-normal Modal Description Logics (FOMEO'22) SIVA: Simulation and visualization of the DL tableau algorithm
Description logics with fixpoints	(KR 2022) Sticky Policies in OWL2: Extending PL with fixpoints and Transitive Closure
Description logics with transitive role closure	(KR 2022) Sticky Policies in OWL2: Extending PL with fixpoints and Transitive Closure
Descriptive Complexity	(LICS 2022) The Regular Languages of First-Order Logic with One Alternation (LICS 2022) Separating LREC from LFP
Design Automation	(SAT 2022) Towards a SAT Encoding for Quantum Circuits
deterministic hierarchies	(LICS 2022) The amazing mixed polynomial closure and its applications to two-variable first-order logic
Determinization	(CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
development closed critical pairs	(IWC 2022) Development Closed Critical Pairs: Towards a Formalized Proof
Diagonalizable matrices	(IJCAR 2022) On eventual non-negativity and positivity for the weighted sum of powers of matrices
Diagrammatic language	(FSCD 2022) Addition and differentiation of ZX-diagrams
Dial A Ride	(CP 2022) Sequence Variables for Routing Problems
dialectical explanations	(KR 2022) Influence-Driven Explanations for Bayesian Network Classifiers
Dialogue For Explanation	(XLoKR 2022) Dialogue-Based Explanations of Reasoning in Rule-based Systems
dichotomy theorem	(LICS 2022) Smooth approximations and CSPs over finitely bounded homogeneous structures
Difference logic	(ICLP 2022) Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP
Differential Categories	(TLLA-LINEARITY-2022)
differential dynamic logic	(IJCAR 2022) Implicit Definitions with Differential Equations for KeYmaera X (System Description)
Differential linear logic	(TLLA-LINEARITY-2022) (TLLA-LINEARITY-2022)
differential privacy	(CSF 2022) Interpreting Epsilon of Differential Privacy in Terms of Advantage in Guessing or Approximating Sensitive Attributes (CSF 2022) The Complexity of Verifying Boolean Programs as Differentially Private
Digital Forensics	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Digital ICs	(CSF 2022) Locked Circuit Indistinguishability: A Notion of Security for Logic Locking
digraphs	(CP 2022) Acquiring Maps of Interrelated Conjectures on Sharp Bounds
Dijkstra commands	(FOMEO'22) Visualization of structural operational semantics over programs of simple imperative language.
diophantine equations	(WST22) DEPP
diophantine sets	(ITP 2022) Formalizing the set of primes as an alternative to the DPRM theorem (short paper)
directed acyclic graphs	(MC-2022) Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
directed type theory	(HoTT/UF 2022)
Discrete Morse theory	(HoTT/UF 2022)
Discrete Optimization	(CP 2022) Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams (CP 2022) Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
disjointness	(PC 2022) Proof complexity of natural formulas via communication arguments
disjunctive programs	(ICLP 2022) Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo
Disjunctive Rules	(ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
Display calculus	(FSCD 2022) A Methodology for Designing Proof Search Calculi for Non-Classical Logics
distance bounding	(CSF 2022) Is Eve nearby? Analysing protocols under the distant-attacker assumption
distant attacker	(CSF 2022) Is Eve nearby? Analysing protocols under the distant-attacker assumption
Distributed algorithms	(CP 2022) Weisfeiler-Leman Invariant Promise Valued CSPs
distributed automata	(LICS 2022) Active learning for sound negotiations
Distributed Synthesis	(CAV 2022) Information Flow Guided Synthesis
Distributed Systems	(CAV 2022) Information Flow Guided Synthesis
Distribution semantics	(ICLP 2022) Abduction in Probabilistic Logic Programs
distributive laws	(FSCD 2022) Stateful Structural Operational Semantics
divergence theorem	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
Diversity of Solutions	(PCCR2022) Kemeny Rank Aggregation: Width Measure and Diversity Notion
Divide-and-Conquer	(CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
division	(FSCD 2022) Division by two, in homotopy type theory
DL	(DL 2022) DL Opening Remarks
DL Workshop	(DL 2022) Business Meeting
DL-Lite	(DL 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies
DL-Lite-Horn	(DL 2022) Actively Learning ELIQs in the Presence of DL-Lite-Horn Ontologies
DLV	(KR 2022) On the Relationship between Shy and Warded Datalog+/-
document stores	(DL 2022) Accessing Document Data Sources using Referring Expression Types
domain-specific language	(CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols
domain-specific languages	(WPTE 2022) Refactoring Steps for P4 (work in progress)
Domains	(LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Dominance Breaking	(CP 2022) Exploiting Functional Constraints in Generating Dominance Breaking Nogoods for Constraint Optimization (ModRef2022) Automatic Generation of Dominance Breaking Nogoods for Constraint Optimization
dot-depth hierarchy	(LICS 2022) The Regular Languages of First-Order Logic with One Alternation
double push out approach	(TERMGRAPH 2022) PBPO+ Graph Rewriting in Context
double pushout approach	(TERMGRAPH 2022) Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
DP-3T	(CSF 2022) Privacy as Reachability
DPRM theorem	(ITP 2022) Formalizing the set of primes as an alternative to the DPRM theorem (short paper)
DQBF	(SAT 2022) Pedant: A Certifying DQBF Solver
DQBF Solver	(SAT 2022) Pedant: A Certifying DQBF Solver
DRAT proofs	(iPRA 2022) Interpolants and Interference
dyadic deontic logic	(NMR 2022) On some weakenings of transitivity in the logic of norms (extended abstract) (ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
Dynamic consistency checking	(ICLP 2022) Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming
Dynamic Deontic Logic	(KR 2022) Dynamic Deontic Logic for Permitted Announcements
Dynamic epistemic logic	(KR 2022) Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models (KR 2022) Deontic Logic for Epistemic Actions
Dynamic Programming	(PCCR2022) Parameterized Algorithmics and Counting: Treewidth in Practice
dynamic release	(CSF 2022) Towards a General-Purpose Dynamic Information Flow Policy
dynamic symmetry breaking	(SAT 2022) A SAT Attack on Rota's Basis Conjecture
Dynamics in Argumentation	(KR 2022) On Dynamics in Structured Argumentation Formalisms
E
E-unification	(UNIF 2022) Higher-order unification from E-unification with second-order equations and parametrised metavariables
E-voting	(CSF 2022) Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co
EasyCrypt	(ITP 2022) Formalizing Algorithmic Bounds in the Query Model in EasyCrypt
Eckmann-Hilton	(LICS 2022) Syllepsis in Homotopy Type Theory
education	(FOMEO'22) Automata Tutor (FOMEO'22) Teaching Concurrency with pseuCo Book
Effective algorithms	(IJCAR 2022) On eventual non-negativity and positivity for the weighted sum of powers of matrices
Efficient reasoning	(DL 2022) Efficient TBox Reasoning with Value Restrictions using the FL0wer Reasoner (Extended Abstract)
Eisbach method	(Isabelle 2022) Auxiliary tools for Combinatorics on Words
EKE	(CSF 2022) Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
EL	(NMR 2022) Connection-Minimal Abduction in EL via Translation to FOL
EL ontologies	(DL 2022) Reasoning about actions with EL ontologies in a temporal action theory (Extended Abstract)
Electric power network	(CP 2022) Scheduling the Equipment Maintenance of an Electric Power Transmission Network using Constraint Programming
Electron	(Isabelle 2022) Isabelle/VSCode and Electron/Node.js as emerging Isabelle technologies
electronic voting	(CSF 2022) How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis
element-free probabilities	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
elementary computation	(PC 2022) Towards higher order proof complexity
elementary functions	(ITP 2022) Dandelion: Certified Approximations of Elementary Functions
Elpi	(ITP 2022) Reflexive tactics for algebra, revisited
Emaj-SAT	(SAT 2022) A New Exact Solver for (Weighted) Max#SAT
embarrassingly parallel search	(CP 2022) Parallel Hybrid Best-First Search
Embedding Space	(KR 2022) Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings
Emerson-Lei acceptance	(CAV 2022) From Spot 2.0 to Spot 2.10: What's New?
Emerson-Lei automata	(CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
emptiness	(FSCD 2022) Restricting tree grammars with term rewriting
Emscripten	(GDE 2022) s(CASP) Playground based on Ciao Prolog
emulation	(ICLP 2022) Making ProB compatible with SICStus and SWI-Prolog
encoding	(SAT 2022) The packing chromatic number of the infinite square grid is at least 14
Enforcement	(KR 2022) On Dynamics in Structured Argumentation Formalisms
enriched monad	(LICS 2022) Varieties of quantitative algebras and their monads
entailment	(IJCAR 2022) Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems
Entailment problem	(ASL 2022) Two Results on Separation Logic With Theory Reasoning
Enthymemes	(KR 2022) Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems
Entropy Estimation	(CAV 2022) A Scalable Shannon Entropy Estimator
enumeration	(PC 2022) Are Hitting Formulas Hard for Resolution?
Epistemic Deontic Logic	(KR 2022) Dynamic Deontic Logic for Permitted Announcements
Epistemic logic	(KR 2022) Epistemic Actions: Comparing Multi-agent Belief Bases with Action Models (KR 2022) The Topology of Surprise (KR 2022) Deontic Logic for Epistemic Actions
Epistemic Logics	(NMR 2022) Modelling Agents Roles in the Epistemic Logic L-DINF
Epistemic State	(KR 2022) Iterated Belief Change, Computationally
Epistemic States	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing (KR 2022) Darwiche and Pearl's Epistemic States are not Total Preorders
epistemic uncertainty	(ICLP 2022) Inference and Learning with Model Uncertainty in Probabilistic Logic Programs
equational logic	(LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
equational theories	(CSF 2022) Contingent payments from two-party signing and verification for abelian groups
equational unification	(IJCAR 2022) Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)
equivalence	(IWC 2022) Formalized Signature Extension Results for Equivalence
Erlang	(WPTE 2022) A Machine-Checked Formalisation of Erlang Modules
Ethereum	(CAV 2022) SolCMC: Solidity Compiler’s Model Checker (SMT 2022) On Satisfiability of Polynomial Equations over Large Prime Fields
Ethereum 2.0	(CSF 2022) Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing
Ethical Reasoning	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
Euclidean Geometry	(ThEdu'22) A Rule-Based Theorem Prover: an Introduction to Proofs at 7th Year
EuroProofNet	(PAAR 2022) EuroProofNet presentation on SMT and proofs (PAAR 2022) EuroProofNet presentation on proofs in Dedukti
evaluation	(IJCAR 2022) Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description) (LICS 2022) Efficient Construction of Reversible Transducers from Regular Transducer Expressions
evaluation order	(FSCD 2022) Galois connecting call-by-value and call-by-name
Event Calculus	(KR 2022) Stream Reasoning with Cycles (KR 2022) Optimisation Methods for Complex Event Recognition (ICLP 2022) Stream Reasoning with Deadlines (ICLP 2022) Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended Abstract) (PLP 2022) Online Reasoning under Uncertainty with the Event Calculus
Events	(ITP 2022) Compositional Verification of Interacting Systems using Event Monads
Eventual non-negativity	(IJCAR 2022) On eventual non-negativity and positivity for the weighted sum of powers of matrices
everybody	(Isabelle 2022) Welcome
Ewens distribution	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
exact computation	(MC-2022) Heuristic computation of exact treewidth - some improvements and more experimental evaluations
Exact Learning	(KR 2022) Unique Characterisability and Learnability of Temporal Instance Queries (DL 2022) Actively Learning ELIQs in the Presence of DL-Lite-Horn Ontologies
existential rules	(KR 2022) Normalisations of Existential Rules: Not so Innocuous! (KR 2022) Chasing streams with existential rules (KR 2022) Conservative Extensions for Existential Rules (KR 2022) Data Quality in Ontology-Based Data Access (ICLP 2022) Efficient Datalog Rewriting for Query Answering in TGD Ontologies
expectation transformer	(LICS 2022) Quantum Expectation Transformers for Cost Analysis
Expected runtime	(LICS 2022) Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Expected Runtimes	(VeriProp 2022) Inferring Expected Runtimes and Sizes
Expected Sizes	(VeriProp 2022) Inferring Expected Runtimes and Sizes
experimental evaluation	(SMT 2022) Trail saving in SMT
experiments	(DL 2022) Efficient TBox Reasoning with Value Restrictions using the FL0wer Reasoner (Extended Abstract) (DL 2022) Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract)
Expert Systems	(GDE 2022) Blawx: Web-based user-friendly Rules as Code
expertise	(KR 2022) Who’s the Expert? On Multi-source Belief Revision (NMR 2022) Truth-Tracking with Non-Expert Information Sources
Explainability	(NMR 2022) Semantic Edits as Counterfactual Explanations (DL 2022) Semantic Edits as Counterfactual Explanations (PLP 2022) Explainability, causality and computational and-or graphs (WOLVERINE 2022)
Explainable AI	(KR 2022) Influence-Driven Explanations for Bayesian Network Classifiers (KR 2022) Explaining Causal Models with Argumentation: the Case of Bi-variate Reinforcement (KR 2022) Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO (GDE 2022) Integration of Logical English and s(CASP) (GDE 2022) Blawx: Web-based user-friendly Rules as Code (ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data (NMR 2022) Abductive Reasoning with Sequent-Based Argumentation (Extended Abstract) (DL 2022) Evaluating the Interpretability of Threshold Operators (XLoKR 2022) Clustering-Based Approaches for Symbolic Knowledge Extraction (XLoKR 2022) Invited Talk: Explaining and Arguing with Facts and Rules
Explainable AI Planning	(KR 2022) Towards a Logical Account for Human-Aware Explanation Generation in Model Reconciliation Problems
Explainable Artificial Intelligence	(XLoKR 2022) Dialogue-Based Explanations of Reasoning in Rule-based Systems
Explainable Logic	(KR 2022) Towards a Logical Account for Human-Aware Explanation Generation in Model Reconciliation Problems
Explainable planning	(ICLP 2022) On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model? (ICLP 2022) Model Reconciliation in Logic Programs
explanation	(IJCAR 2022) Evonne: Interactive Proof Visualization for Description Logics (System Description) (KR 2022) Faithful Approaches to Rule Learning (ICLP 2022) Tree-Like Justification Systems are Consistent (DL 2022) SAT-Based Axiom Pinpointing Revisited (DL 2022) On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne (DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps
Explanation Sequence	(ModRef2022) Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended abstract)
explanations	(KR 2022) Looking Inside the Black-Box: Logic-based Explanations for Neural Networks (CAV 2022) Explaining Hyperproperty Violations (XLoKR 2022) Stepwise Explanations of Unsatisfiable Constraint Programs (Extended abstract)
explicit definability	(DL 2022) More on Interpolants and Explicit Definitions for Description Logics with Nominals and/or Role Inclusions
explicit substitutions	(LICS 2022) Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
Exponential local-global principle	(LICS 2022) On the Skolem Problem and the Skolem Conjecture
Exponential maps	(TLLA-LINEARITY-2022)
Exponentials	(TLLA-LINEARITY-2022)
expressive DLs	(DL 2022) Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract)
Expressive power	(KR 2022) On the Expressive Power of Intermediate and Conditional Effects in Temporal Planning (DL 2022) Comonadic Semantics for Description Logics Games
expressiveness	(NMR 2022) Argumentation Frameworks induced by Assumption-based Argumentation: Relating Size and Complexity (ASL 2022) On the Expressiveness of a Logic of Separated Relations
Extensional Type Theory	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
F
factor interpretation	(IJCAR 2022) Binary codes that do not preserve primitivity
fair exchange	(CSF 2022) Contingent payments from two-party signing and verification for abelian groups
fairness	(CAV 2022) Synthesizing Fair Decision Trees via Iterative Constraint Solving
Fairness Verification	(CAV 2022) Verifying Fairness in Quantum Machine Learning
fallacious argumentation	(NMR 2022) Fallacious arguments: the place where Knowledge Representation and Argument Mining meet each other
Fallible sensors	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing
Farkas' Lemma	(CAV 2022) Affine Loop Invariant Generation via Matrix Algebra
fault isolation	(CAV 2022) End-to-end Mechanised Proof of an eBPF Virtual Machine for Microcontrollers
feasible fragments	(ARQNL 2022) Towards a Coq formalization of a quantified modal logic
feedback	(LICS 2022) Monoidal Streams for Dataflow Programming
fibrations	(FSCD 2022) A Fibrational Tale of Operational Logical Relations
Filtering algorithm	(CP 2022) Explaining Propagation for Gini and Spread with Variable Mean
fine-grained locking	(ASL 2022) Proving Logical Atomicity using Lock Invariants
finite abstraction	(LICS 2022) Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
finite axiomatizability	(IJCAR 2022) Finite two-dimensional proof systems for non-finitely axiomatizable logics
finite constraint languages	(CP 2022) CSP Beyond Tractable Constraint Languages
Finite entailment	(KR 2022) Finite Entailment of UCRPQs over ALC Ontologies (KR 2022) Decidability Limits of Finite Ontology-Mediated Query Entailment
finite fields	(SMT 2022) An SMT Approach for Solving Polynomials over Finite Fields
finite model theory	(LICS 2022) Separating LREC from LFP (LICS 2022) When Locality Meets Preservation (LICS 2022) Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics (LICS 2022) The Pebble-Relation Comonad in Finite Model Theory
finite models	(ITP 2022) Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3,2) using the Coq Proof Assistant
Finite-state abstractions	(VeriProp 2022) Safe Sampling-Based Planning for Stochastic Systems with Uncertain Dynamics
finitely basic monad	(LICS 2022) Varieties of quantitative algebras and their monads
finitely subdirectly irreducible	(iPRA 2022) Interpolation via Finitely Subdirectly Irreducible Algebras
finiteness	(FSCD 2022) Restricting tree grammars with term rewriting
first-order ATP	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
first-order logic	(IJCAR 2022) Connection-minimal Abduction in EL via translation to FOL (IJCAR 2022) Semantic Relevance (FSCD 2022) An Analysis of Tennenbaum's Theorem in Constructive Type Theory (KR 2022) Normalisations of Existential Rules: Not so Innocuous! (ICLP 2022) Transforming Gringo Rules into Formulas in a Natural Way (ThEdu'22) On Exams with the Isabelle Proof Assistant (DL 2022) Connection-minimal Abduction in EL via translation to FOL (Extended Abstract) (DL 2022) Charting the Borderland – Decidability in Description Logics and Beyond (CP 2022) Fixed-Template Promise Model Checking Problems (PAAR 2022) A Two-Watched Literal Scheme for First-Order Logic (MC-2022) Recursive Solutions to First-Order Model Counting (ITP 2022) Undecidability of Dyadic First-Order Logic in Coq (ITP 2022) Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL (LICS 2022) The Regular Languages of First-Order Logic with One Alternation (LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth (FOMEO'22) First-Order Logic Workbook (Coq2022) A Coq Library for Mechanised First-Order Logic
first-order logic with equality	(IJCAR 2022) SCL(EQ): SCL for First-Order Logic with Equality (PAAR 2022) Lazy Paramodulation in Practice
first-order modal logic	(DECFOML2022) Decidability Questions beyond Satisfiability for First-order Modal Logics (DECFOML2022) Are Bundles Good Deals for FOML? (DECFOML2022) Terminating sequent calculi for decidable fragments of FOML
first-order reasoning	(PAAR 2022) Exploring Partial Models with SCL
First-order rewritability	(KR 2022) Normalisations of Existential Rules: Not so Innocuous!
First-order theorem proving	(IJCAR 2022) Ground joinability and connectedness in the superposition calculus (PAAR 2022) The Vampire Approach to Induction
first-order theory of rewriting	(IWC 2022) Formalized Signature Extension Results for Equivalence
first-order theory of the reals	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
fixed point	(VeriProp 2022) Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games
fixed point theory	(CAV 2022) The Lattice-Theoretic Essence of Property Directed Reachability Analysis
fixed points	(FSCD 2022) Decision problems for linear logic with least and greatest fixed points (LICS 2022) Bouncing threads for circular and non-wellfounded proofs
Fixed-domain semantics	(NMR 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics (DL 2022) AGM Revision in Description Logics Under Fixed-Domain Semantics
Fixed-Parameter Tractability	(PCCR2022) Tractable Abstract Argumentation via Backdoor-Treewidth (PCCR2022) Kemeny Rank Aggregation: Width Measure and Diversity Notion (MC-2022) A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth (SAT 2022) On the Parallel Parameterized Complexity of MaxSAT Variants (PDAR 2022) On the Parallel Parameterized Complexity of MaxSAT Variants
Fixed-Point Logic	(LICS 2022) Separating LREC from LFP
fixpoint	(WPTE 2022) Towards Corecursion Without Corecursion in Coq
fixpoint logic	(ARQNL 2022) (Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
Fixpoint Semantics	(ICLP 2022) An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
FL0	(UNIF 2022) Restricted Unification in the Description Logic FLbot
FL0 and FLbot	(DL 2022) Efficient TBox Reasoning with Value Restrictions using the FL0wer Reasoner (Extended Abstract)
FLbot	(UNIF 2022) Restricted Unification in the Description Logic FLbot
Floating-Points	(Isabelle 2022) Oracle Integration of Floating-Point Solvers with Isabelle
fluted fragment	(DECFOML2022) From Modal Logic to Fluted logic
FOL	(NMR 2022) Connection-Minimal Abduction in EL via Translation to FOL
Forecasting	(KR 2022) Forecasting Argumentation Frameworks
Forgetting	(KR 2022) On Syntactic Forgetting with Strong Persistence (ICLP 2022) On Syntactic Forgetting under Uniform Equivalence (DL 2022) Fine-Grained Forgetting for the Description Logic ALC (DL 2022) On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne (DL 2022) Knowledge Extraction Based on Forgetting and Subontology Generation
formal languages	(FOMEO'22) Teaching Formal Languages with Iltis - A Preview
Formal mathematics	(ITP 2022) Formalizing the ring of adèles of a global field (HoTT/UF 2022)
Formal Methods	(FSCD 2022) A Certified Algorithm for AC-Unification (CAV 2022) Capture, Analyze, Diagnose: Realizability Checking of Requirements in FRET (CAV 2022) MoGym: Using Formal Models for Training and Verifying Decision-making Agents (NSV 2022) TBD (NSV 2022) TBD (NSV 2022) TBD (CSF 2022) Privacy as Reachability (CSF 2022) Cracking the Stateful Nut -- Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant (UNIF 2022) Unification types in modal logics (UNIF 2022) Unification Decision Procedures using Basic Narrowing modulo an Equational Theory (SYNT 2022) Inferring Environment Assumptions in Model Refinement (SYNT 2022) Reactive Synthesis of LTL specifications with Rich Theories (FOMEO'22) Formal Methods Online: Sequent Calculus Verifier (SeCaV) (FOMEO'22) Experiences on Online Teaching of Formal Methods to Systems Engineering Students (FOMEO'22) Teaching Formal Languages with Iltis - A Preview
formal methods and verification	(CSF 2022) IFCIL: An Information Flow Configuration Language for SELinux (CSF 2022) N-Tube: Formally Verified Secure Bandwidth Reservation in Path-Aware Internet Architectures
formal modeling	(FOMEO'22) Towards Graphical Feedback in the DiMo Learning Tool
formal proof	(ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean
Formal Proof Techniques	(ITP 2022) Formalising Fisher’s Inequality: Formal Linear Algebraic Techniques in Combinatorics
formal proofs	(XLoKR 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended Abstract) (FOMEO'22) First-Order Logic Workbook
formal semantics	(LICS 2022) Quantum Expectation Transformers for Cost Analysis
formal verification	(CAV 2022) Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement (CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols (ITP 2022) Formalization of a Stochastic Approximation Theorem (ITP 2022) Formalization of Randomized Approximation Algorithms for Frequency Moments (CSF 2022) Is Eve nearby? Analysing protocols under the distant-attacker assumption (CSF 2022) Contingent payments from two-party signing and verification for abelian groups (CSF 2022) Adversary Safety by Construction in a Language of Cryptographic Protocols (CSF 2022) Exploiting Partial Order of Keys to Verify Security of a Vehicular Group Protocol (CSF 2022) Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co (CSF 2022) Proving full-system security properties under multiple attacker models on capability machines (SYNT 2022) Reactive Synthesis of LTL specifications with Rich Theories
formalization	(IWC 2022) Formalized Signature Extension Results for Equivalence (ITP 2022) Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3,2) using the Coq Proof Assistant (ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean (ARQNL 2022) Towards a Coq formalization of a quantified modal logic (HoTT/UF 2022)
formalization of category theory	(HoTT/UF 2022)
formalization of mathematics	(ITP 2022) Use and abuse of instance parameters in the Lean mathematical library
Formula Simplification	(IJCAR 2022) Formula Simplification via Invariance Detection by Algebraically Indexed Types (ONLINE)
free algebras	(LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
free-choice nets	(CAV 2022) Verifying generalised and structural soundness of workflow nets via relaxations
Frequency Moments	(ITP 2022) Formalization of Randomized Approximation Algorithms for Frequency Moments
Full-angle Method	(ThEdu'22) Rule Based Geometry Automated Theorem Provers
full-system guarantees	(CSF 2022) Proving full-system security properties under multiple attacker models on capability machines
Function algebras	(LICS 2022) Cyclic Implicit Complexity
Function Symbols	(ICLP 2022) An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
functional analysis	(ITP 2022) Formalized functional analysis with semilinear maps
functional big-step semantics	(WPTE 2022) A Machine-Checked Formalisation of Erlang Modules
Functional correctness verification	(CAV 2022) Verified Erasure Correction in Coq with MathComp and VST
Functional Data Structures	(Isabelle 2022) A Verified Implementation of B-trees in Isabelle/HOL
Functional logic programming	(ICLP 2022) From Logic to Functional Logic Programs
Functional Machine Calculus	(IWC 2022) Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
functional programming	(CAV 2022) Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (IWC 2022) Checking Confluence of Rewrite Rules in Haskell
Functor of points	(LICS 2022) A functorial excursion between algebraic geometry and linear logic
futures	(FSCD 2022) Type-Based Termination for Futures
Fuzz Testing	(CAV 2022) Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation (CAV 2022) Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers
Fuzzing	(SMT 2022) Murxla: A Modular and Highly Extensible API Fuzzer for SMT Solvers
Fuzzy Description Logics	(KR 2022) A conditional, a fuzzy and a probabilistic interpretation of self-organising maps (Abstract) (ICLP 2022) An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases (NMR 2022) From Weighted Conditionals to a Gradual Argumentation Semantics and back
fuzzy logic	(KR 2022) A Gödel calculus for Linear Temporal Logic (ICLP 2022) MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations
Fuzzy proximity relations	(IJCAR 2022) A framework for approximate generalization in quantitative theories (ONLINE)
Fuzzy Subsumption	(UNIF 2022) Fuzzy Order-Sorted Feature Term Unification
G
Gaifman Normal Form	(LICS 2022) When Locality Meets Preservation
Gale-Shapley Algorithm	(Isabelle 2022) Gale-Shapley Verified
game comonads	(LICS 2022) The Pebble-Relation Comonad in Finite Model Theory
games	(DL 2022) Comonadic Semantics for Description Logics Games (CAV 2022) Reasoning about Data Trees using CHCs (LICS 2022) Graded Monads and Behavioural Equivalence Games
games on graphs	(LICS 2022) Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Garbage Collection	(ASL 2022) Polishing a Rough Diamond: An Enhanced Separation Logic for Heap Space under Garbage Collection
Gauge integral	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
GDPR enforcement	(CSF 2022) DPL: A Language for GDPR Enforcement
general game playing	(KR 2022) A Graph Neural Network Reasoner for Game Description Language (KR 2022) Investigating Novel Representations and Deep Reinforcement Learning for General Game Playing
generalisation	(FSCD 2022) Nominal Anti-Unification with Atom-Variables
generalised soundness	(LICS 2022) The complexity of soundness in workflow nets
Generalization	(IJCAR 2022) A framework for approximate generalization in quantitative theories (ONLINE) (DL 2022) A new dimension to generalization: computing temporal EL concepts from positive examples (Extended Abstract)
generalization guarantees	(CP 2022) Improved Learning Bounds for Branch-and-Cut
Generalized applications	(FSCD 2022) Solvability for Generalized Applications
generalized policies	(KR 2022) Learning generalized policies without supervision using GNNs
generalized soundness	(CAV 2022) Verifying generalised and structural soundness of workflow nets via relaxations
generalized stable model	(GDE 2022) A Query Evaluation Method for ASP with Abduction
Generating Benchmarks	(ModRef2022) A Constraint-Based Tool for Generating Benchmark Instances
Generating functions	(VeriProp 2022) Verifying Probabilistic Programs using Generating Functions (CAV 2022) Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
generative power	(TERMGRAPH 2022) Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
generic effects	(FSCD 2022) A Fibrational Tale of Operational Logical Relations
Genetic Programming	(KR 2022) Rule Learning over Knowledge Graphs with Genetic Logic Programming
Geometry automated theorem provers	(ThEdu'22) Rule Based Geometry Automated Theorem Provers (ThEdu'22) A Rule-Based Theorem Prover: an Introduction to Proofs at 7th Year
Geometry Problem Solving	(IJCAR 2022) Formula Simplification via Invariance Detection by Algebraically Indexed Types (ONLINE)
Gini index	(CP 2022) Explaining Propagation for Gini and Spread with Variable Mean
global constraints	(CP 2022) Heuristics for MDD Propagation in Haddock (CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
gluing	(FSCD 2022) A stratified approach to Lob induction (LICS 2022) Normalization for Multimodal Type Theory
goal-directed	(GDE 2022) Modeling Administrative Discretion Using Goal-Directed Answer Set Programming (ICLP 2022) Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming (Extended Abstract)
Goal-Directed Answer Set Programming	(GDE 2022) Unmanned Aerial Vehicle compliance checking using Goal-Directed Answer Set Programming
Goal-Directed evaluation	(GDE 2022) LTL Model Checking using Coinductive Answer Set programming (GDE 2022) Incremental Learning with Defeaters (GDE 2022) GDE of ASP: applications, potential and future directions (ICLP 2022) Towards Dynamic Consistency Checking in Goal-directed Predicate Answer Set Programming
GPU	(PDAR 2022) Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving
graded modalities	(LICS 2022) Logical Foundations of Quantitative Equality
Graded monads	(LICS 2022) Graded Monads and Behavioural Equivalence Games
Gradual Argumentation	(KR 2022) Interpreting Neural Networks as Quantitative Argumentation Frameworks (Extended Abstract) (NMR 2022) From Weighted Conditionals to a Gradual Argumentation Semantics and back
gradual semantics	(KR 2022) Explaining Causal Models with Argumentation: the Case of Bi-variate Reinforcement
grammar-based tree compression	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
graph coloring	(CP 2022) From Cliques to Colorings and Back Again
graph grammar	(TERMGRAPH 2022) Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
graph isomorphism	(SAT 2022) SAT Preprocessors and Symmetry
graph neural networks	(KR 2022) Learning generalized policies without supervision using GNNs (ICLP 2022) A Gaze into the Internal Logic of Graph Neural Networks, with Logic (PAAR 2022) Exploring Representation of Horn clauses using GNNs
graph node property prediction	(ICLP 2022) A Gaze into the Internal Logic of Graph Neural Networks, with Logic
graph partitioning	(ASPOCP 2022)
graph rewriting	(TERMGRAPH 2022) A PBPO+ Graph Rewriting Tutorial (TERMGRAPH 2022) PBPO+ Graph Rewriting in Context
graph theory	(ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean
graph transformations	(TERMGRAPH 2022) Formalization and analysis of BPMN using graph grammars
Graph-minors	(UNIF 2022) Graph-Embedded Term Rewrite Systems and Applications (A Preliminary Report)
graphical calculus	(LICS 2022) Zigzag normalisation for associative n-categories
graphical feedback	(FOMEO'22) Towards Graphical Feedback in the DiMo Learning Tool
graphical models	(MC-2022) Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
graphs	(KR 2022) Matthias König's Thesis: Graph Parameters for Abstract Argumentation (Isabelle 2022) From P != NP to monotone circuits of super-polynomial size
greedy decomposition	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
Green's theorem	(ITP 2022) Formalizing the divergence theorem and the Cauchy integral formula in Lean
Gringo	(ICLP 2022) Transforming Gringo Rules into Formulas in a Natural Way
ground joinability	(IJCAR 2022) Ground joinability and connectedness in the superposition calculus
ground term similarity relations	(ICLP 2022) A Gaze into the Internal Logic of Graph Neural Networks, with Logic
Grounded Theory	(CP 2022) Understanding how people approach constraint modelling and solving
group cohomology	(HoTT/UF 2022)
Group Reliability	(KR 2022) The More the Worst-Case-Merrier: A Generalized Condorcet Jury Theorem for Belief Fusion
Groupoids	(HoTT/UF 2022)
guarded fragment	(DECFOML2022) From Modal Logic to Fluted logic (DECFOML2022) Forward Guarded Fragment: A tamed higher-arity extension of ALC
guarded recursion	(FSCD 2022) A stratified approach to Lob induction (LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Gödel logic	(IJCAR 2022) Paraconsistent Gödel modal logic (KR 2022) A Gödel calculus for Linear Temporal Logic
Gödel logics	(iPRA 2022) First-Order Interpolation Derived from Propositional Interpolation
H
hardware	(CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols
hardware tokens	(CSF 2022) Collusion-Preserving Computation without a Mediator
Haskell	(IJCAR 2022) Synthetic tableaux: minimal tableau search heuristics (IWC 2022) Checking Confluence of Rewrite Rules in Haskell
Heterogeneous knowledge bases	(XLoKR 2022) Modular Provenance in Multi-Context Systems
heuristic algorithms	(MC-2022) Heuristic computation of exact treewidth - some improvements and more experimental evaluations
heuristics	(CP 2022) Heuristics for MDD Propagation in Haddock (PAAR 2022) Empirical Properties of Term Orderings for Superposition
Hierarchical Models	(CAV 2022) Abstraction-Refinement for Hierarchical Probabilistic Models
High School Students	(ICLP 2022) A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers
higher categories	(LICS 2022) Zigzag normalisation for associative n-categories
higher category theory	(LICS 2022) A Type Theory for Strictly Unital Infinity-Categories (LICS 2022) Syllepsis in Homotopy Type Theory
Higher Inductive Types	(LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
higher observational type theory	(HoTT/UF 2022)
Higher order computation	(LICS 2022) Cyclic Implicit Complexity
higher-order	(PC 2022) Towards higher order proof complexity (LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction) (UNIF 2022) Higher-Order Unification with Definition by Cases
higher-order deduction	(FSCD 2022) Nominal Anti-Unification with Atom-Variables
Higher-order logic	(IJCAR 2022) Lash 1.0 (System Description) (ThEdu'22) On Exams with the Isabelle Proof Assistant (ITP 2022) Candle: A Verified Implementation of HOL Light (ARQNL 2022) Solving QMLTP Problems by Translation to Higher-order Logic
higher-order modal logic	(ARQNL 2022) Intuitionistic derivability in Anderson's variant of the ontological argument
Higher-Order Pattern Rewrite System	(IWC 2022) Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Higher-order rewriting	(IWC 2022) Checking Confluence of Rewrite Rules in Haskell (WST22) The System SOL version 2022 (Tool Description)
higher-order term rewriting	(FSCD 2022) Cutting a Proof into Bite-Sized Chunks: Incrementally Proving Termination in Higher-Order Term Rewriting (WST22) Tuple Interpretations and Applications to Higher-Order Runtime Complexity (WST22) A transitive HORPO for curried systems (WST22) Things WANDA cannot do
higher-order unification	(UNIF 2022) Higher-order unification from E-unification with second-order equations and parametrised metavariables
Hilbert space	(ITP 2022) Formalized functional analysis with semilinear maps
Hilbert-style proof systems	(IJCAR 2022) Finite two-dimensional proof systems for non-finitely axiomatizable logics
hitting formulas	(PC 2022) Are Hitting Formulas Hard for Resolution?
hoare logic	(ThEdu'22) A Proof Tree Builder for Sequent Calculus and Hoare Logic (ITP 2022) Compositional Verification of Interacting Systems using Event Monads
HOL Light	(ITP 2022) Candle: A Verified Implementation of HOL Light
HOL4	(ITP 2022) Dandelion: Certified Approximations of Elementary Functions (ITP 2022) Mechanizing Soundness of Off-Policy Evaluation (ITP 2022) Taming an Authoritative Armv8 ISA Specification: L3 Validation and CakeML Compiler Verification
homological algebra	(HoTT/UF 2022) (HoTT/UF 2022)
homomorphic encryption	(CAV 2022) Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
homotopy	(LICS 2022) Zigzag normalisation for associative n-categories
homotopy type theory	(FSCD 2022) Division by two, in homotopy type theory (LICS 2022) A Type Theory for Strictly Unital Infinity-Categories (LICS 2022) Syllepsis in Homotopy Type Theory (HoTT/UF 2022) (HoTT/UF 2022) (HoTT/UF 2022) (HoTT/UF 2022) (HoTT/UF 2022) (HoTT/UF 2022)
Horn formula	(LMML 2022) MCP: Capturing Big Data by Satisfiability
Horn theories	(PAAR 2022) On SGGS and Horn Clauses
Horn-DL	(KR 2022) Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs
Horn-fragments	(DL 2022) Efficient TBox Reasoning with Value Restrictions using the FL0wer Reasoner (Extended Abstract)
HTN Planning	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
human computer interaction	(ICLP 2022) On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model?
human reasoning	(KR 2022) Do Humans Find Postulates of Belief Change Plausible? (NMR 2022) Asking human reasoners to judge postulates of belief change for plausibility
Human-Aware AI	(KR 2022) Towards a Logical Account for Human-Aware Explanation Generation in Model Reconciliation Problems
Human-Computer Interaction	(CP 2022) Understanding how people approach constraint modelling and solving
Human-robot collaboration	(ICLP 2022) What do you really want to do? Towards a Theory of Intentions for Human-Robot Collaboration
Hybrid Knowledge Bases	(ICLP 2022) An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
Hybrid Logic	(Isabelle 2022) On Termination for Hybrid Tableaux
Hybrid MKNF Knowledge Bases	(ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
Hybrid planning	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
hybrid reasoning	(NMR 2022) Hybrid Anwer Set Programming: Opportunities and Challenges (DL 2022) Hybrid Anwer Set Programming: Opportunities and Challenges
Hybrid Systems	(CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics (CHANGE2022) Tutorial: Hybrid Temporal Situation Calculus for Planning with Continuous Processes: Semantics (NSV 2022) TBD (NSV 2022) TBD
Hyper-parameter optimisation	(KR 2022) Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO
Hyper-parameters tuning	(ICLP 2022) Exploiting Parameters Learning for Hyper-parameters Optimization in Deep Neural Networks
hyperdoctrine	(LICS 2022) Logical Foundations of Quantitative Equality
hyperintensionality	(KR 2022) Hyperintensional Partial Meet Contractions
Hyperliveness	(CAV 2022) Software Verification of Hyperproperties beyond k-safety (CSF 2022) Prophecy Variables for Hyperproperty Verification
HyperLTL	(CAV 2022) Software Verification of Hyperproperties beyond k-safety (LICS 2022) Deciding Hyperproperties Combined with Functional Specifications (CSF 2022) Prophecy Variables for Hyperproperty Verification
Hyperproperties	(CAV 2022) Explaining Hyperproperty Violations (CAV 2022) Software Verification of Hyperproperties beyond k-safety (LICS 2022) Deciding Hyperproperties Combined with Functional Specifications (LICS 2022) Temporal Team Semantics Revisited (CSF 2022) Prophecy Variables for Hyperproperty Verification (CSF 2022) Mapping Synthesis for Hyperproperties
Hypersequent calculi	(KR 2022) Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
Hypersequents	(IJCAR 2022) Cyclic Proofs, Hypersequents, and Transitive Closure Logic
I
iALC	(DL 2022) A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals
identity management	(REAI 2022) (REAI 2022)
Imperative language	(FOMEO'22) Visualization of structural operational semantics over programs of simple imperative language.
imperative program	(WPTE 2022) On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms
implementation	(SMT 2022) Trail saving in SMT
implementations	(NMR 2022) Trust Graphs for Belief Revision: Framework and Implementation
implementing sequent calculi in Prolog	(ICLP 2022) Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
Implicit Complexity	(LICS 2022) Cyclic Implicit Complexity
Implicit Computational Complexity	(FSCD 2022) mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
implicit deletion	(GDE 2022) A Query Evaluation Method for ASP with Abduction
implicit hitting set approach	(SAT 2022) Incremental Maximum Satisfiability (SAT 2022) Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
Implicit hitting set duality	(ModRef2022) Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended abstract)
Important separators	(PCCR2022) Resolving Inconsistency of Linear Equations
Impredicative universe	(HoTT/UF 2022)
Incidence Graph	(MC-2022) A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth
incompleteness	(Coq2022) A Coq Library for Mechanised First-Order Logic
inconsistency-tolerant semantics	(KR 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (DL 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract)
incremental CDCL	(PDAR 2022) Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems
incremental MaxSAT	(SAT 2022) Incremental Maximum Satisfiability
incremental SAT	(SAT 2022) MaxSAT-Based Bi-Objective Boolean Optimization
Independent Hashing	(LICS 2022) On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
Indistinguishability	(CSF 2022) Locked Circuit Indistinguishability: A Notion of Security for Logic Locking
induction	(PAAR 2022) The Vampire Approach to Induction (PAAR 2022) Reuse of Introduced Symbols in Automatic Theorem Provers
Induction and coinduction	(LICS 2022) Bouncing threads for circular and non-wellfounded proofs
Inductive inference	(KR 2022) Inference with System W Satisfies Syntax Splitting
inductive inference operator	(KR 2022) Inference with System W Satisfies Syntax Splitting (KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs
Inductive Logic Programming	(KR 2022) Rule Learning over Knowledge Graphs with Genetic Logic Programming (KR 2022) Lifting Symmetry Breaking Constraints with Inductive Logic Programming (ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data (ICLP 2022) Efficient lifting of symmetry breaking constraints for complex combinatorial problems
Inductive reasoning	(ASL 2022) Two Results on Separation Logic With Theory Reasoning
inductive theorem proving	(WPTE 2022) Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
infeasibility	(IJCAR 2022) Term Ordering for Non-Reachability of (Conditional) Rewriting (IWC 2022) Proving Confluence with CONFident
inference	(ICLP 2022) DeepStochLog: Neural Stochastic Logic Programming
inference schemas	(XLoKR 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended Abstract)
infinite duration	(LICS 2022) Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
infinite proofs	(FSCD 2022) Type-Based Termination for Futures
infinite stable models	(ASPOCP 2022)
infinite-domain constraint satisfaction problem	(LICS 2022) Smooth approximations and CSPs over finitely bounded homogeneous structures
infinite-state systems	(LICS 2022) The complexity of bidirected reachability in valence systems
information extraction	(KR 2022) Open Relation Extraction With Non-existent and Multi-span Relationships
information flow	(FSCD 2022) Sheaf semantics of termination-insensitive noninterference (CAV 2022) Information Flow Guided Synthesis (CSF 2022) How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis (CSF 2022) Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games
information flow control	(CSF 2022) IFCIL: An Information Flow Configuration Language for SELinux (CSF 2022) Towards a General-Purpose Dynamic Information Flow Policy
Information leakage	(CAV 2022) A Scalable Shannon Entropy Estimator
Information-flow security	(CSF 2022) Mapping Synthesis for Hyperproperties
inherently weak automata	(CAV 2022) Complementing Büchi Automata with Ranker
Inner-approximation	(CAV 2022) RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems
Insertion Variables	(CP 2022) Sequence Variables for Routing Problems
instantiation	(SAT 2022) Towards Learning Quantifier Instantiation in SMT
Integer Difference Logic	(CAV 2022) Local Search For SMT on Linear Integer Arithmetic
Integer encoding	(SMT 2022) Bit-Precise Reasoning via Int-Blasting
integer programming	(CP 2022) Improved Learning Bounds for Branch-and-Cut (SAT 2022) A Comprehensive Study of k-Portfolios of Recent SAT Solvers
Integer Programs	(IJCAR 2022) Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops (WST22) Improved Automatic Complexity Analysis of Integer Programs
integer transition systems	(IJCAR 2022) Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) (WST22) A Calculus for Modular Non-Termination Proofs by Loop Acceleration (WST22) AProVE 2022 (WST22) LoAT: The Loop Acceleration Tool
intelligent tutoring	(FOMEO'22) LogInd, a tool for supporting students in mastering structural induction
intelligent tutoring system	(FOMEO'22) Teaching Formal Languages with Iltis - A Preview
intensional concepts	(ICLP 2022) Tractable Reasoning using Logic Programs with Intensional Concepts
Interactive Explanations	(XLoKR 2022) On interactive explanations as reasoning
interactive textbook	(FOMEO'22) Teaching Concurrency with pseuCo Book
Interactive Theorem Proving	(FSCD 2022) A Certified Algorithm for AC-Unification (Isabelle 2022) Lessons of Teaching Formal Methods with Isabelle (CAV 2022) Verified Erasure Correction in Coq with MathComp and VST (ITP 2022) The Isabelle ENIGMA (ITP 2022) Dandelion: Certified Approximations of Elementary Functions (ITP 2022) Seventeen Provers under the Hammer (CSF 2022) Cracking the Stateful Nut -- Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant
Interactive Web System	(FOMEO'22) Iltis: Teaching Logic in the Web
Interference-based proofs	(iPRA 2022) Interpolants and Interference
Intermediate conditions and effects	(KR 2022) On the Expressive Power of Intermediate and Conditional Effects in Temporal Planning
Intermediate Logics	(TLLA-LINEARITY-2022)
Internet of Things	(CAV 2022) Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
Interpolation	(KR 2022) Interpolants and Explicit Definitions in Extensions of the Description Logic EL (iPRA 2022) Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification (iPRA 2022) First-Order Interpolation Derived from Propositional Interpolation (iPRA 2022) TBA (Invited Talk) (iPRA 2022) TBA (Invited Talk) (iPRA 2022) TBA (Invited Talk)
Interpretability	(DL 2022) Evaluating the Interpretability of Threshold Operators
interpretable models	(CP 2022) Formal Explainable AI (LMML 2022) Building Optimal Decision Trees (LMML 2022) TBA
Interpretable prediction	(KR 2022) Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO
interpretation	(ICLP 2022) Graph-based Interpretation of Normal Logic Programs (LICS 2022) Stable graphs of bounded twin-width
interpretations	(LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
Intersection Types	(IFIP-WG1.6) Quantitative Weak Linearisation
introduction	(PCCR2022) Welcome and Introduction
Intuitionism	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
intuitionistic linear logic	(TERMGRAPH 2022) A Computational Interpretation of Girard’s Intuitionistic Proof-Nets
intuitionistic logic	(FSCD 2022) Normalization without syntax (DL 2022) A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals (ARQNL 2022) Intuitionistic derivability in Anderson's variant of the ontological argument
Invariance	(IJCAR 2022) Formula Simplification via Invariance Detection by Algebraically Indexed Types (ONLINE)
Invariant synthesis	(CAV 2022) Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes
invertibility	(WPTE 2022) Transforming Text to (and from) XML
Invited Talk	(PC 2022) TBA (PC 2022) On combinatorial principles coming from semi-algebraic proof systems (ModRef2022) Constraint modelling and solving: Learning from observing people (ModRef2022) A Constraint-Based Tool for Generating Benchmark Instances
iPRA	(iPRA 2022) TBA (Invited Talk) (iPRA 2022) TBA (Invited Talk) (iPRA 2022) TBA (Invited Talk)
Iris	(ASL 2022) Proving Logical Atomicity using Lock Invariants (ASL 2022) Functional correctness specifications for concurrent data structures: Logical Atomicity in Iris
ISA specification	(ITP 2022) Taming an Authoritative Armv8 ISA Specification: L3 Validation and CakeML Compiler Verification
Isabelle	(Isabelle 2022) Gale-Shapley Verified (Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation (Isabelle 2022) Automating Kantian Ethics in Isabelle: A Case Study (PAAR 2022) The Isabelle Community Benchmark (ITP 2022) Refinement of Parallel Algorithms down to LLVM (PDAR 2022) Refinement of Parallel Algorithms down to LLVM
Isabelle Proof Assistant	(ThEdu'22) On Exams with the Isabelle Proof Assistant (FOMEO'22) Formal Methods Online: Sequent Calculus Verifier (SeCaV)
Isabelle Sledgehammer	(ITP 2022) The Isabelle ENIGMA
Isabelle/HOL	(IJCAR 2022) Binary codes that do not preserve primitivity (IJCAR 2022) Rensets and Renaming-Based Recursion for Syntax and Bindings (Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation (Isabelle 2022) On Axiomatic Systems for Classical Propositional Logic (Isabelle 2022) Auxiliary tools for Combinatorics on Words (Isabelle 2022) Transfer and reversal of lists (ITP 2022) Formalising Fisher’s Inequality: Formal Linear Algebraic Techniques in Combinatorics (ITP 2022) A Verified Cyclicity Checker (ITP 2022) Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL (ITP 2022) Formalization of Randomized Approximation Algorithms for Frequency Moments (WST22) CeTA — Efficient Certification of Termination Proofs (WST22) CeTA – A certifier for termCOMP 2022 (ARQNL 2022) Automated verification of deontic correspondences in Isabelle/HOL - First results
Isabelle/jEdit	(Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation
Isabelle/VSCode	(Isabelle 2022) Towards Accessible Formal Mathematics with ISAC and Isabelle/VSCode
isolation problem	(LICS 2022) The boundedness and zero isolation problems for weighted automata over nonnegative rationals
isomorph-free exhaustive generation	(KR 2022) Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation
isomorphism	(LICS 2022) Choiceless Polynomial Time with Witnessed Symmetric Choice
Iterated Belief Change	(KR 2022) Iterated Belief Change, Computationally
Iterated Belief Revision	(KR 2022) Darwiche and Pearl's Epistemic States are not Total Preorders
J
Java - C - Haskell - Prolog	(WST22) AProVE 2022
JavaScript	(Coq2022) jsCoq: Literate Proof Documents Dressed for the Web
Job-shop Scheduling Problem	(ICLP 2022) Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling
JSON documents	(DL 2022) Accessing Document Data Sources using Referring Expression Types
Judgment Aggregation	(KR 2022) Simulating Multiwinner Voting Rules in Judgment Aggregation
Justifiable Exceptions	(NMR 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (NMR 2022) (DL 2022) Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures
justification	(ICLP 2022) Nested Justification Systems
Justification Logic	(NMR 2022) A situation-calculus model of Knowledge and Belief based on Thinking about Justifications
justification theory	(ICLP 2022) Nested Justification Systems (ICLP 2022) Tree-Like Justification Systems are Consistent
justifications	(IJCAR 2022) Hyper-graph based Inference Rules for Computing EL+-Ontology Justifications
K
k-SAT	(SAT 2022) A generalization of the Satisfiability Coding Lemma and its applications
KALM	(ICLP 2022) Knowledge Authoring with Factual English
Kan-Quillen model structure	(HoTT/UF 2022)
Kant	(Isabelle 2022) Automating Kantian Ethics in Isabelle: A Case Study
Kemeny Rank Aggregation	(PCCR2022) Kemeny Rank Aggregation: Width Measure and Diversity Notion
Kernel Contraction	(KR 2022) Kernel Contraction and the Order of Relevance
kernelization	(PCCR2022) MaxSAT: Parameterized, Parallel, Absolute
key agreement	(CSF 2022) Unlinkability of an Improved Key Agreement Protocol for EMV 2nd Gen Payments
key exchange	(CSF 2022) Is Eve nearby? Analysing protocols under the distant-attacker assumption
key hierarchy	(CSF 2022) Exploiting Partial Order of Keys to Verify Security of a Vehicular Group Protocol
Keyword1	(FLoC 2022) TBA (FLoC 2022) Complexity Measures for Reactive Systems (FLoC 2022) Harnessing the Power of Formal Verification for the $Trillion Chip Design Industry (FLoC 2022) SMT-based Verification of Distributed Network Control Planes (SMT 2022) TBA (SMT 2022) TBA (SMT 2022) Business Meeting (SMT 2022)
Keyword2	(FLoC 2022) TBA (FLoC 2022) Complexity Measures for Reactive Systems (FLoC 2022) Harnessing the Power of Formal Verification for the $Trillion Chip Design Industry (FLoC 2022) SMT-based Verification of Distributed Network Control Planes (SMT 2022) TBA (SMT 2022) TBA (SMT 2022) Business Meeting (SMT 2022)
Keyword3	(FLoC 2022) TBA (FLoC 2022) Complexity Measures for Reactive Systems (FLoC 2022) Harnessing the Power of Formal Verification for the $Trillion Chip Design Industry (FLoC 2022) SMT-based Verification of Distributed Network Control Planes (SMT 2022) TBA (SMT 2022) TBA
Kleene Algebra	(VeriProp 2022) Probabilistic Guarded Kleene Algebra with Tests
Kleene star	(TERMGRAPH 2022) Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
knapsack	(PC 2022) On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
knowability	(KR 2022) The Topology of Surprise
Knowledge	(NMR 2022) A situation-calculus model of Knowledge and Belief based on Thinking about Justifications
knowledge authoring	(ICLP 2022) Knowledge Authoring with Factual English
Knowledge base	(iPRA 2022) Application of Interpolation in Networks
Knowledge Based Data Management	(KR 2022) Data Quality in Ontology-Based Data Access
knowledge compilation	(ICLP 2022) Efficient Knowledge Compilation Beyond Weighted Model Counting (CP 2022) Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms (MC-2022) Scalable Uniform Sampling via Efficient Knowledge Compilation (MC-2022) Recursive Solutions to First-Order Model Counting
Knowledge Diversity	(DL 2022) Modelling Multiple Perspectives by Standpoint-Enhanced DLs
knowledge extraction	(DL 2022) Knowledge Extraction Based on Forgetting and Subontology Generation
Knowledge graph	(KR 2022) Rule Learning over Knowledge Graphs with Genetic Logic Programming (KR 2022) Learning Typed Rules over Knowledge Graphs
Knowledge Graphs	(KR 2022) Negative Statements Considered Useful (Extended Abstract) (KR 2022) Open Relation Extraction With Non-existent and Multi-span Relationships (NMR 2022) Semantic Edits as Counterfactual Explanations (DL 2022) Rule-Based Explanations using Knowledge Graphs (DL 2022) Semantic Edits as Counterfactual Explanations (XLoKR 2022) Invited Talk: Explaining and Arguing with Facts and Rules
Knowledge integration	(KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (NMR 2022) Modelling Multiple Perspectives by Standpoint-Enhanced Description Logics (DL 2022) Modelling Multiple Perspectives by Standpoint-Enhanced DLs
knowledge representation	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract) (KR 2022) On the learnability of knowledge in language domains (KR 2022) Doctoral Consortium Application (ICLP 2022) Nested Justification Systems (NMR 2022) There and Back Again: Combining Nonmonotonic Logical Reasoning and Deep Learning on an Assistive Robot (DL 2022) Advanced languages of terms for ontologies (CP 2022) Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms (UNIF 2022) Fuzzy Order-Sorted Feature Term Unification
Knowledge representation and reasoning	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing (ASPOCP 2022) (GDE 2022) Unmanned Aerial Vehicle compliance checking using Goal-Directed Answer Set Programming (GDE 2022) Automating Defeasible Reasoning in Law with Answer Set Programming (ICLP 2022) Knowledge Authoring with Factual English (ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases (ICLP 2022) What do you really want to do? Towards a Theory of Intentions for Human-Robot Collaboration
Kolmogorov complexity	(ITP 2022) Synthetic Kolmogorov Complexity in Coq
Koopman operator	(CAV 2022) Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
kr	(ASPOCP 2022)
KR and Machine Learning	(KR 2022) Interpreting Neural Networks as Quantitative Argumentation Frameworks (Extended Abstract)
Kripke semantics	(ARQNL 2022) Towards a Coq formalization of a quantified modal logic
L
Labelled Tableaux	(ASL 2022) Labelled Tableaux for Linear Time Bunched Implication Logic
Labelled Transition Systems	(PDAR 2022) A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
Lafont category	(LICS 2022) Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
Lambda calculus	(FSCD 2022) Linear lambda-calculus is linear (FSCD 2022) On Quantitative Algebraic Higher-Order Theories (PC 2022) Towards higher order proof complexity (ITP 2022) The Zoo of Lambda-Calculus Reduction Strategies, and Coq (LICS 2022) Reasonable Space for the Lambda-Calculus, Logarithmically (LICS 2022) Curry and Howard Meet Borel
lambda-abstraction	(iPRA 2022) When iota Meets lambda
lambda-calculus	(FSCD 2022) Strategies for Asymptotic Normalization (FSCD 2022) Solvability for Generalized Applications (FSCD 2022) Normalization without syntax (TLLA-LINEARITY-2022) (WPTE 2022) Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language (LICS 2022) Resource approximation for the lambda-mu-calculus
lambda-mu-calculus	(LICS 2022) Resource approximation for the lambda-mu-calculus
Lambek calculus	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic (TERMGRAPH 2022) Transformation of DPO Grammars into Hypergraph Lambek Grammars With The Conjunctive Kleene Star
language	(SMT 2022) The VMT-LIB Language and Tools
Language inclusion	(CAV 2022) FORQ-based Language Inclusion Formal Testing
Language of a knowledge base	(iPRA 2022) Application of Interpolation in Networks
language-based mechanisms	(CSF 2022) DPL: A Language for GDPR Enforcement
language-based security	(CSF 2022) IFCIL: An Information Flow Configuration Language for SELinux
large neighborhood search	(CP 2022) DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security
Large Neighbourhood Search	(CP 2022) Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
Large Prime Fields	(SMT 2022) On Satisfiability of Polynomial Equations over Large Prime Fields
large-neighbourhood search	(KR 2022) ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (ICLP 2022) Large-Neighbourhood Search for ASP Optimisation
LARS	(KR 2022) Chasing streams with existential rules
lattice theory	(CAV 2022) The Lattice-Theoretic Essence of Property Directed Reachability Analysis
Lattice-based many-valued logics	(iPRA 2022) First-Order Interpolation Derived from Propositional Interpolation
Law of Excluded Middle	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
Lazy clause generation	(CP 2022) Explaining Propagation for Gini and Spread with Variable Mean
lazy encoding	(SMT 2022) User-Propagators for Custom Theories in SMT Solving
Lazy paramodulation	(PAAR 2022) Lazy Paramodulation in Practice
Le\'sniewski	(IJCAR 2022) Le\'sniewski's Ontology -- Proof-Theoretic Characterization
Lean	(ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean (ITP 2022) Formalized functional analysis with semilinear maps (ITP 2022) Formalizing the ring of adèles of a global field
Lean prover	(ITP 2022) Use and abuse of instance parameters in the Lean mathematical library
Learning	(NMR 2022) Truth-Tracking with Non-Expert Information Sources (ModRef2022) Constraint modelling and solving: Learning from observing people
learning capabilities	(KR 2022) Discovering User-Interpretable Capabilities of Black-Box Planning Agents
learning decision trees	(PCCR2022) Learning Small Decision Trees (PCCR2022)
learning from examples	(DL 2022) A new dimension to generalization: computing temporal EL concepts from positive examples (Extended Abstract)
Learning from Time-series Data	(NSV 2022) TBA
learning policies	(KR 2022) Learning generalized policies without supervision using GNNs
Least General Generalizations	(DL 2022) Actively Learning ELIQs in the Presence of DL-Lite-Horn Ontologies
Legal Reasoning	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
Legal Rule Modelling	(GDE 2022) Integration of Logical English and s(CASP)
Legal Technology	(GDE 2022) Blawx: Web-based user-friendly Rules as Code
Legendre PRF	(CSF 2022) Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing
lemma generation	(WPTE 2022) Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
Letrec languages	(UNIF 2022) Nominal Anti-Unification of Letrec-Expressions
lexicographic inference	(NMR 2022) Conditional Syntax Splitting, Lexicographic Entailment and the Drowning Effect
Leximax	(SAT 2022) SAT-based Leximax Optimisation Algorithms
Library	(XLoKR 2022) Explaining Description Logic Entailments in Practice with Evee and Evonne (FOMEO'22) DOMtutor -- Competitive Programming as Teaching Tool
library design	(Coq2022) A Coq Library for Mechanised First-Order Logic
Library of encodings	(SAT 2022) QBF Programming with the Modeling Language Bule
lifted strips	(KR 2022) Learning generalized policies without supervision using GNNs
Linear Algebra	(TLLA-LINEARITY-2022) (ITP 2022) Formalising Fisher’s Inequality: Formal Linear Algebraic Techniques in Combinatorics (ITP 2022) Formalized functional analysis with semilinear maps (Coq2022) QuantumLib: A Library for Quantum Computing in Coq
Linear Approximation	(CAV 2022) Example Guided Synthesis of Linear Approximations for Neural Network Verification
Linear Arithmetic	(IJCAR 2022) An Efficient Subsumption Test Pipeline for BS(LRA) Clauses
Linear Bounding	(CAV 2022) Example Guided Synthesis of Linear Approximations for Neural Network Verification
linear constraints	(CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
Linear dynamical systems	(IJCAR 2022) On eventual non-negativity and positivity for the weighted sum of powers of matrices (VeriProp 2022) Safe Sampling-Based Planning for Stochastic Systems with Uncertain Dynamics
linear equations	(PCCR2022) Resolving Inconsistency of Linear Equations (LICS 2022) Solvability of orbit-finite systems of linear equations
Linear Integer Arithmetic	(CAV 2022) Local Search For SMT on Linear Integer Arithmetic (LICS 2022) Geometric decision procedures and the VC dimension of linear arithmetic theories
linear logic	(IJCAR 2022) Non-associative, non-commutative multi-modal linear logic (FSCD 2022) Linear lambda-calculus is linear (FSCD 2022) Decision problems for linear logic with least and greatest fixed points (TLLA-LINEARITY-2022) (TLLA-LINEARITY-2022) (TLLA-LINEARITY-2022) (TLLA-LINEARITY-2022) (TERMGRAPH 2022) Ideograph: A Language for Expressing and Manipulating Structured Data (LICS 2022) A functorial excursion between algebraic geometry and linear logic (LICS 2022) Bouncing threads for circular and non-wellfounded proofs (LICS 2022) Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings (LICS 2022) Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (LICS 2022) Resource approximation for the lambda-mu-calculus (LICS 2022) Logical Foundations of Quantitative Equality
linear loops	(LICS 2022) Computing the Density of the Positivity Set for Linear Recurrence Sequences (WST22) Deciding Termination of Uniform Loops with Polynomial Parameterized Complexity
Linear programming relaxation	(CP 2022) Weisfeiler-Leman Invariant Promise Valued CSPs
linear real	(LICS 2022) Geometric decision procedures and the VC dimension of linear arithmetic theories
Linear recurrence sequences	(IJCAR 2022) On eventual non-negativity and positivity for the weighted sum of powers of matrices (LICS 2022) Computing the Density of the Positivity Set for Linear Recurrence Sequences
linear temporal logic	(KR 2022) A Gödel calculus for Linear Temporal Logic (DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps
Linear Temporal Logic on finite traces (LTLf)	(KR 2022) Act for Your Duties but Maintain Your Rights
Linear Time Logic	(ASL 2022) Labelled Tableaux for Linear Time Bunched Implication Logic
Linear-time/branching-time spectrum	(LICS 2022) Graded Monads and Behavioural Equivalence Games
Linearisation	(IFIP-WG1.6) Quantitative Weak Linearisation
linearize arithmetic	(TLLA-LINEARITY-2022)
Linicrypt	(CSF 2022) A Complete Characterization of Security for Linicrypt Block Cipher Modes
Linkability	(CSF 2022) Privacy as Reachability
linter	(Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation
list	(IFIP-WG1.6) RLooP
literate programming	(Coq2022) jsCoq: Literate Proof Documents Dressed for the Web
Liveness	(LICS 2022) Deciding Hyperproperties Combined with Functional Specifications
LLVM	(ITP 2022) Refinement of Parallel Algorithms down to LLVM (PDAR 2022) Refinement of Parallel Algorithms down to LLVM
lob induction	(FSCD 2022) A stratified approach to Lob induction
local consistency	(LICS 2022) Smooth approximations and CSPs over finitely bounded homogeneous structures
local deduction theorem	(iPRA 2022) Interpolation via Finitely Subdirectly Irreducible Algebras
Local Search	(CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry (CAV 2022) Local Search For SMT on Linear Integer Arithmetic
local verification	(CAV 2022) Shared Certificates for Neural Network Verification
local-time semantics	(LICS 2022) Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Locality	(LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth (LICS 2022) When Locality Meets Preservation
locally presentable category	(LICS 2022) Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
Log Generation	(ICLP 2022) ASP-Based Declarative Process Mining
Logarithmic Space	(LICS 2022) Separating LREC from LFP
Logic	(LICS 2022) Separating LREC from LFP (CSF 2022) Cracking the Stateful Nut -- Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant (FOMEO'22) LogInd, a tool for supporting students in mastering structural induction
logic for PTime	(LICS 2022) Choiceless Polynomial Time with Witnessed Symmetric Choice
logic languages	(PAAR 2022) TBA
Logic Locking	(CSF 2022) Locked Circuit Indistinguishability: A Notion of Security for Logic Locking
logic methods	(LMML 2022) Building Optimal Decision Trees (LMML 2022) TBA (LMML 2022) TBA (LMML 2022) The Exciting Theory of Formal Explanations (LMML 2022) TBA (LMML 2022) TBA
Logic of Here-and-There	(ICLP 2022) Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
Logic of Paradox	(ICLP 2022) On Paraconsistent Belief Revision: the Case of Priest’s Logic of Paradox
logic program splitting	(ASPOCP 2022)
logic programming	(KR 2022) Rushing and Strolling among Answer Sets -- Navigation Made Easy (Extended Abstract) (KR 2022) Chasing streams with existential rules (KR 2022) On Syntactic Forgetting with Strong Persistence (KR 2022) Optimisation Methods for Complex Event Recognition (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (ASPOCP 2022) (GDE 2022) Integration of Logical English and s(CASP) (ICLP 2022) Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory (NMR 2022) Bipolar Argumentation Frameworks with Explicit Conclusions: Connecting Argumentation and Logic Programming (NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer (DL 2022) Advanced languages of terms for ontologies
logic programming and automated reasoning	(ICLP 2022) Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
Logic Programming and Machine Learning	(ICLP 2022) A Gaze into the Internal Logic of Graph Neural Networks, with Logic
logic-based ontologies	(NMR 2022) Hybrid Anwer Set Programming: Opportunities and Challenges (DL 2022) Hybrid Anwer Set Programming: Opportunities and Challenges
Logical Atomicity	(ASL 2022) Proving Logical Atomicity using Lock Invariants (ASL 2022) Functional correctness specifications for concurrent data structures: Logical Atomicity in Iris
Logical Constraints	(KR 2022) LACE: A Logical Approach to Collective Entity Resolution
Logical Entailments	(KR 2022) A Graph Neural Network Reasoner for Game Description Language
logical framework	(FSCD 2022) Encoding type universes without using matching modulo associativity and commutativity
Logical Frameworks	(FSCD 2022) Adequate and computational encodings in the logical framework Dedukti
logical relations	(FSCD 2022) A Fibrational Tale of Operational Logical Relations (TLLA-LINEARITY-2022) (LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction) (CSF 2022) Proving full-system security properties under multiple attacker models on capability machines
Logics for Multi-Agent Systems	(KR 2022) Logics for Representation and Design of Auctions
Logics of uncertainty	(KR 2022) Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
Lookaheads	(FSCD 2022) On Lookaheads in Regular Expressions with Backreferences
loop acceleration	(IJCAR 2022) Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) (WST22) A Calculus for Modular Non-Termination Proofs by Loop Acceleration (WST22) LoAT: The Loop Acceleration Tool
Loop Invariant Generation	(CAV 2022) Affine Loop Invariant Generation via Matrix Algebra
Lossy channel systems	(LICS 2022) On the Satisfiability of Context-free String Constraints with Subword Ordering
Low-complexity Description Logics	(KR 2022) Sticky Policies in OWL2: Extending PL with fixpoints and Transitive Closure
lower bound	(ITP 2022) Formalizing Algorithmic Bounds in the Query Model in EasyCrypt
lower bounds	(PC 2022) QCDCL with Cube Learning or Pure Literal Elimination – What is best? (SAT 2022) Should decisions in QCDCL follow prefix order? (SAT 2022) Classes of Hard Formulas for QBF Resolution (LICS 2022) Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes (WST22) LoAT: The Loop Acceleration Tool
lower runtime bounds	(IJCAR 2022) Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
Lower-regular	(ICLP 2022) Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
LP^MLN	(ASPOCP 2022)
LREC	(LICS 2022) Separating LREC from LFP
LTI	(FOMEO'22) Iltis: Teaching Logic in the Web
LTL	(CAV 2022) From Spot 2.0 to Spot 2.10: What's New? (SYNT 2022) LTL Synthesis with Transformer Neural Networks (SYNT 2022) Reactive Synthesis of LTL specifications with Rich Theories
LTLf synthesis	(KR 2022) Act for Your Duties but Maintain Your Rights
M
machine learning	(IJCAR 2022) Guiding an Automated Theorem Prover with Neural Rewriting (KR 2022) Negative Statements Considered Useful (Extended Abstract) (KR 2022) Faithful Approaches to Rule Learning (KR 2022) Investigating Novel Representations and Deep Reinforcement Learning for General Game Playing (ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data (ICLP 2022) MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (CP 2022) Learning Constraint Programming Models from Data using Generate-and-Aggregate (CP 2022) Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation (CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints (ITP 2022) The Isabelle ENIGMA (WOLVERINE 2022) (SAT 2022) Towards Learning Quantifier Instantiation in SMT (SAT 2022) A Comprehensive Study of k-Portfolios of Recent SAT Solvers (CSF 2022) Membership Inference Attacks against Classifiers (LMML 2022) Building Optimal Decision Trees (LMML 2022) TBA (LMML 2022) TBA (LMML 2022) The Exciting Theory of Formal Explanations (LMML 2022) TBA (LMML 2022) TBA
machine learning classifiers	(XLoKR 2022) Should counterfactual explanations always be data instances?
Machine Learning Compiler	(CAV 2022) SMT-based Translation Validation for Machine Learning Compiler
machine learning theory	(CP 2022) Improved Learning Bounds for Branch-and-Cut
Machine Reasoning	(XLoKR 2022) Dialogue-Based Explanations of Reasoning in Rule-based Systems
magic wand	(CAV 2022) Sound Automation of Magic Wands
maintainability	(Isabelle 2022) A Linter for Isabelle: Implementation and Evaluation
Many-Sorted Logic	(UNIF 2022) Fuzzy Order-Sorted Feature Term Unification
MAP inference	(ICLP 2022) Efficient Knowledge Compilation Beyond Weighted Model Counting
Marine Exploration	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Maritime Traffic Control	(CP 2022) Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data
Markdown	(FOMEO'22) Prooffold: a prototype for displaying structured proofs
Markov categories	(LICS 2022) Probability monads with submonads of deterministic states
Markov decision processes	(CAV 2022) PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP (CAV 2022) Abstraction-Refinement for Hierarchical Probabilistic Models
Markov equivalence	(MC-2022) Extending Partially Directed Graphs and Determine the Size of their Markov Equivalence Class
Martingales	(CAV 2022) Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs
Match-bounds	(WST22) Approximating Relative RFC-Match-Bounds
Matching	(FSCD 2022) Combined Hierarchical Matching: The Regular Case
matching modulo AC	(FSCD 2022) Encoding type universes without using matching modulo associativity and commutativity
Mathematical Components	(ITP 2022) Reflexive tactics for algebra, revisited
Mathematical Formalisation	(ITP 2022) Formalising Fisher’s Inequality: Formal Linear Algebraic Techniques in Combinatorics
Mathematical fuzzy logic	(KR 2022) Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
Mathematical Knowledge Exploration	(ThEdu'22) Invited Talk: Computer-assisted proofs and automated methods in Mathematics Education
Mathematical Learning Environment	(Isabelle 2022) Towards Accessible Formal Mathematics with ISAC and Isabelle/VSCode
mathematical proofs	(FOMEO'22) Prooffold: a prototype for displaying structured proofs
Mathematics	(ITP 2022) Formalized functional analysis with semilinear maps
Mathematics Education	(ThEdu'22) Invited Talk: Computer-assisted proofs and automated methods in Mathematics Education
mathlib	(ITP 2022) Formalizing the ring of adèles of a global field
Matrix Algebra	(CAV 2022) Affine Loop Invariant Generation via Matrix Algebra
matroid	(SAT 2022) A SAT Attack on Rota's Basis Conjecture
Max#SAT	(SAT 2022) A New Exact Solver for (Weighted) Max#SAT
max-sat	(CP 2022) Learning MAX-SAT Models from Examples using Genetic Algorithms and Knowledge Compilation (SAT 2022) On the Parallel Parameterized Complexity of MaxSAT Variants (PDAR 2022) On the Parallel Parameterized Complexity of MaxSAT Variants
Max-SAT Resolution	(CP 2022) From Crossing-Free Resolution to Max-SAT Resolution
maximum clique	(CP 2022) From Cliques to Colorings and Back Again
maximum satisfiability	(IJCAR 2022) Clause Redundancy and Preprocessing in Maximum Satisfiability (SAT 2022) Analysis of Core-Guided MaxSAT Using Cores and Correction Sets (SAT 2022) Incremental Maximum Satisfiability (SAT 2022) MaxSAT-Based Bi-Objective Boolean Optimization
MaxSAT	(IJCAR 2022) Clause Redundancy and Preprocessing in Maximum Satisfiability (SAT 2022) Incremental Maximum Satisfiability (SAT 2022) Introducing Intel(R) SAT Solver
Mazurkiewicz Traces	(CAV 2022) Synthesis and Analysis of Petri Nets from Causal Specifications
MDD	(CP 2022) CNF Encodings of Binary Constraint Trees
Mean payoff	(CAV 2022) PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP
measure theory	(ITP 2022) Mechanizing Soundness of Off-Policy Evaluation
Mechanism Design	(KR 2022) Logics for Representation and Design of Auctions
mechanization	(FSCD 2022) Certified Decision Procedures for Two-Counter Machines
mechanized proofs	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
membership	(LICS 2022) The amazing mixed polynomial closure and its applications to two-variable first-order logic
membership inference	(CSF 2022) Membership Inference Attacks against Classifiers
Memory allocation	(ASL 2022) Deciding Separation Logic with Heap Lists
Memory automata	(FSCD 2022) On Lookaheads in Regular Expressions with Backreferences
memory sharing	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
message passing	(FOMEO'22) Teaching Concurrency with pseuCo Book
Meta Logic Solving	(SMT 2022) Goose: A Meta Solver for Deep Neural Network Verification
meta-programming	(Coq2022) Trakt: a generic pre-processing tactic for theory-based proof automation
Metaheuristics	(CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
metric differential privacy	(CSF 2022) Universal Optimality and Robust Utility Bounds for Metric Differential Privacy
metric spaces	(FSCD 2022) On Quantitative Algebraic Higher-Order Theories
metric temporal queries	(XLoKR 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended Abstract)
metrics	(LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Minimal tableau	(IJCAR 2022) Synthetic tableaux: minimal tableau search heuristics
Minimal typings	(IFIP-WG1.6) Quantitative Weak Linearisation
minimal unsastisfiable set	(IJCAR 2022) Semantic Relevance
Minimalist Type Theory	(HoTT/UF 2022)
minimality criterion	(IJCAR 2022) Connection-minimal Abduction in EL via translation to FOL (DL 2022) Connection-minimal Abduction in EL via translation to FOL (Extended Abstract)
Minimally Unsatisfiable Subsets	(ASPOCP 2022)
Minimum description length	(SYNT 2022) Regex+: Synthesizing Regular Expressions from Positive Examples
minimum explanations	(CP 2022) Complexity of Minimum-Size Arc-Inconsistency Explanations
minimum hitting sets	(SAT 2022) Analysis of Core-Guided MaxSAT Using Cores and Correction Sets
Mixed Integer Progamming	(CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
mixed integer programming	(CP 2022) Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data (CP 2022) DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security
Mixed-Integer Programming	(CP 2022) Solving the Constrained Single-Row Facility Layout Problem with Decision Diagrams
Mizar	(ITP 2022) Formalizing the set of primes as an alternative to the DPRM theorem (short paper)
MKNF	(ICLP 2022) An Iterative Fixpoint Semantics for MKNF Hybrid Knowledge Bases with Function Symbols
modal logic	(IJCAR 2022) Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices (IJCAR 2022) Local Reductions for the Modal Cube (KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (DECFOML2022) From Modal Logic to Fluted logic (DECFOML2022) The Quantified Reflection Calculus as a Modal Logic (ARQNL 2022) Advancing Automated Theorem Proving for the Modal Logics D and S5 (ARQNL 2022) Towards a Coq formalization of a quantified modal logic
Modal logics	(IJCAR 2022) Paraconsistent Gödel modal logic
modal mu-calculus	(LICS 2022) Size measures and alphabetic equivalence in the mu-calculus
modal operators	(ICLP 2022) Tractable Reasoning using Logic Programs with Intensional Concepts
modal type theory	(FSCD 2022) Sheaf semantics of termination-insensitive noninterference (FSCD 2022) A stratified approach to Lob induction (LICS 2022) Normalization for Multimodal Type Theory
modalities	(LICS 2022) Normalization for Multimodal Type Theory
model building	(PAAR 2022) Exploring Partial Models with SCL (FOMEO'22) First-Order Logic Workbook
model checking	(TERMGRAPH 2022) Formalization and analysis of BPMN using graph grammars (CAV 2022) Explaining Hyperproperty Violations (CAV 2022) The Lattice-Theoretic Essence of Property Directed Reachability Analysis (CAV 2022) Trainify: A CEGAR-Driven Training and Verification Framework for Verifiable Deep Reinforcement Learning (CAV 2022) STLmc: Robust STL Model Checking of Hybrid Systems using SMT (iPRA 2022) Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification (ITP 2022) (Invited) Modelling and Verifying Properties of Biological Neural Networks (LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth (LICS 2022) Temporal Team Semantics Revisited (LICS 2022) Size measures and alphabetic equivalence in the mu-calculus (SMT 2022) The VMT-LIB Language and Tools (SMT 2022) NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems
Model Checking Problem	(CP 2022) Fixed-Template Promise Model Checking Problems
Model Counter	(CP 2022) Constraint Acquisition Based on Solution Counting
Model Counting	(CAV 2022) Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation (MC-2022) Scalable Uniform Sampling via Efficient Knowledge Compilation (MC-2022) Quantifying Software Reliability via Model-Counting (MC-2022) Recursive Solutions to First-Order Model Counting (SAT 2022) Proofs for Propositional Model Counting (LICS 2022) On Almost-Uniform Generation of SAT Solutions: The power of 3-wise independent hashing
model learning	(KR 2022) Faithful Approaches to Rule Learning
Model reconciliation	(ICLP 2022) On Model Reconciliation: How to Reconcile When Robot Does not Know Human’s Model? (ICLP 2022) Model Reconciliation in Logic Programs
Model Synthesis	(CP 2022) Learning Constraint Programming Models from Data using Generate-and-Aggregate
model theory	(ASL 2022) On the Expressiveness of a Logic of Separated Relations
model-based reasoning	(KR 2022) Data Efficient Paradigms for Personalized Assessment of Taskable AI Systems
Model-Checking	(CAV 2022) Software Verification of Hyperproperties beyond k-safety
Modeling	(SAT 2022) QBF Programming with the Modeling Language Bule
Modelling	(CP 2022) Plotting: A Planning Problem With Complex Transitions (SAT 2022) OptiLog v2: Model, Solve, Tune And Run (FOMEO'22) First-Order Logic Workbook
models of computation	(ITP 2022) Synthetic Kolmogorov Complexity in Coq
modular circuits	(LICS 2022) Complexity of Modular Circuits
Modular Reasoning	(VeriProp 2022) A Quantitative Verification Infrastructure (DL 2022) Next Steps for ReAD: Modules for Classification Optimisation
Modular termination	(WST22) The System SOL version 2022 (Tool Description)
modularity	(FSCD 2022) Cutting a Proof into Bite-Sized Chunks: Incrementally Proving Termination in Higher-Order Term Rewriting (ICLP 2022) Nested Justification Systems (WST22) Things WANDA cannot do
module system	(WPTE 2022) A Machine-Checked Formalisation of Erlang Modules
monadic decomposability	(LICS 2022) Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
monadic dependence	(LICS 2022) Model Checking on Interpretations of Classes of Bounded Local Cliquewidth
monadic embedding	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
monadic second-order logic	(CAV 2022) Reasoning about Data Trees using CHCs
monadic stability	(LICS 2022) Stable graphs of bounded twin-width
monads	(LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning (LICS 2022) Probability monads with submonads of deterministic states
monoidal category	(LICS 2022) Monoidal Streams for Dataflow Programming (HoTT/UF 2022)
monoidal closed categories	(FSCD 2022) Rewriting for monoidal closed categories
monoidal stream	(LICS 2022) Monoidal Streams for Dataflow Programming
monotone circuits	(Isabelle 2022) From P != NP to monotone circuits of super-polynomial size
monte carlo	(VeriProp 2022) Deterministic stream-sampling for probabilistic programming: semantics and verification
Monte Carlo techniques	(ICLP 2022) Inference and Learning with Model Uncertainty in Probabilistic Logic Programs
Most specific concept	(DL 2022) Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract)
Motion planning	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
MSC Languages	(CAV 2022) Synthesis and Analysis of Petri Nets from Causal Specifications
mu-calculus	(LICS 2022) Bouncing threads for circular and non-wellfounded proofs
Multi--One Peak	(IWC 2022) Confluence by Higher-Order Multi--One Critical pairs with an application to the Functional Machine Calculus
Multi-Agent Debate	(KR 2022) Forecasting Argumentation Frameworks
multi-agent epistemic logic	(KR 2022) On the learnability of knowledge in language domains
Multi-Agent Path Coordination	(CP 2022) Trajectory Optimization for Safe Navigation in Maritime Traffic Using Historical Data
Multi-Agent Systems	(KR 2022) Automatic Synthesis of Dynamic Norms for Multi-Agent Systems (KR 2022) Towards an Enthymeme-Based Communication Framework in Multi-Agent Systems (NMR 2022) Modelling Agents Roles in the Epistemic Logic L-DINF (WOLVERINE 2022)
Multi-context systems	(XLoKR 2022) Modular Provenance in Multi-Context Systems
Multi-homomorphism	(CP 2022) Fixed-Template Promise Model Checking Problems
multi-modal verification	(CAV 2022) UCLID5: Multi-Modal Formal Modeling, Verification, and Synthesis
Multi-Objective Optimisation	(SAT 2022) SAT-based Leximax Optimisation Algorithms
Multi-objective optimization	(SAT 2022) MaxSAT-Based Bi-Objective Boolean Optimization
multi-paradigm	(GDE 2022) Embedding s(CASP) in Prolog
Multi-shot solving	(ICLP 2022) Large-Neighbourhood Search for ASP Optimisation (ICLP 2022) Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP (ICLP 2022) A Multi-shot ASP Encoding for the Aircraft Routing and Maintenance Planning Problem
multi-valued decision diagrams	(CP 2022) MDD-Based Constraint Programming in Haddock
Multilayer Perceptrons	(ICLP 2022) An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases
multinomial theorem	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
multiparty communication complexity	(PC 2022) Proof complexity of natural formulas via communication arguments
multiparty computation	(CSF 2022) Collusion-Preserving Computation without a Mediator
Multiplicative-additive fragment	(TLLA-LINEARITY-2022)
multiset	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
multiset rewriting	(CSF 2022) Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
multistep reduction	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
Multiwinner Voting	(KR 2022) Simulating Multiwinner Voting Rules in Judgment Aggregation
muMALL	(TLLA-LINEARITY-2022)
music composition	(CP 2022) Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints
mutation	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
N
Narrowing strategies	(ICLP 2022) From Logic to Functional Logic Programs
Nash Equilibria	(KR 2022) Verification and Realizability in Finite-Horizon Multiagent Systems
Natural Deduction	(DL 2022) A Labelled Natural Deduction System for an Intuitionistic Description Logic with Nominals
natural language generation	(Coq2022) Autogenerating Natural Language Proofs
natural language processing	(ICLP 2022) Knowledge Authoring with Factual English
natural semantics	(WPTE 2022) A Machine-Checked Formalisation of Erlang Modules
Negation as Failure	(ICLP 2022) FOLD-RM: A Scalable and Efficient Inductive Learning Algorithm for Multi-Category Classification of Mixed Data
negative knowledge	(KR 2022) Negative Statements Considered Useful (Extended Abstract)
Negative Statements	(KR 2022) A Minimal Deductive System for RDFS with Negative Statements
negative translation	(TLLA-LINEARITY-2022)
negotiations	(LICS 2022) Active learning for sound negotiations
nested regular path queries	(ICLP 2022) Jumping Evaluation of Nested Regular Path Queries
Nested sequent	(KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents
Nested sequent calculus	(FSCD 2022) A Methodology for Designing Proof Search Calculi for Non-Classical Logics
Network security	(CP 2022) DUELMIPs: Jointly Optimizing Software Defined Network Functionality and Security (CSF 2022) N-Tube: Formally Verified Secure Bandwidth Reservation in Path-Aware Internet Architectures
Networks	(iPRA 2022) Application of Interpolation in Networks
networks/graphs	(CP 2022) Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
neural network	(CAV 2022) Verifying Neural Networks Against Backdoor Attacks
Neural Network Models	(KR 2022) A conditional, a fuzzy and a probabilistic interpretation of self-organising maps (Abstract)
Neural Network Verification	(CAV 2022) Shared Certificates for Neural Network Verification (CAV 2022) Example Guided Synthesis of Linear Approximations for Neural Network Verification (SMT 2022) Goose: A Meta Solver for Deep Neural Network Verification
neural networks	(KR 2022) A Graph Neural Network Reasoner for Game Description Language (KR 2022) Looking Inside the Black-Box: Logic-based Explanations for Neural Networks (KR 2022) Investigating Novel Representations and Deep Reinforcement Learning for General Game Playing (CAV 2022) Example Guided Synthesis of Linear Approximations for Neural Network Verification (CAV 2022) Neural Network Robustness as a Verification Property: A Principled Case Study (WOLVERINE 2022)
Neural networks verification	(CAV 2022) RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems
neural symbolic learning	(ICLP 2022) DeepStochLog: Neural Stochastic Logic Programming
Neural-symbolic integration	(ICLP 2022) Exploiting Parameters Learning for Hyper-parameters Optimization in Deep Neural Networks
Neuro-Symbolic	(KR 2022) Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings
neuro-symbolic AI	(KR 2022) Interpreting Neural Networks as Quantitative Argumentation Frameworks (Extended Abstract) (KR 2022) Neural-Probabilistic Answer Set Programming (GDE 2022) A Hybrid Neuro-Symbolic Approach for Text-Based Games using Inductive Logic Programming (NMR 2022) Hybrid Anwer Set Programming: Opportunities and Challenges (DL 2022) Hybrid Anwer Set Programming: Opportunities and Challenges
neuro-symbolic computing	(ICLP 2022) A Neuro-Symbolic ASP Pipeline for Visual Question Answering
Neuronal networks	(ITP 2022) (Invited) Modelling and Verifying Properties of Biological Neural Networks
NFA	(CP 2022) CNF Encodings of Binary Constraint Trees
NLP	(ModRef2022) Constraint-based Part-of-Speech Tagging
NMatrices	(IJCAR 2022) Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices
nominal algorithms	(FSCD 2022) Nominal Anti-Unification with Atom-Variables
nominal logic	(IJCAR 2022) Rensets and Renaming-Based Recursion for Syntax and Bindings
Nominal Techniques	(UNIF 2022) Nominal Anti-Unification of Letrec-Expressions
Non-classical Logic	(KR 2022) Impact of Logic Paradigms on Abstract Argumentation (PAAR 2022) Automated Reasoning in Non-classical Logics in the TPTP World
non-classical logics	(PAAR 2022) An Extensible Logic Embedding Tool for Lightweight Non-Classical Reasoning (ARQNL 2022) Solving QMLTP Problems by Translation to Higher-order Logic
Non-classical Semantics	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach
non-deterministic semantics	(IJCAR 2022) Finite two-dimensional proof systems for non-finitely axiomatizable logics (IJCAR 2022) Effective Semantics for the Modal Logics K and KT via Non-deterministic Matrices
non-interactive key exchange	(CSF 2022) Bringing State-Separating Proofs to EasyCrypt - A Security Proof for Cryptobox
Non-linear constraints	(CAV 2022) Distilling Constraints in Zero-Knowledge Protocols
non-linear reasoning	(SMT 2022) An SMT Approach for Solving Polynomials over Finite Fields
non-monotonic logic	(NMR 2022) Conditional Syntax Splitting, Lexicographic Entailment and the Drowning Effect
Non-monotonic logical reasoning	(ICLP 2022) What do you really want to do? Towards a Theory of Intentions for Human-Robot Collaboration (NMR 2022) There and Back Again: Combining Nonmonotonic Logical Reasoning and Deep Learning on an Assistive Robot
non-monotonic reasoning	(IJCAR 2022) Sequent Calculi for Choice Logics (KR 2022) A General Framework for Modelling Conditional Reasoning - Preliminary Report (KR 2022) Impact of Logic Paradigms on Abstract Argumentation (NMR 2022) Situated Conditionals - A Brief Introduction (NMR 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (NMR 2022) Defeasible reasoning in RDFS (NMR 2022) Conditional Syntax Splitting, Lexicographic Entailment and the Drowning Effect (NMR 2022) Pointwise Circumscription in Description Logics (DL 2022) Rational defeasible subsumption in DLs with nested quantifiers: the case of ELI_⊥ (DL 2022) Defeasible reasoning in RDFS (XLoKR 2022) On interactive explanations as reasoning
Non-monotonic reasoning in DLs	(DL 2022) Pointwise Circumscription in Description Logics
Non-normal modal logics	(ARQNL 2022) Reasoning in Non-normal Modal Description Logics
Non-optimality of proof systems	(PC 2022) Average-Case Hardness of Proving Tautologies and Theorems
Non-prioritised revision	(KR 2022) Who’s the Expert? On Multi-source Belief Revision
non-redundant clause learning	(PAAR 2022) Exploring Partial Models with SCL
non-termination	(IJCAR 2022) Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description) (ITP 2022) A Verified Cyclicity Checker (WST22) A Calculus for Modular Non-Termination Proofs by Loop Acceleration (WST22) LoAT: The Loop Acceleration Tool
Nondeterminism	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing (LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability
Nondisjoint theories	(SMT 2022) CDSAT for nondisjoint theories with shared predicates: arrays with abstract length
noninterference	(FSCD 2022) Sheaf semantics of termination-insensitive noninterference (CSF 2022) Towards a General-Purpose Dynamic Information Flow Policy
nonlinear real arithmetic	(IJCAR 2022) Cooperating Techniques for Solving nonlinear arithmetic in the cvc5 SMT solver (System Description)
nonmonotonic reasoning	(KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs (ABR 2022)
Normal Logic Programs	(ICLP 2022) Graph-based Interpretation of Normal Logic Programs
Normalisation	(IWC 2022) Uniform Completeness
normalization	(FSCD 2022) Restricting tree grammars with term rewriting (FSCD 2022) Strategies for Asymptotic Normalization (LICS 2022) Normalization for Multimodal Type Theory
normalization by evaluation	(HoTT/UF 2022)
Normative Systems	(KR 2022) Automatic Synthesis of Dynamic Norms for Multi-Agent Systems
notebook	(FOMEO'22) First-Order Logic Workbook
nowhere dense	(LICS 2022) Treelike decompositions for transductions of sparse graphs
Nullstellensatz	(LICS 2022) On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Number Fields	(LICS 2022) Identity testing for radical expressions
O
OBDA	(DL 2022)
OBDD	(SAT 2022) Changing Partitions in Rectangle Decision Lists
OBDD-based proof systems	(SAT 2022) Tight Bounds for Tseitin Formulas
Object-Centric Event Logs	(DL 2022) Extraction of Object-Centric Event Logs through Virtual Knowledge Graphs
observational equivalence	(CSF 2022) Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
off-line guessing	(CSF 2022) Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
OMQA	(DL 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (XLoKR 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended Abstract)
online	(FOMEO'22) Tableaunoir: an online blackboard for teaching formal methods and making slides
Online Grounding of Planning Domains	(KR 2022) Online Grounding of Symbolic Planning Domains in Unknown Environments
online LTL monitoring	(CAV 2022) Oblivious Online Monitoring for Safety LTL Specification via Fully Homomorphic Encryption
Online Planning	(NMR 2022) Towards Legally and Ethically Correct Online HTN Planning for Data Transfer
online teaching	(FOMEO'22) Experiences on Online Teaching of Formal Methods to Systems Engineering Students
ontological argument	(ARQNL 2022) Intuitionistic derivability in Anderson's variant of the ontological argument
ontologies	(KR 2022) Looking Inside the Black-Box: Logic-based Explanations for Neural Networks (NMR 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results (DL 2022) Fine-Grained Forgetting for the Description Logic ALC (DL 2022) Computing Concept Referring Expressions with Standard OWL Reasoners (DL 2022) Concept Abduction for Description Logics (DL 2022) Hybrid MHS-MXP ABox Abduction Solver: First Emprical Results (DL 2022) An API for DL Abduction Solvers (DL 2022) Ontology-based Data Federation (Extended Abstract) (XLoKR 2022) An API for DL Abduction Solvers
ontology	(IJCAR 2022) Hyper-graph based Inference Rules for Computing EL+-Ontology Justifications (IJCAR 2022) Le\'sniewski's Ontology -- Proof-Theoretic Characterization (KR 2022) On Merging of Open-Domain Ontologies (KR 2022) Structure-based ontology extensions (ICLP 2022) Efficient Datalog Rewriting for Query Answering in TGD Ontologies
ontology alignment	(NMR 2022) Modelling Multiple Perspectives by Standpoint-Enhanced Description Logics (DL 2022) Modelling Multiple Perspectives by Standpoint-Enhanced DLs
Ontology Based Data Access	(KR 2022) Data Quality in Ontology-Based Data Access
ontology extension	(KR 2022) Structure-based ontology extensions
Ontology repair	(NMR 2022) Repairing Ontologies via Kernel Pseudo-Contraction (BCORE-22) (BCORE-22) (DL 2022) Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract) (DL 2022) Repairing Ontologies via Kernel Pseudo-Contraction
Ontology-based data access	(DL 2022) (DL 2022) Extraction of Object-Centric Event Logs through Virtual Knowledge Graphs
ontology-mediated query	(DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps
Ontology-mediated query answering	(KR 2022) Counting queries over ELHI⊥ ontologies (KR 2022) Finite Entailment of UCRPQs over ALC Ontologies (KR 2022) Decidability Limits of Finite Ontology-Mediated Query Entailment (DL 2022) Complexity Landscape for Counting Queries (Extended abstract)
ontology-mediated querying	(KR 2022) Ontology-Mediated Querying on Databases of Bounded Cliquewidth (KR 2022) Conservative Extensions for Existential Rules
Open Challenges	(SYNT 2022) Future Work and Open Challenges Panel – Authors+Chairs
open problems	(IFIP-WG1.6) RLooP
open relation extraction	(KR 2022) Open Relation Extraction With Non-existent and Multi-span Relationships
opening	(DL 2022) DL Opening Remarks
operational and denotational semantics	(VeriProp 2022) Deterministic stream-sampling for probabilistic programming: semantics and verification
operational semantics	(FSCD 2022) A Fibrational Tale of Operational Logical Relations
operator	(KR 2022) On Syntactic Forgetting with Strong Persistence
Optimal ABox Repair	(KR 2022) Pushing Optimal ABox Repair from EL Towards More Expressive Horn-DLs
optimal proof systems	(PC 2022) Simulations between proof systems
optimisation	(KR 2022) ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser
optimization	(CP 2022) Structured Set Variable Domains in Bayesian Network Structure Learning (CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling
Optimization Algorithms	(ITP 2022) Formalization of a Stochastic Approximation Theorem
orbit-finite sets	(LICS 2022) Solvability of orbit-finite systems of linear equations
Order-Sorted Logic	(UNIF 2022) Fuzzy Order-Sorted Feature Term Unification
Ordered Disjunction	(ICLP 2022) Strong Equivalence of Logic Programs with Ordered Disjunction: a Logical Perspective
Ordered Local Confluence	(IWC 2022) Uniform Completeness
Ordered Multivalued Decision Diagram	(CP 2022) Nucleus-Satellites Systems of OMDDs for Reducing the Size of Compiled Forms
Ordinal Conditional Functions	(KR 2022) Darwiche and Pearl's Epistemic States are not Total Preorders
organization	(PCCR2022) Welcome and Introduction
oudenadic embedding	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
OWL	(XLoKR 2022) Explaining Description Logic Entailments in Practice with Evee and Evonne
P
P4 language	(WPTE 2022) Refactoring Steps for P4 (work in progress)
PAC learning	(LICS 2022) Computable PAC Learning of Continuous Features
PAC semantic	(KR 2022) On the learnability of knowledge in language domains
packed classes	(ITP 2022) Reflexive tactics for algebra, revisited
packing coloring	(SAT 2022) The packing chromatic number of the infinite square grid is at least 14
PAKE	(CSF 2022) Conditional Observational Equivalence and Off-line Guessing Attacks in Multiset Rewriting
Panel	(SYNT 2022) Future Work and Open Challenges Panel – Authors+Chairs
Paraconsistency	(IJCAR 2022) Finite two-dimensional proof systems for non-finitely axiomatizable logics (KR 2022) On Paraconsistent Belief Revision in LP (Extended Abstract) (ICLP 2022) On Paraconsistent Belief Revision: the Case of Priest’s Logic of Paradox
parallel algorithms	(SAT 2022) On the Parallel Parameterized Complexity of MaxSAT Variants (PDAR 2022) On the Parallel Parameterized Complexity of MaxSAT Variants
parallel branch-and-bound	(CP 2022) Parallel Hybrid Best-First Search
parallel computation	(WST22) Runtime complexity of parallel-innermost term rewriting at TermComp 2022
Parallel Machine Scheduling	(CP 2022) Modeling and Solving Parallel Machine Scheduling with Contamination Constraints in the Agricultural Industry
Parallel Sorting Algorithms	(ITP 2022) Refinement of Parallel Algorithms down to LLVM (PDAR 2022) Refinement of Parallel Algorithms down to LLVM
parallel-innermost rewriting	(IWC 2022) On Confluence of Parallel-Innermost Term Rewriting
Parameter learning	(ICLP 2022) Inference and Learning with Model Uncertainty in Probabilistic Logic Programs
parameterised Boolean equation systems	(ARQNL 2022) (Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
parameterized complexity	(KR 2022) Ontology-Mediated Querying on Databases of Bounded Cliquewidth (ICLP 2022) Treewidth-aware Reductions of Normal ASP to SAT– Is Normal ASP Harder than SAT after All? (PCCR2022) Kemeny Rank Aggregation: Width Measure and Diversity Notion (PCCR2022) Resolving Inconsistency of Linear Equations (PCCR2022) MaxSAT: Parameterized, Parallel, Absolute (CP 2022) CSP Beyond Tractable Constraint Languages (MC-2022) Counting Complexity for Projected Reasoning in Abstract Argumentation (MC-2022) Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth (SAT 2022) Weighted Model Counting with Twin-Width
Parametric continuous-time Markov chains	(CAV 2022) Sampling-Based Verification of CTMCs with Uncertain Rates
parametric solution	(IJCAR 2022) Binary codes that do not preserve primitivity
paramodulation	(UNIF 2022) Higher-order unification from E-unification with second-order equations and parametrised metavariables
pareto front enumeration	(SAT 2022) MaxSAT-Based Bi-Objective Boolean Optimization
Parity automata	(CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
Parmeterized Algorithms	(PCCR2022) Parameterized Algorithmics and Counting: Treewidth in Practice
parser	(LICS 2022) Efficient Construction of Reversible Transducers from Regular Transducer Expressions
partial Horn theory	(LICS 2022) Linear-Algebraic Models of Linear Logic as Categories of Modules over Sigma-Semirings
partial programs	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
Partial Stable Models	(ICLP 2022) A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
partial-order methods	(LICS 2022) Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
partition	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
Passive Learning	(CP 2022) Constraint Acquisition Based on Solution Counting
path induction	(LICS 2022) Syllepsis in Homotopy Type Theory
path orders	(IJCAR 2022) Term Ordering for Non-Reachability of (Conditional) Rewriting
path-aware Internet architectures	(CSF 2022) N-Tube: Formally Verified Secure Bandwidth Reservation in Path-Aware Internet Architectures
pathwidth	(LICS 2022) The Pebble-Relation Comonad in Finite Model Theory
Patient Transportation	(CP 2022) Sequence Variables for Routing Problems
PBPO+	(TERMGRAPH 2022) A PBPO+ Graph Rewriting Tutorial
PDF.js	(Isabelle 2022) Isabelle/VSCode and Electron/Node.js as emerging Isabelle technologies
Peano arithmetic	(FSCD 2022) An Analysis of Tennenbaum's Theorem in Constructive Type Theory (TLLA-LINEARITY-2022)
pebble-relation	(LICS 2022) The Pebble-Relation Comonad in Finite Model Theory
Perception & Reasoning	(KR 2022) Embed2Sym - Scalable Neuro-Symbolic Reasoning via Clustered Embeddings
perfect matching	(PC 2022) Proof complexity of natural formulas via communication arguments
performance	(Coq2022) 10 Years of Superlinear Slowness in Coq
performance prediction	(PAAR 2022) The Isabelle Community Benchmark
Permitted Announcements	(KR 2022) Dynamic Deontic Logic for Permitted Announcements
permutation equivalence	(TERMGRAPH 2022) Greedily Decomposing Proof Terms for String Rewriting into Multistep Derivations by Topological Multisorting
Perspectives	(KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (DL 2022) Modelling Multiple Perspectives by Standpoint-Enhanced DLs
petri nets	(CAV 2022) Synthesis and Analysis of Petri Nets from Causal Specifications (CAV 2022) Verifying generalised and structural soundness of workflow nets via relaxations (LICS 2022) Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes (LICS 2022) The complexity of soundness in workflow nets
phase distinction	(FSCD 2022) Sheaf semantics of termination-insensitive noninterference
Physical observable	(LICS 2022) Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
pi-forall	(WPTE 2022) Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
Pigeonhole Principle	(IJCAR 2022) Synthetic tableaux: minimal tableau search heuristics (LICS 2022) On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems
Plan execution monitoring	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract)
planning	(IJCAR 2022) Actions over Core-closed Knowledge Bases (DL 2022) Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract) (CP 2022) Plotting: A Planning Problem With Complex Transitions (CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling (XLoKR 2022) Explaining Soft-Goal Conflicts through Constraint Relaxations (WOLVERINE 2022)
Planning and Learning	(KR 2022) Online Grounding of Symbolic Planning Domains in Unknown Environments
Planning under uncertainty	(KR 2022) Hybrid Conditional Planning for Robotic Applications (Extended Abstract) (VeriProp 2022) Safe Sampling-Based Planning for Stochastic Systems with Uncertain Dynamics
Plausibility	(MC-2022) Cognitive Reasoning in ASP
playground	(GDE 2022) s(CASP) Playground based on Ciao Prolog
plugin	(Coq2022) Trakt: a generic pre-processing tactic for theory-based proof automation
polarity	(TLLA-LINEARITY-2022)
polymorphism	(CP 2022) On Redundancy in Constraint Satisfaction Problems (LICS 2022) A direct computational interpretation of second-order arithmetic via update recursion (LICS 2022) Smooth approximations and CSPs over finitely bounded homogeneous structures
polynomial approximation	(ITP 2022) Dandelion: Certified Approximations of Elementary Functions
polynomial calculus	(PC 2022) On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
polynomial closure	(LICS 2022) The amazing mixed polynomial closure and its applications to two-variable first-order logic
Polynomial functors	(FSCD 2022) A combinatorial approach to higher-order structure for polynomial functors
Polynomial Identity Testing	(LICS 2022) Identity testing for radical expressions
Polynomial Termination	(FSCD 2022) Polynomial Termination over N is Undecidable (WST22) DEPP
polynomial time hierarchy	(ICLP 2022) Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo
polynomial zonotopes	(CAV 2022) Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
Portfolio	(CP 2022) A Portfolio-Based Approach to Select Efficient Variable Ordering Heuristics for Constraint Satisfaction Problems
porting	(ICLP 2022) Making ProB compatible with SICStus and SWI-Prolog
POS tagging	(ModRef2022) Constraint-based Part-of-Speech Tagging
positionality	(LICS 2022) Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
Positive Almost Sure Termination	(VeriProp 2022) Inferring Expected Runtimes and Sizes
positivity	(LICS 2022) Computing the Density of the Positivity Set for Linear Recurrence Sequences
postulate-based reasoning	(KR 2022) Do Humans Find Postulates of Belief Change Plausible?
practical implementations	(MC-2022) Heuristic computation of exact treewidth - some improvements and more experimental evaluations
Practical Problem Solving	(PCCR2022) Parameterized Algorithmics and Counting: Treewidth in Practice
PRAM	(PDAR 2022) A Linear Parallel Algorithm to Compute Strong and Branching Bisimilarity
pre-processing	(Coq2022) Trakt: a generic pre-processing tactic for theory-based proof automation
Predicate Abstraction	(CAV 2022) Software Verification of Hyperproperties beyond k-safety
preference based models	(NMR 2022) On some weakenings of transitivity in the logic of norms (extended abstract)
preferences	(IJCAR 2022) Sequent Calculi for Choice Logics (KR 2022) An Axiomatic Approach to Revising Preferences (Extended Abstract) (KR 2022) Computing Stable Argumentative Conclusions under the Weakest-Link Principle in the ASPIC+ Framework (NMR 2022) The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View
Preferential semantics	(ICLP 2022) An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge bases
prefix unification	(ARQNL 2022) Advancing Automated Theorem Proving for the Modal Logics D and S5
Premise Selection	(ITP 2022) The Isabelle ENIGMA
preprocessing	(IJCAR 2022) Clause Redundancy and Preprocessing in Maximum Satisfiability (IJCAR 2022) Preprocessing of Propagation Redundant Clauses (PAAR 2022) Reuse of Introduced Symbols in Automatic Theorem Provers (CSF 2022) Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing
Presburger	(LICS 2022) Reasoning on Data Words over Numeric Domains
Presburger arithmetic	(LICS 2022) Geometric decision procedures and the VC dimension of linear arithmetic theories
presentation	(FOMEO'22) Tableaunoir: an online blackboard for teaching formal methods and making slides
presentations	(SAT 2022) awards / competitions event
Preservation theorem	(LICS 2022) When Locality Meets Preservation
preserving primitivity	(IJCAR 2022) Binary codes that do not preserve primitivity
Presheaf Models of Type Theory	(LICS 2022) Greatest HITs: Higher inductive types in coinductive definitions via induction under clocks
Priest's Logic of Paradox	(KR 2022) On Paraconsistent Belief Revision in LP (Extended Abstract)
Prime Implicants	(SAT 2022) A generalization of the Satisfiability Coding Lemma and its applications
prime implicates	(IJCAR 2022) Connection-minimal Abduction in EL via translation to FOL (DL 2022) Connection-minimal Abduction in EL via translation to FOL (Extended Abstract)
primitive words	(Isabelle 2022) Auxiliary tools for Combinatorics on Words
Principle-based Analysis	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach (KR 2022) Rediscovering Argumentation Principles Utilizing Collective Attacks
prioritized knowledge bases	(KR 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (DL 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract)
privacy	(CSF 2022) How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis (CSF 2022) Machine-Checked Proofs of Privacy Against Malicious Boards for Selene & Co (CSF 2022) Membership Inference Attacks against Classifiers
Privacy Policy	(KR 2022) Dynamic Deontic Logic for Permitted Announcements
privacy-utility trade-off	(CSF 2022) Universal Optimality and Robust Utility Bounds for Metric Differential Privacy
Private strategies	(KR 2022) Private and public affairs in strategic reasoning
ProB	(ICLP 2022) Making ProB compatible with SICStus and SWI-Prolog
Probabilistic	(ASPOCP 2022)
probabilistic (affine additive) higher-order recursion schemes	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
Probabilistic Argumentation	(KR 2022) Abstract Argumentation with Markov Networks (Extended Abstract)
probabilistic automata	(VeriProp 2022) Probabilistic Guarded Kleene Algebra with Tests
Probabilistic Circuits	(KR 2022) Sum-Product Loop Programming: From Probabilistic Circuits to Loop Programming
Probabilistic Graphical Models	(KR 2022) Abstract Argumentation with Markov Networks (Extended Abstract)
probabilistic inference	(MC-2022) Stochastic Constraint Optimisation with Applications in Network Analysis
Probabilistic Integer Programs	(VeriProp 2022) Inferring Expected Runtimes and Sizes
probabilistic lambda-calculus	(FSCD 2022) Strategies for Asymptotic Normalization
Probabilistic Logic Programming	(KR 2022) A Credal Least Undefined Stable Semantics for Probabilistic Logic Programs and Probabilistic Argumentation (ICLP 2022) Efficient Knowledge Compilation Beyond Weighted Model Counting (ICLP 2022) Inference and Learning with Model Uncertainty in Probabilistic Logic Programs (ICLP 2022) Abduction in Probabilistic Logic Programs (ICLP 2022) Exploiting Parameters Learning for Hyper-parameters Optimization in Deep Neural Networks
Probabilistic model checking	(VeriProp 2022) Safe Sampling-Based Planning for Stochastic Systems with Uncertain Dynamics (CAV 2022) Abstraction-Refinement for Hierarchical Probabilistic Models (CAV 2022) Sampling-Based Verification of CTMCs with Uncertain Rates (CSF 2022) Adversarial Robustness Verification and Attack Synthesis in Stochastic Systems
probabilistic process equivalences	(CSF 2022) Symbolic protocol verification with dice: process equivalences in the presence of probabilities
probabilistic programming	(KR 2022) Sum-Product Loop Programming: From Probabilistic Circuits to Loop Programming (KR 2022) Optimisation Methods for Complex Event Recognition (VeriProp 2022) Deterministic stream-sampling for probabilistic programming: semantics and verification (CAV 2022) Automated Expected Amortised Cost Analysis of Probabilistic Data Structures (WPTE 2022) Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language (LICS 2022) Curry and Howard Meet Borel (LICS 2022) Probability monads with submonads of deterministic states
Probabilistic programs	(VeriProp 2022) A Quantitative Verification Infrastructure (VeriProp 2022) Verifying Probabilistic Programs using Generating Functions (CAV 2022) Data-Driven Invariant Learning for Probabilistic Programs (CAV 2022) Abstraction-Refinement for Hierarchical Probabilistic Models (CAV 2022) Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions (CAV 2022) Sound and Complete Certificates for Quantitative Termination Analysis of Probabilistic Programs (XLoKR 2022) Using Abstraction for Interpretable Robot Programs in Stochastic Domains (CSF 2022) The Complexity of Verifying Boolean Programs as Differentially Private (WST22) AProVE 2022
Probabilistic reasoning	(ASPOCP 2022) (ICLP 2022) What do you really want to do? Towards a Theory of Intentions for Human-Robot Collaboration
probabilistic rewriting	(FSCD 2022) Strategies for Asymptotic Normalization
probabilistic verification	(VeriProp 2022) Widest Paths and Global Propagation in Bounded Value Iteration for Stochastic Games
probability	(LICS 2022) Probability monads with submonads of deterministic states
probability distribution	(LICS 2022) Partitions and Ewens Distributions in element-free Probability Theory
probability distributions	(LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning
Probability logics	(KR 2022) Classical and Fuzzy Two-Layered Modal Logics for Uncertainty: Translations and Proof-Theory
Probability Theory	(ITP 2022) Formalization of a Stochastic Approximation Theorem
Procedure	(IJCAR 2022) Reasoning About Vectors using an SMT Theory of Sequences
process algebra	(LICS 2022) Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
process graphs	(LICS 2022) Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete
Process Mining	(DL 2022) Extraction of Object-Centric Event Logs through Virtual Knowledge Graphs
process modeling	(TERMGRAPH 2022) Formalization and analysis of BPMN using graph grammars
Product Configuration	(ASPOCP 2022)
Productivity	(WPTE 2022) Transforming Text to (and from) XML (LICS 2022) Bouncing threads for circular and non-wellfounded proofs
program analysis	(IWC 2022) On local confluence of conditional rewrite systems (iPRA 2022) Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification
program distance	(FSCD 2022) A Fibrational Tale of Operational Logical Relations
Program equivalence	(VeriProp 2022) Verifying Probabilistic Programs using Generating Functions (TLLA-LINEARITY-2022) (CAV 2022) Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions (WPTE 2022) Program Equivalence in a Typed Probabilistic Call-by-Need Functional Language
Program Synthesis	(SYNT 2022) Towards Synthesis in Superposition (SYNT 2022) Complexity of Relational Query Synthesis (SYNT 2022) Inferring Environment Assumptions in Model Refinement
program transformation	(WPTE 2022) On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms (WPTE 2022) On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting
Program Verification	(FSCD 2022) mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity (ICLP 2022) Verifying Catamorphism-Based Contracts using Constrained Horn Clauses (CAV 2022) Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes (WPTE 2022) On Transforming Imperative Programs into Logically Constrained Term Rewrite Systems via Injective Functions from Configurations to Terms (ITP 2022) Taming an Authoritative Armv8 ISA Specification: L3 Validation and CakeML Compiler Verification (WST22) A Calculus for Modular Non-Termination Proofs by Loop Acceleration (Coq2022) HenBlocks: Structured Editing for Coq (ASL 2022) Polishing a Rough Diamond: An Enhanced Separation Logic for Heap Space under Garbage Collection
programming	(FOMEO'22) Teaching Concurrency with pseuCo Book
Programming Errors	(ICLP 2022) A Preliminary Data-driven Analysis of Common Errors Encountered by Novice Answer Set Programmers
programming methodology	(ASPOCP 2022)
Progression	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing
project management	(CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling
Projected Model Counting	(MC-2022) Counting Complexity for Projected Reasoning in Abstract Argumentation
Projection	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing
projective geometry	(ITP 2022) Proof Pearl: Formalizing Spreads and Packings of the Smallest Projective Space PG(3,2) using the Coq Proof Assistant
Prolog	(GDE 2022) Embedding s(CASP) in Prolog (GDE 2022) Integration of Logical English and s(CASP) (ICLP 2022) Making ProB compatible with SICStus and SWI-Prolog
Promise Constraint Satisfaction Problem	(CP 2022) Fixed-Template Promise Model Checking Problems
Promise Valued Constraint Satisfaction Problem	(CP 2022) Weisfeiler-Leman Invariant Promise Valued CSPs
Proof	(CP 2022) From Crossing-Free Resolution to Max-SAT Resolution (SMT 2022) SMT Proof Standardization Update
proof assistant	(ThEdu'22) A Proof Tree Builder for Sequent Calculus and Hoare Logic (Coq2022) HenBlocks: Structured Editing for Coq
Proof assistants	(CAV 2022) Hemiola: A DSL and Verification Tools to Guide Design and Proof of Hierarchical Cache-Coherence Protocols (ITP 2022) Seventeen Provers under the Hammer (ITP 2022) (Invited) User Interface Design in the HolPy Theorem Prover
proof automation	(ITP 2022) (Invited) User Interface Design in the HolPy Theorem Prover (Coq2022) Trakt: a generic pre-processing tactic for theory-based proof automation
proof by reflection	(ITP 2022) Reflexive tactics for algebra, revisited
proof checking	(SAT 2022) Migrating Solver State (SMT 2022) Challenges and Solutions for Higher-Order SMT Proofs
proof complexity	(PC 2022) QCDCL with Cube Learning or Pure Literal Elimination – What is best? (PC 2022) Simulations between proof systems (PC 2022) Proof complexity of natural formulas via communication arguments (PC 2022) Average-Case Hardness of Proving Tautologies and Theorems (PC 2022) Proof complexity of CSP on algebras with linear congruence (PC 2022) Towards higher order proof complexity (PC 2022) TBA (PC 2022) On combinatorial principles coming from semi-algebraic proof systems (SAT 2022) QBF Merge Resolution is powerful but unnatural (SAT 2022) Should decisions in QCDCL follow prefix order? (SAT 2022) Relating existing powerful proof systems for QBF (SAT 2022) Tight Bounds for Tseitin Formulas (SAT 2022) Classes of Hard Formulas for QBF Resolution
proof compression	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
Proof Discovery	(ThEdu'22) Invited Talk: Computer-assisted proofs and automated methods in Mathematics Education
proof engine	(Coq2022) 10 Years of Superlinear Slowness in Coq
proof format	(SMT 2022) A simple proof format for SMT
proof logging	(CP 2022) An Auditable Constraint Programming Solver (CP 2022) Solving with Provably Correct Results: Beyond Satisfiability, and Towards Constraint Programming (SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
proof methodology	(CAV 2022) End-to-end Mechanised Proof of an eBPF Virtual Machine for Microcontrollers
Proof net	(TLLA-LINEARITY-2022)
proof nets	(FSCD 2022) Normalization without syntax (TERMGRAPH 2022) Ideograph: A Language for Expressing and Manipulating Structured Data (TERMGRAPH 2022) A Computational Interpretation of Girard’s Intuitionistic Proof-Nets (LICS 2022) Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
proof presentation	(DL 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies
proof representation	(XLoKR 2022) Finding Good Proofs for Answers to Conjunctive Queries Mediated by Lightweight Ontologies (Extended Abstract)
proof schemas	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
Proof search	(KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
proof structures	(PAAR 2022) Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving
proof techniques	(CSF 2022) SecurePtrs: Proving Secure Compilation Using Data-Flow Back-Translation and Turn-Taking Simulation
Proof theory	(FSCD 2022) Linear lambda-calculus is linear (FSCD 2022) A Graphical Proof Theory of Logical Time (FSCD 2022) A Methodology for Designing Proof Search Calculi for Non-Classical Logics (KR 2022) Automating Reasoning with Standpoint Logic via Nested Sequents (TLLA-LINEARITY-2022) (TLLA-LINEARITY-2022) (DECFOML2022) Terminating sequent calculi for decidable fragments of FOML (DL 2022) Uniform and Modular Sequent Systems for Description Logics (iPRA 2022) First-Order Interpolation Derived from Propositional Interpolation
proof tree	(ThEdu'22) A Proof Tree Builder for Sequent Calculus and Hoare Logic
proof-as-program	(LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability
proof-search	(IJCAR 2022) SAT-based Proof Search in Intermediate Propositional Logics
Proof-search heuristics	(IJCAR 2022) Synthetic tableaux: minimal tableau search heuristics
Proofs	(IJCAR 2022) Evonne: Interactive Proof Visualization for Description Logics (System Description) (IJCAR 2022) Flexible Proof Production in an Industrial-Strength SMT Solver (DL 2022) On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne (PAAR 2022) EuroProofNet presentation on SMT and proofs (PAAR 2022) EuroProofNet presentation on proofs in Dedukti (XLoKR 2022) Explaining Description Logic Entailments in Practice with Evee and Evonne (SMT 2022) A simple proof format for SMT (SMT 2022) Challenges and Solutions for Higher-Order SMT Proofs
propagation	(CP 2022) Heuristics for MDD Propagation in Haddock
propagation redundancy	(IJCAR 2022) Clause Redundancy and Preprocessing in Maximum Satisfiability
propagation redundant proof	(IJCAR 2022) Preprocessing of Propagation Redundant Clauses
propagation strength	(CP 2022) CNF Encodings of Binary Constraint Trees
Properties of Argumentation Semantics	(KR 2022) Defining Defense and Defeat in Abstract Argumentation From Scratch -- A Generalizing Approach
property directed reachability analysis	(CAV 2022) The Lattice-Theoretic Essence of Property Directed Reachability Analysis
Prophecy Variables	(CSF 2022) Prophecy Variables for Hyperproperty Verification
Proportional Representation	(KR 2022) Simulating Multiwinner Voting Rules in Judgment Aggregation
Propositional Dynamic Logic	(IJCAR 2022) Cyclic Proofs, Hypersequents, and Transitive Closure Logic
propositional intermediate logics	(IJCAR 2022) SAT-based Proof Search in Intermediate Propositional Logics
propositional logic	(IJCAR 2022) Semantic Relevance
Propositional planning	(CP 2022) Isomorphisms between STRIPS problems and sub-problems
propositional proof complexity	(PC 2022) An observation about (a)symmetries in LK_d proofs
propositional proof systems	(PC 2022) Simulations between proof systems
Propositional satisfiability	(KR 2022) Computational Aspects of Structured Argumentation (DL 2022) SAT-Based Axiom Pinpointing Revisited (SAT 2022) A Comprehensive Study of k-Portfolios of Recent SAT Solvers
propositional translations	(PC 2022) An observation about (a)symmetries in LK_d proofs
Protege	(XLoKR 2022) Explaining Description Logic Entailments in Practice with Evee and Evonne
protocol analysis	(CSF 2022) Adversary Safety by Construction in a Language of Cryptographic Protocols
Protocol security	(CSF 2022) Privacy as Reachability
protocols	(CSF 2022) Unlinkability of an Improved Key Agreement Protocol for EMV 2nd Gen Payments (CSF 2022) So near and yet so far: formal verification of distance bounding protocols
Protégé Plugin	(DL 2022) On the Eve of True Explainability for OWL Ontologies: Description Logic Proofs with Evee and Evonne
Provenance	(XLoKR 2022) Modular Provenance in Multi-Context Systems
provenance semantics	(KR 2022) Revisiting Semiring Provenance for Datalog
Prover	(ITP 2022) Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL
Prover IDE	(Isabelle 2022) Isabelle/VSCode and Electron/Node.js as emerging Isabelle technologies (Isabelle 2022) Towards Accessible Formal Mathematics with ISAC and Isabelle/VSCode
pseudo-Boolean constraints	(CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
Pseudo-Boolean optimization	(SAT 2022) Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
pseudo-Boolean reasoning	(SAT 2022) Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization
pseudo-Boolean solving	(SAT 2022) Certified CNF Translations for Pseudo-Boolean Solving
Pseudo-contraction	(NMR 2022) Repairing Ontologies via Kernel Pseudo-Contraction (DL 2022) Repairing Ontologies via Kernel Pseudo-Contraction
pseudo-industrial random SAT	(SAT 2022) On the performance of deep generative models of realistic SAT instances
Psychology	(MC-2022) Cognitive Reasoning in ASP
PSyKE	(KR 2022) Symbolic Knowledge Extraction from Opaque Machine Learning Predictors: GridREx & PEDRO
Public Announcement Logic	(KR 2022) Dynamic Deontic Logic for Permitted Announcements
Pure Type Systems	(FSCD 2022) Adequate and computational encodings in the logical framework Dedukti
pushdown	(LICS 2022) The complexity of bidirected reachability in valence systems
PVS	(FSCD 2022) A Certified Algorithm for AC-Unification
python	(PAAR 2022) Optimal Strategy Schedules for Everyone (FOMEO'22) DOMtutor -- Competitive Programming as Teaching Tool
Q
Q-resolution	(SAT 2022) Quantified CDCL with Universal Resolution
QBF	(PC 2022) QCDCL with Cube Learning or Pure Literal Elimination – What is best? (PAAR 2022) QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers (SAT 2022) Quantified CDCL with Universal Resolution (SAT 2022) QBF Merge Resolution is powerful but unnatural (SAT 2022) Should decisions in QCDCL follow prefix order? (SAT 2022) Relating existing powerful proof systems for QBF (SAT 2022) Classes of Hard Formulas for QBF Resolution
QBF Programming	(SAT 2022) QBF Programming with the Modeling Language Bule
QBF proof complexity	(SAT 2022) Changing Partitions in Rectangle Decision Lists
QCDCL	(SAT 2022) Should decisions in QCDCL follow prefix order?
QU-resolution	(SAT 2022) Quantified CDCL with Universal Resolution
Qualitative Spatial Reasoning	(KR 2022) Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Quantified Boolean Formula	(QBF2022)
Quantified Information Flow	(CAV 2022) A Scalable Shannon Entropy Estimator
Quantified Integer Programming	(QBF2022)
Quantified logics	(ICLP 2022) Solving Problems in PH with ASP(Q)
Quantified modal logics	(ARQNL 2022) Solving QMLTP Problems by Translation to Higher-order Logic
Quantified Optimization	(QBF2022)
quantified reflection calculus	(DECFOML2022) The Quantified Reflection Calculus as a Modal Logic
quantifier alternation	(LICS 2022) The amazing mixed polynomial closure and its applications to two-variable first-order logic
quantifier elimination	(SAT 2022) Quantifier Elimination in Stochastic Boolean Satisfiability (ARQNL 2022) (Re)moving Quantifiers to Simplify Parameterised Boolean Equation Systems
quantifiers	(SAT 2022) Towards Learning Quantifier Instantiation in SMT
quantitative algebra	(LICS 2022) Varieties of quantitative algebras and their monads
quantitative algebras	(FSCD 2022) On Quantitative Algebraic Higher-Order Theories
quantitative reasoning	(MC-2022) Cognitive Reasoning in ASP (LICS 2022) Beyond Nonexpansive Operations in Quantitative Algebraic Reasoning (LICS 2022) Logical Foundations of Quantitative Equality
Quantitative Synthesis	(CAV 2022) Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
Quantitative theories	(IJCAR 2022) A framework for approximate generalization in quantitative theories (ONLINE)
Quantitative types	(FSCD 2022) Solvability for Generalized Applications
Quantitative verification	(VeriProp 2022) Verifying Probabilistic Programs using Generating Functions (CAV 2022) Does a Program Yield the Right Distribution? Verifying Probabilistic Programs via Generating Functions
quantitative/qualitative verification of omega-regular properties	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
Quantum Computation	(FSCD 2022) Addition and differentiation of ZX-diagrams
Quantum computing	(FSCD 2022) Linear lambda-calculus is linear (TLLA-LINEARITY-2022) (SAT 2022) Towards a SAT Encoding for Quantum Circuits (Coq2022) QuantumLib: A Library for Quantum Computing in Coq
Quantum Decision Model	(CAV 2022) Verifying Fairness in Quantum Machine Learning
quantum information	(CSF 2022) Beware of Greeks bearing entanglement? Quantum covert channels, information flow and non-local games
Quantum Machine Learning	(CAV 2022) Verifying Fairness in Quantum Machine Learning
Quantum Noise	(CAV 2022) Verifying Fairness in Quantum Machine Learning
Quantum programming	(LICS 2022) Quantum Expectation Transformers for Cost Analysis (LICS 2022) Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Quantum random walk	(LICS 2022) Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Quantum weakest precondition	(LICS 2022) Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Quasicategories	(HoTT/UF 2022)
Queries	(DL 2022) Computing Concept Referring Expressions with Standard OWL Reasoners
query answering	(REAI 2022) (REAI 2022)
Query Checking	(ICLP 2022) ASP-Based Declarative Process Mining
query model	(ITP 2022) Formalizing Algorithmic Bounds in the Query Model in EasyCrypt
query optimization	(DL 2022)
Query rewriting	(KR 2022) Data Quality in Ontology-Based Data Access (ICLP 2022) Efficient Datalog Rewriting for Query Answering in TGD Ontologies
query-by-example	(DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps
Quillen equivalence	(HoTT/UF 2022)
Quotient model	(HoTT/UF 2022)
R
R1CS	(CAV 2022) Distilling Constraints in Zero-Knowledge Protocols
Rabin automata	(CAV 2022) Divide-and-Conquer Determinization of Büchi Automata based on SCC Decomposition
Ramsey quantifier	(LICS 2022) Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Random Descent	(IWC 2022) Uniform Completeness
random Fourier features	(CAV 2022) Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement
random interpretations	(LICS 2022) Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics
random model	(MC-2022) Generating Random Weighted Model Counting Instances: An Empirical Analysis with Varying Primal Treewidth
random numbers	(ITP 2022) Synthetic Kolmogorov Complexity in Coq
Random quantities	(KR 2022) Compound conditionals as random quantities and Boolean algebras
Randomised Algorithms	(LICS 2022) Identity testing for radical expressions
randomization	(IJCAR 2022) Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description)
Randomized Algorithms	(ITP 2022) Formalization of Randomized Approximation Algorithms for Frequency Moments
randomized communication complexity	(PC 2022) Proof complexity of natural formulas via communication arguments
randomized computation	(LICS 2022) Curry and Howard Meet Borel
Randomized Planning	(CAV 2022) Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation
rank-width	(PCCR2022) Learning Small Decision Trees (PCCR2022)
ranking	(KR 2022) Negative Statements Considered Useful (Extended Abstract)
Ranking Functions	(WST22) Improved Automatic Complexity Analysis of Integer Programs (WST22) Automatic Complexity Analysis of (Probabilistic) Integer Programs via KoAT
rational closure	(KR 2022) Inference with System W Satisfies Syntax Splitting (NMR 2022) Defeasible reasoning in RDFS (DL 2022) Defeasible reasoning in RDFS
RDFS	(NMR 2022) Defeasible reasoning in RDFS (DL 2022) Defeasible reasoning in RDFS
reachability	(IJCAR 2022) Term Ordering for Non-Reachability of (Conditional) Rewriting (NSV 2022) TBD (LICS 2022) Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods
Reachability analysis	(CAV 2022) Reachability of Koopman Linearized Systems Using Random Fourier Feature Observables and Polynomial Zonotope Refinement (CAV 2022) RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems
reachability problem	(LICS 2022) Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes (LICS 2022) The complexity of bidirected reachability in valence systems
Reactive synthesis	(SYNT 2022) A Framework for Transforming Specifications in Reinforcement Learning (SYNT 2022) Inferring Environment Assumptions in Model Refinement
reactive systems	(SYNT 2022) Reactive Synthesis of LTL specifications with Rich Theories
Realistic SAT generators	(SAT 2022) On the performance of deep generative models of realistic SAT instances
Realizability	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities (LICS 2022) A direct computational interpretation of second-order arithmetic via update recursion (LICS 2022) A first-order completeness result about characteristic Boolean algebras in classical realizability (SYNT 2022) Reactive Synthesis of LTL specifications with Rich Theories (HoTT/UF 2022)
Realizability Checking	(CAV 2022) Capture, Analyze, Diagnose: Realizability Checking of Requirements in FRET
Reasoning	(KR 2022) A Conditional Perspective for Reasoning, Revision and Relevance (DL 2022) Concept Abduction for Description Logics (DL 2022) Category-based Semantics for the Description Logic ALC and Reasoning
Reasoning about action	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing
Reasoning about action and change	(ICLP 2022) Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers
Reasoning About Actions	(KR 2022) Act for Your Duties but Maintain Your Rights (KR 2022) Automatic Synthesis of Dynamic Norms for Multi-Agent Systems (DL 2022) Reasoning about actions with EL ontologies in a temporal action theory (Extended Abstract)
Reasoning about Terminological Knowledge	(KR 2022) Region-Based Merging of Open-Domain Terminological Knowledge (KR 2022) On Merging of Open-Domain Ontologies
rectangle decision lists	(SAT 2022) Changing Partitions in Rectangle Decision Lists
rectification	(NMR 2022) Rectifying Classifiers (DL 2022) Rectifying Classifiers
recurrent reachability	(LICS 2022) Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification
Recursion	(LICS 2022) Concrete categories and higher-order recursion (with applications including probability, differentiability, and full abstraction)
Recursive path ordering	(WST22) A transitive HORPO for curried systems
Reduction Measure	(IWC 2022) Uniform Completeness
Reduction strategies	(ITP 2022) The Zoo of Lambda-Calculus Reduction Strategies, and Coq
reduction-based systems	(IWC 2022) On local confluence of conditional rewrite systems
reductions	(CAV 2022) Even Faster Conflicts and Lazier Reductions for String Solvers (FOMEO'22) Towards Graphical Feedback in the DiMo Learning Tool
redundancy	(CP 2022) On Redundancy in Constraint Satisfaction Problems
Redundancy Elimination	(IJCAR 2022) An Efficient Subsumption Test Pipeline for BS(LRA) Clauses
Reed-Solomon coding	(CAV 2022) Verified Erasure Correction in Coq with MathComp and VST
Reedy category	(HoTT/UF 2022)
refactoring	(WPTE 2022) Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
Refactoring steps	(WPTE 2022) Refactoring Steps for P4 (work in progress)
refactoring tools	(WPTE 2022) Towards a Refactoring Tool for Dependently-Typed Programs (work in progress)
References	(FSCD 2022) Constructing Unprejudiced Extensional Type Theories with Choices via Modalities
referring expressions	(DL 2022) Accessing Document Data Sources using Referring Expression Types (REAI 2022) (REAI 2022)
Refinement	(Isabelle 2022) A Verified Implementation of B-trees in Isabelle/HOL (ITP 2022) Refinement of Parallel Algorithms down to LLVM (CSF 2022) Mapping Synthesis for Hyperproperties (PDAR 2022) Refinement of Parallel Algorithms down to LLVM
Refutation calculus	(IJCAR 2022) Sequent Calculi for Choice Logics
Region Connection Calculus	(KR 2022) Region-Based Merging of Open-Domain Terminological Knowledge
Regression	(KR 2022) Projection of Belief in the Presence of Nondeterministic Actions and Fallible Sensing
Regular expressions	(FSCD 2022) On Lookaheads in Regular Expressions with Backreferences (LICS 2022) Efficient Construction of Reversible Transducers from Regular Transducer Expressions (LICS 2022) Milner's Proof System for Regular Expressions Modulo Bisimilarity is Complete (SYNT 2022) Regex+: Synthesizing Regular Expressions from Positive Examples
regular languages	(LICS 2022) The amazing mixed polynomial closure and its applications to two-variable first-order logic
Regular path queries	(KR 2022) Finite Entailment of UCRPQs over ALC Ontologies
Regular Theories	(FSCD 2022) Combined Hierarchical Matching: The Regular Case
Reimplication	(SAT 2022) Introducing Intel(R) SAT Solver
reinforcement learning	(GDE 2022) A Hybrid Neuro-Symbolic Approach for Text-Based Games using Inductive Logic Programming (CP 2022) Combining Reinforcement Learning and Constraint Programming for Sequence-Generation Tasks with Hard Constraints (CP 2022) Building a Constraint Programming Solver Guided by Machine Learning: Opportunities and Challenges (CAV 2022) PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP (CAV 2022) Specification-Guided Learning of Nash Equilibria with High Social Welfare (CAV 2022) MoGym: Using Formal Models for Training and Verifying Decision-making Agents (NSV 2022) TBD (ITP 2022) Mechanizing Soundness of Off-Policy Evaluation (WOLVERINE 2022) (WOLVERINE 2022) (SYNT 2022) A Framework for Transforming Specifications in Reinforcement Learning
relation extraction	(KR 2022) Open Relation Extraction With Non-existent and Multi-span Relationships
relation-based explanations	(XLoKR 2022) Should counterfactual explanations always be data instances?
Relational Queries	(SYNT 2022) Complexity of Relational Query Synthesis
relaxation	(CP 2022) Computing relaxations for the three-dimensional stable matching problem with cyclic preferences
relaxations	(XLoKR 2022) Explaining Soft-Goal Conflicts through Constraint Relaxations
Relaxed Memory Models	(SYNT 2022) Interactive Debugging of Concurrent Programs under Relaxed Memory Models
Relay-based Railway Interlocking Systems	(SMT 2022) NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems
release engineering	(Coq2022) Discussion with Coq Core Development Team
relevance	(IJCAR 2022) Semantic Relevance (KR 2022) Kernel Contraction and the Order of Relevance (KR 2022) Relevance in Reasoning with and Revision of Conditional Beliefs (KR 2022) A Conditional Perspective for Reasoning, Revision and Relevance
Remez algorithm	(ITP 2022) Dandelion: Certified Approximations of Elementary Functions
replay attacks	(CSF 2022) How Efficient are Replay Attacks against Vote Privacy? A Formal Quantitative Analysis
replication	(CSF 2022) Applying consensus and replication securely with FLAQR
Requirements Analysis	(CAV 2022) Capture, Analyze, Diagnose: Realizability Checking of Requirements in FRET
research-based teaching	(FOMEO'22) Experiences on Online Teaching of Formal Methods to Systems Engineering Students
resolution	(ICLP 2022) From Logic to Functional Logic Programs (SAT 2022) QBF Merge Resolution is powerful but unnatural (SAT 2022) Should decisions in QCDCL follow prefix order? (SAT 2022) Tight Bounds for Tseitin Formulas (SAT 2022) Classes of Hard Formulas for QBF Resolution (SMT 2022) A simple proof format for SMT
resolution complexity	(PC 2022) Are Hitting Formulas Hard for Resolution?
Resolution over linear equations	(PC 2022) Proof complexity of natural formulas via communication arguments
resource approximation	(LICS 2022) Resource approximation for the lambda-mu-calculus
Resource Description Framework with Schema (RDFS)	(KR 2022) A Minimal Deductive System for RDFS with Negative Statements
Resource Semantics	(ASL 2022) Labelled Tableaux for Linear Time Bunched Implication Logic
resource-constrained project scheduling problem	(CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling
restricted probabilistic tree stack automata	(LICS 2022) Probabilistic Verification Beyond Context-Freeness
Restricted Universal Variables	(QBF2022)
restrictions	(SAT 2022) QBF Merge Resolution is powerful but unnatural
Results	(SYNT 2022) SYNTCOMP Results (SYNT 2022) SyGuS-IF + SemGuS Results
reversal of list	(Isabelle 2022) Transfer and reversal of lists
reverse engineering	(CAV 2022) Abstraction Modulo Stability for Reverse Engineering
Reverse engineering of queries	(DL 2022) Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps
reversible	(LICS 2022) The complexity of bidirected reachability in valence systems
Revision	(KR 2022) A Conditional Perspective for Reasoning, Revision and Relevance
revision postulates	(NMR 2022) Asking human reasoners to judge postulates of belief change for plausibility
rewriting	(FSCD 2022) Adequate and computational encodings in the logical framework Dedukti (FSCD 2022) Encoding type universes without using matching modulo associativity and commutativity (FSCD 2022) Rewriting for monoidal closed categories (IFIP-WG1.6) RLooP
rewriting engines	(ITP 2022) Accelerating Verified-Compiler Development with a Verified Rewriting Engine
rewriting induction	(WPTE 2022) On Transforming Rewriting-Induction Proofs for Logical-Connective-Free Sequents into Cyclic Proofs (WPTE 2022) Extending a Lemma Generation Approach for Rewriting Induction on Logically Constrained Term Rewriting Systems
rewriting logic	(IJCAR 2022) Equational Unification and Matching, and Symbolic Reachability Analysis in Maude 3.2 (System Description)
Right barren	(WST22) Approximating Relative RFC-Match-Bounds
Robotics	(NMR 2022) There and Back Again: Combining Nonmonotonic Logical Reasoning and Deep Learning on an Assistive Robot
Robots	(NSV 2022) TBD
robust safety	(CSF 2022) Proving full-system security properties under multiple attacker models on capability machines
Robust solutions	(CP 2022) Large Neighborhood Search for Robust Solutions for Constraint Satisfaction Problems with Ordered Domains
Robustness	(CAV 2022) RINO: Robust INner and Outer Approximated Reachability of Neural Networks Controlled Systems (CAV 2022) Neural Network Robustness as a Verification Property: A Principled Case Study (WOLVERINE 2022)
Robustness degree	(CAV 2022) STLmc: Robust STL Model Checking of Hybrid Systems using SMT
Robustness Verification	(CAV 2022) Example Guided Synthesis of Linear Approximations for Neural Network Verification
roots of unity	(PC 2022) On vanishing sums of roots of unity in polynomial calculus and sum-of-squares
Rota's basis conjecture	(SAT 2022) A SAT Attack on Rota's Basis Conjecture
Rotations	(ITP 2022) A Complete, Mechanically-Verified Proof of the Banach-Tarski Theorem in ACL2(r)
Roth's Theorem	(ITP 2022) Formalizing Szemerédi's Regularity Lemma in Lean
Rule Based	(XLoKR 2022) Dialogue-Based Explanations of Reasoning in Rule-based Systems
Rule based temporal action logic	(DL 2022) Reasoning about actions with EL ontologies in a temporal action theory (Extended Abstract)
Rule Based Theorem Provers	(ThEdu'22) Rule Based Geometry Automated Theorem Provers
rule extraction	(DL 2022) Rule-Based Explanations using Knowledge Graphs
rule formats	(FSCD 2022) Stateful Structural Operational Semantics
rule learning	(KR 2022) Learning Typed Rules over Knowledge Graphs (KR 2022) Faithful Approaches to Rule Learning
Rule Mining	(KR 2022) Rule Learning over Knowledge Graphs with Genetic Logic Programming
rule-based reasoning	(DL 2022) Advanced languages of terms for ontologies
Rules as Code	(GDE 2022) Blawx: Web-based user-friendly Rules as Code
run-time performance	(PAAR 2022) The Isabelle Community Benchmark
runtime checking	(CSF 2022) DPL: A Language for GDPR Enforcement
Runtime Monitoring	(NSV 2022) TBA
runtime prediction	(SAT 2022) A Comprehensive Study of k-Portfolios of Recent SAT Solvers
runtime-error verification	(WPTE 2022) On Reducing Non-Occurrence of Specified Runtime Errors to All-Path Reachability Problems of Constrained Rewriting
S
s(CASP)	(GDE 2022) Embedding s(CASP) in Prolog (GDE 2022) Blawx: Web-based user-friendly Rules as Code (GDE 2022) Tutorial: Automating Commonsense reasoning with ASP and s(CASP)
Safe Autonomy	(NSV 2022) TBD
Safe Intelligent Control	(NSV 2022) TBA
Safe recursion	(LICS 2022) Cyclic Implicit Complexity
safety	(ASPOCP 2022) (WOLVERINE 2022) (LICS 2022) Deciding Hyperproperties Combined with Functional Specifications
sample complexity	(CP 2022) Improved Learning Bounds for Branch-and-Cut
sampling	(VeriProp 2022) Deterministic stream-sampling for probabilistic programming: semantics and verification
SAT	(PAAR 2022) QuAPI: Adding Assumptions to Non-Assuming SAT & QBF Solvers (iPRA 2022) Interpolation and SAT-Based Model Checking Revisited: Adoption to Software Verification (SAT 2022) Weighted Model Counting with Twin-Width (SAT 2022) Introducing Intel(R) SAT Solver (SAT 2022) (25 years of SAT)
SAT encodings	(PC 2022) Are Hitting Formulas Hard for Resolution? (CP 2022) Selecting SAT Encodings for Pseudo-Boolean and Linear Integer Constraints
SAT modulo Symmetry (SMS)	(SAT 2022) A SAT Attack on Rota's Basis Conjecture
SAT preprocessing	(SAT 2022) SAT Preprocessors and Symmetry
SAT Sampling	(CP 2022) On Quantitative Testing of Samplers
SAT solver	(CP 2022) Isomorphisms between STRIPS problems and sub-problems (SAT 2022) The packing chromatic number of the infinite square grid is at least 14
SAT solvers	(CP 2022) On Quantitative Testing of Samplers (MC-2022) Designing Samplers is Easy: The Boon of Testers
SAT solving	(IJCAR 2022) Preprocessing of Propagation Redundant Clauses (iPRA 2022) Interpolants and Interference (SAT 2022) Towards a SAT Encoding for Quantum Circuits (SAT 2022) Migrating Solver State (PDAR 2022) Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving (PDAR 2022) Dealing With Uncertainty Between Peers and Having the Best of Times With Distributed Systems
SAT-based algorithms	(KR 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (DL 2022) Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments (Extended Abstract)
SAT-solving	(FOMEO'22) Towards Graphical Feedback in the DiMo Learning Tool
Satisfiability	(IJCAR 2022) Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems (CP 2022) From Crossing-Free Resolution to Max-SAT Resolution (CP 2022) From Cliques to Colorings and Back Again (SAT 2022) OptiLog v2: Model, Solve, Tune And Run (LICS 2022) Deciding Hyperproperties Combined with Functional Specifications (LICS 2022) On the Satisfiability of Context-free String Constraints with Subword Ordering (LMML 2022) MCP: Capturing Big Data by Satisfiability
Satisfiability Coding Lemma	(SAT 2022) A generalization of the Satisfiability Coding Lemma and its applications
Satisfiability Modulo Theories	(IJCAR 2022) Cooperating Techniques for Solving nonlinear arithmetic in the cvc5 SMT solver (System Description) (ThEdu'22) Invited Talk: Satisfiability Modulo Theories in an Undergraduate Class (CAV 2022) Even Faster Conflicts and Lazier Reductions for String Solvers (CAV 2022) SolCMC: Solidity Compiler’s Model Checker (SMT 2022) On Satisfiability of Polynomial Equations over Large Prime Fields (SMT 2022) cvc5: A Versatile and Industrial-Strength SMT Solver
Satisfiability Modulo Theory	(CAV 2022) SMT-based Translation Validation for Machine Learning Compiler
satisfiability solving	(KR 2022) Solving Lam's Problem via SAT and Isomorph-Free Exhaustive Generation
Saturation	(PAAR 2022) The Vampire Approach to Induction
saturation-based theorem proving	(IJCAR 2022) Vampire Getting Noisy: Will Random Bits Help Conquer Chaos? (System Description)
Scenario optimization	(CAV 2022) Sampling-Based Verification of CTMCs with Uncertain Rates
Scheduling	(ICLP 2022) Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP (CP 2022) A Constraint Programming Approach to Ship Refit Project Scheduling
SCL	(PAAR 2022) A Two-Watched Literal Scheme for First-Order Logic
search heuristic	(CP 2022) Building a Constraint Programming Solver Guided by Machine Learning: Opportunities and Challenges
Search space exploration