VSL 2014: VIENNA SUMMER OF LOGIC 2014

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

2
2-valued semantics for logic programs	(ICLP) Properties of Stable Model Semantics Extensions
3
3-Variable Property	(LCC) First-Order Logic of Order and Metric has the Three-Variable Property
A
Abduction	(ICLP) A Measure of Arbitrariness in Abductive Explanations (DL) TBox abduction in ALC using a DL tableau (DL) Complexity of Temporal Query Abduction in DL-Lite (NMR) Abduction in Argumentation: Dialogical Proof Procedures and Instantiation
abductive logic programming	(ICLP) Joint Tabling of Logic Program Abductions and Updates (iPRA) Application Patterns of Projection/Forgetting
Abductive Reasoning	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect (CAV) Optimal Guard Synthesis for Memory Safety
abnormal behavior detection	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
ABox	(DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
absoluteness	(INFINITY) Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
Absorption	(DL) Optimised Absorption for Expressive Description Logics
Abstract algebraic logic	(LATD) Definability of truth predicates in abstract algebraic logic (LATD) Generalizing the Leibniz and Suszko operators (LATD) Congruential deductive systems associated with equationally orderable varieties (LATD) On logics of varieties and logics of semilattices
abstract argumentation	(KR) On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses (KR) Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory (KR) Justified Beliefs by Justified Arguments (KR) Characteristics of Multiple Viewpoints in Abstract Argumentation (NMR) Compact Argumentation Frameworks (NMR) On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks (NMR) A Plausibility Semantics for Abstract Argumentation Frameworks
abstract argumentation semantics	(KR) An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
abstract datatypes	(RTA-TLCA) Abstract datatypes for real numbers in type theory
abstract diagnosis	(ICLP) Abstract Diagnosis for tccp using a Linear Temporal Logic
abstract dialectical frameworks	(NMR) Extension--based Semantics of Abstract Dialectical Frameworks
abstract domain	(CAV) QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
abstract domain combinator	(CAV) QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
abstract domain of polyhedra	(VSTTE) A certifying frontend for (sub)polyhedral abstract domains
abstract DPLL	(SMT) raSAT: SMT for Polynomial Inequality
Abstract Elementary Classes	(LC) Computing the number of types of infinite tuples (LC) Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes (INFINITY) Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
abstract interpretation	(NSV) Policy iteration in finite templates domain (ICLP) Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (ICLP) Analysis and Transformation Tools for Constrained Horn Clause Verification (CAV) QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (VSTTE) A certifying frontend for (sub)polyhedral abstract domains (ITP) Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code (CSL-LICS) Abstract Interpretation from Buchi Automata (WING) A Theorem Prover Backed Approach to Array Abstraction (CSF) Information flow monitoring as abstract interpretation for relational logic (WST) To Infinity... and Beyond!
abstract machine	(LOLA) Abstract Self Modifying Machines (CSL-LICS) A functional functional interpretation
Abstract Machines	(HOR) Distilling Abstract Machines
Abstract Model Theory	(LC) On the logical use of implicit contradictions
abstract state machine	(DCM) Cellular Automata are Generic
Abstraction	(KR) An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications (SYNT) AbsSynthe: abstract synthesis from succinct safety specifications (POS) Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
Abstraction refinement	(CAV) G4LTL-ST: Automatic Generation of PLC Programs (CAV) Diamonds are a Girl's Best Friend: Partial Order Reduction for Timed Automata With Abstractions (CAV) SMT-based Model Checking for Recursive Programs (DL) Abstraction Refinement for Ontology Materialization
abstraction-refinement	(CAV) Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR)
ac0	(LCC) Infinite AC0 Circuits for Parity
ACC	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion
access control	(CAV) VAC - Verifier of Administrative Role-based Access Control Policies (CSF) Declarative Policies for Capability Control (CSF) Attribute-based Encryption for Access Control Using Elementary Operations (WWV) Static Enforcement of Role-Based Access Control
accidental	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
Accountability	(FCS-FCC) Actual Causes of Security Violations
Accountable escrow	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
Accountable-escrowed encryption	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
accumulation	(CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Ackermann's Function	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
ACL2	(ITP) Rough Diamond: An Extension of Equivalence-based Rewriting (ITP) The reflective Milawa theorem prover is sound (down to the machine code that runs it) (ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview (ITP) Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete (ACL2) Development of a Translator from LLVM to ACL2 (ACL2) Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4 (ACL2) Modeling Algorithms in SystemC and ACL2 (ACL2) Experiments with TPTP-style Automated Theorem Provers on ACL2 Problems (ACL2) Industrial-Strength Documentation for ACL2
ACL2(r)	(ACL2) Equivalence of the Traditional and Non-Standard Definitions of Concepts from Real Analysis
ACT-R	(ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
action	(NLCS) How to do things with types
action and change	(KR) Dynamic Causal Calculus
Action histories	(KR) Transforming Situation Calculus Action Theories for Optimised Reasoning
action languages	(DL) Planning Problems for Graph Structured Data in Description Logics (ASPOCP) Action Language BC+: Preliminary Report (ASPOCP) Applying Action Language BC with Hierarchical Domain Abstraction to Mobile Robots
Action Models	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
Actor Prolog	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
Acyclic queries	(DL) Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
acyclicity properties	(ASPOCP) Declarative Encodings of Acyclicity Properties
Admissible computability	(LC) Applications of admissible computability
admissible rule	(UNIF) From Admissibility to a New Hierarchy of Unification Types (LC) Some properties of Intuitionistic Set Theory with the principle UP. (LATD) A meta-Logic of multiple-conclusion rules
admissible rules	(GSB) Link formulas in implication fragments of substructural logics (LC) Almost structurally complete consequence operations extending S4.3 (LC) Characterising Logics through their Admissible Rules (LATD) Admissible rules and almost structural completeness in some first-order modal logics (LATD) Bases for admissible rules for fragments of RMt (LATD) The Admissible Rules of Subframe Logics (LATD) Quasivarieties of MV-algebras and structurally complete Lukasiewicz logics
Admissible strategies	(CSL-LICS) The Complexity of Admissibility in Omega-Regular Games
adversary models	(CSF) Actor Key Compromise: Consequences and Countermeasures
adverse interactions	(KR4HC) Using First-Order Logic to Represent Clinical Practice Guidelines and to Mitigate Adverse Interactions
Aeronautics	(NSV) Certifying Square Root and Division Elimination
affine arithmetic	(SMT) raSAT: SMT for Polynomial Inequality
affine group over the integers	(LATD) Classification of germinal MV-algebras
Affine logic	(GSB) On Affine Logic and Łukasiewicz Logic
Agda	(DTP) An Embedded Hardware Description Language using Dependent Types (ITP) Towards a Formally Verified Proof Assistant (LFMTP) Some constructions on ω-groupoids
Agent Architectures	(ICLP) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments (NMR) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report
agent programming	(ICLP) Pengines: Web Logic Programming Made Easy
Aggregates	(ICLP) Vicious Circle Principle and Logic Programs with Aggregates
aggregation	(PAS) Programming Language Aggregation with Applications in Equivalence Checking
aggregators in probabilistic models	(KR) Relational Logistic Regression
AI	(ARW-DT) (AI) Planning to Reconfigure your Robot? (ARW-DT) Using CSP Meta Variables in AI Planning
ALC	(DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
ALCH	(ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge
ALCQIO	(DL) Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
algebra	(LATD) Relatively filtral quasivarieties
Algebra of maps	(KR) Knowledge Maps of Web Graphs
algebraic counterpart	(LATD) On logics of varieties and logics of semilattices
algebraic data types	(VSTTE) Formalizing Semantics with an Automatic Program Verifier (RTA-TLCA) Unnesting of Copatterns
Algebraic effect	(LOLA) Compiling Effectful Terms to Transducers: Prototype Implementation of Memoryful Geometry of Interaction (CSL-LICS) Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects
Algebraic effects	(LOLA) Programming and Verifying with Effect Handling and Iteration (CSL-LICS) Substitution, jumps, and algebraic effects
algebraic effects and handlers	(NLCS) Algebraic Effects and Handlers in Natural Language Interpretation
Algebraic logic	(LATD) Many-valued modal logic over residuated lattices via duality
Algebraic Message Model	(CSF) A Sound Abstraction of the Parsing Problem
algebraic program structures	(FWFM) Algebraic description of restricted programming and elements of its logics
Algebraic semantics	(LATD) On Pocrims and Hoops (LATD) Axiomatising a fuzzy modal logic over the standard product algebra
Algebraic specification	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits (WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ
Algebraic structure	(TermGraph) Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse (LC) Uniform and non-uniform reducibilities of algebraic structures
algebraic unification	(UNIF) From Admissibility to a New Hierarchy of Unification Types
Algebraizable logics	(LATD) Generalizing the Leibniz and Suszko operators
Algorithm	(FRIDA) On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering (DL) An ABox Revision Algorithm for the Description Logic EL_\bot (PAS) Synthesis of Algorithms on Sets Represented as Monotone Lists (PAS) Symbolic Problem Solving With Bidirectional Executable Representations
Algorithm Configuration	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Algorithm Schedules	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Algorithm Selection	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (NMR) The Multi-engine ASP Solver ME-ASP: Progress Report
Algorithm Visualization	(ICLP) Visualization of Constraint Handling Rules
Algorithmic randomness	(LC) Integer-valued randomness and degrees (LC) Applications of admissible computability (LC) UD-randomness and the Turing degrees (CSL-LICS) A quest for algorithmically random infinite structures
algorithms	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (DL) Query Rewriting under EL TBoxes: Efficient Algorithms (PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas
Algorithms Portfolio	(ICLP) SUNNY: a Lazy Portfolio Approach for Constraint Solving
aliasing	(ITRS) Lucretia — intersection type polymorphism for scripting languages
Allen algebra	(KR) Belief Revision in the Propositional Closure of a Qualitative Algebra
alliances in graphs	(ASPOCP) Computing Secure Sets in Graphs using Answer Set Programming
alpha equality	(LFMTP) A Generic Approach to Proofs about Substitution
alternating pushdown systems	(IFIP-WG16) Rewriting, Proofs and Transition Systems
alternating temporal logic	(KR) A Temporal Logic of Strategic Knowledge
alternating Turing machine	(DL) How to Best Nest Regular Path Queries
amalgamation	(LC) (LC) Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes
amalgamation property	(LATD) On tensor product in Lukasiewicz logic
AMBA	(SYNT) Parameterized Synthesis Case Study: AMBA AHB
amortised resource analysis	(RTA-TLCA) Amortised Resource Analysis and Typed Polynomial Interpretations
Amortized Complexity	(CAV) A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (Isabelle) Amortized Complexity Verified
ample generics	(LC) Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures
analysis	(LC) Predicative Mathematics via Safety Relations (LC) Effective genericity and differentiable functions
Analytical hierarchy	(LC) Computable numberings in Analytical Hierarchy
analyticity	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi
Ancestral logic	(PSC) Intuitionistic Ancestral Logic
Android	(WST) Non-termination of Dalvik bytecode via compilation to CLP (ORE) Android Went Semantic: Time for Evaluation (PAS) Automatic App Testing of LTL Properties
Android permissions	(STAST) Using Statistical Information to Communicate Android Permission Risks to Users
angry birds	(KR) Qualitative Spatial Representation and Reasoning in Angry Birds: the Extended Rectangle Algebra
annotated code	(LOLA) Abstract Self Modifying Machines
annotations	(DL) Temporalising EL Concepts with Time Intervals
anomalous human activity	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
Anonymity Guarantees	(CSF) TUC: Time-sensitive and Modular Analysis of Anonymous Communication
Anonymous Communication Protocols	(CSF) TUC: Time-sensitive and Modular Analysis of Anonymous Communication
answer extraction	(NLSR) Natural Language Access to Data
Answer Set Programming	(ICLP) Causal Graph Justifications of Logic Programs (ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (ICLP) Anytime Computation of Cautious Consequences in Answer Set Programming (ICLP) Dynamic Consistency Checking in Goal-Directed Answer Set Programming (ICLP) Clingo = ASP + Control (ICLP) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments (ICLP) Grounding Bound Founded Answer Set Programs (ICLP) Vicious Circle Principle and Logic Programs with Aggregates (KR) Logic Programs with Ordered Disjunction: First-order Semantics and Expressiveness (KR) Strong Equivalence of Non-monotonic Temporal Theories (KR) Stable Models of Multi-Valued Formulas: Partial vs. Total Functions (KR) Using Answer Set Programming for Solving Boolean Games (KR) Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (KR) The Semantics of Gringo and Infinitary Propositional Formulas (KR) First-Order Default Logic Revisited (IJCAR) Quati: An Automated Tool for Proving Permutation Lemmas (DL) Towards Practical Deletion Repair of Inconsistent DL-programs (PRUV) Stable Models of Fuzzy Propositional Formulas (ASPOCP) Interactive Query-based Debugging of ASP Programs (ASPOCP) Epistemic Logic Programs with Sorts (ASPOCP) ``Are Preferences Giving You a Headache?'' - ``Take asprin!'' (ASPOCP) On the Implementation of Weak Constraints in WASP (ASPOCP) Temporal Stable Models are LTL-representable (ASPOCP) Action Language BC+: Preliminary Report (ASPOCP) Query Answering in Resource-Based Answer Set Semantics (ASPOCP) Declarative Encodings of Acyclicity Properties (ICLP) Bound Founded Answer Set Programming (RCRA) Declarative Specification of Benchmark Sessions via ASP (RCRA) A Systematic Analysis of Levels of Integration between High-Level Task Planning and Low-Level Feasibility Checks (NMR) The Multi-engine ASP Solver ME-ASP: Progress Report (NMR) Probabilistic Inductive Logic Programming based on Answer Set Programming (NMR) Generalising Modular Logic Programs (NMR) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report (NMR) FO(C) and Related Modelling Paradigms (NMR) Semantics and Compilation of Answer Set Programming with Generalized Atoms (NMR) Integrating Declarative Programming and Probabilistic Graphical Models for Knowledge Representation and Reasoning in Robotics (NMR) Interactive Debugging of ASP Programs (NMR) Preliminary Report on WASP 2 (KR4HC) Conformance Analysis of the Execution of Clinical Guidelines with Basic Medical Knowledge and Clinical Terminology (KR4HC) Preliminary Result on Finding Treatments for Patients with Comorbidity
Answer Set Programming (ASP)	(ICLP) On Cascade Products of Answer Set Programs (PLP) Approximated Probabilistic Answer Set Programming
answer set programming extensions	(ASPOCP) A Refinement of the Language of Epistemic Specifications
Answer Set Solving	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming (ICLP) Clingo = ASP + Control
answer-set programming	(ICLP) On Strong and Default Negation in Answer-Set Program Updates (NMR) On Strong and Default Negation in Logic Program Updates
anytime algorithms	(ICLP) Anytime Computation of Cautious Consequences in Answer Set Programming
API Design	(ASA) Security APIs for Device Enrolment
app	(PAS) Automatic App Testing of LTL Properties
app functionality	(STAST) Using Statistical Information to Communicate Android Permission Risks to Users
application	(SAT) Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
applications	(CICLOPS-WLPE) SWI-Prolog version 7 extensions
Applications of HOL4	(HOL) Using HOL4 to Formalize Physical Systems
Applications of logic to combinatorics	(FWFM) Explaining the decompositionality of MSO using applications to combinatorics
applicative bisimulation	(FCS-FCC) Towards a Coinductive Characterization of Computational Indistinguishability
applied KR for design computing	(KR) Computing Narratives of Cognitive User Experience for Building Design Analysis: KR for Industry Scale Computer-Aided Architecture Design
Approximate inference	(ICLP) Adaptive MCMC-Based Inference in Probabilistic Logic Programs (PLP) An OpenCL implementation of a forward sampling algorithm for CP-logic
approximate program equivalence	(DCM) Differential privacy at work: Verification of approximate probabilistic programs and models for choosing epsilon
Approximate Reachability	(CAV) Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction
approximate reasoning	(LATD) An application of distance-based approximate reasoning for diagnostic questionnaires in healthcare (KR4HC) A Logic-Based Framework for Medical Assessment Questionnaires
approximated answers	(DL) WApproximation: computing approximate answers for ontological queries
approximation	(CAV) SMT-based Model Checking for Recursive Programs (SAT) Approximating highly satisfiable random 2-SAT
Approximation Fixpoint Theory	(ICLP) A Well-Founded Semantics for FOL-Programs (KR) Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory
approximation spaces	(LC) Dynamic logic on approximation spaces
Approximation theorem	(ITRS) Uniform Proofs of Normalisation and Approximation for Intersection Types
Approximations	(IJCAR) Approximations for Model Construction (DL) Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
Apéry constant	(ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
arctangent	(ACL2) Formal Verification of Medina's Sequence of Polynomials for Approximating Arctangent
Argument	(NLCS) Analyzing and Modelling the Structure of Argument Compounds in Logic: the case of technical texts (VeriSure) Assurance and Verification of Security Properties
argument game	(NMR) Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation
Argumentation	(KR) Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation (KR) David Poole’s Specificity Revised (KR) Interval Methods for Judgment Aggregation in Argumentation (VeriSure) Balancing the Formal and Informal in Safety Case Arguments (LC) Argumentation Logic (RCRA) Concept Learning by a Monte-Carlo Tree Search of Argumentations (NMR) Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation (NMR) Abduction in Argumentation: Dialogical Proof Procedures and Instantiation
argumentation framework	(KR) A Dynamic Logic Framework for Abstract Argumentation
Argumentation frameworks	(KR) How to Argue for Anything: Enforcing Arbitrary Sets of Labellings Using AFs (NMR) Extension--based Semantics of Abstract Dialectical Frameworks
argumentation semantics	(KR) Characteristics of Multiple Viewpoints in Abstract Argumentation (NMR) Compact Argumentation Frameworks (NMR) Extension--based Semantics of Abstract Dialectical Frameworks
Aristotle	(LC) Aristotle’s conception of demonstration and modern proof theory
arithmetic	(LC) Justifying proof-theoretic reflection principles
Arithmetical complexity	(LATD) Trakhtenbrot theorem and first-order axiomatic extensions of MTL
Arithmetical hirarchy	(LC) Ideals without minimal numberings in the Rogers semilattice
Arithmetized Completeness Theorem	(LC) Some applications of the Arithmetized Completeness Theorem to second-order arithmetic
Array programs	(SMT) Decision Procedures for Flat Array Properties
Arrays	(UNIF) Unification Modulo Common List Functions (SMT) Weakly Equivalent Arrays
artifact-centric systems	(KR) Model Checking Unbounded Artifact-Centric Systems
Artificial Intelligence	(ICLP) SUNNY: a Lazy Portfolio Approach for Constraint Solving (VSTTE) A Model for Capturing and Replaying Proof Strategies (PAAR) BliStr: The Blind Strategymaker (PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5 (VERIFY) Verifying safety properties of Artificial General Intelligence: The ultimate safety-critical system?
Artin-Schreier extensions	(LC) Around n-dependent fields
ASP	(ASPOCP) Epistemic Logic Programs with Sorts (ASPOCP) On the Implementation of Weak Constraints in WASP
ASP debugging	(ASPOCP) Interactive Query-based Debugging of ASP Programs
ASP Solver	(NMR) The Multi-engine ASP Solver ME-ASP: Progress Report
Assertions	(ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs
assumptions	(SAT) MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
assurance	(VeriSure) Assurance and Verification of Security Properties
assurance case	(VeriSure) Assurance and Verification of Security Properties
Assurance cases	(VeriSure) Balancing the Formal and Informal in Safety Case Arguments
Asymmetric unification	(UNIF) On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract)
Asynchronous interaction	(Coq) Asynchronous interaction for Coq
asynchronous systems	(EC2) A new reduction for event-driven distributed programs
Asyncrhonous Interaction	(UITP) PIDE for Asynchronous Interaction with Coq
ATL	(KR) An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications
ATL and ATL*	(CAV) CEGAR for Qualitative Analysis of Probabilistic Systems
ATL+	(IJCAR) Optimal tableaux-based decision procedure for testing satisfiability in the Alternating-time temporal logic ATL+
Atomic Decomposition	(DL) Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
Atomic flows	(CSL-LICS) On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
atomic models	(INFINITY) When excellence and local finiteness collide
Atomicity	(CAV) Automatic Atomicity Verification for Clients of Concurrent Data Structures
ATP	(PAAR) Beagle as a HOL4 external ATP method
ATP competitions	(PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5
ATP process	(PAAR) Automated Theorem Proving using the TPTP Process Instruction Language
Attack trees	(CSF) Automated Generation of Attack Trees
Attractor	(WPTE) Attractor Equivalence: An Observational Semantics for Reaction Networks
attribute transition	(DL) Transition Constraints for Temporal Attributes
attribute-based encryption	(CSF) Attribute-based Encryption for Access Control Using Elementary Operations
auction strategy	(ACL2) On Vickrey's Theorem and the Use of ACL2 for Formal Reasoning in Economics
auction theory	(ARW-DT) Reasoning about Auctions
Audit	(FCS-FCC) Actual Causes of Security Violations
authentication	(STAST) What You Enter Is What You Sign: input integrity in an online banking environment (CSF) Actor Key Compromise: Consequences and Countermeasures
autoepistemic logic	(NMR) Implementing Default and Autoepistemic Logics via the Logic of GK
Automata	(ICLP) On Cascade Products of Answer Set Programs (FRIDA) Model Checking Distributed Consensus Algorithms (CAV) From LTL to Deterministic Automata: A Safraless Compositional Approach (IJCAR) Visibly Linear Temporal Logic (CSL-LICS) Senescent Ground Tree Rewrite Systems (Isabelle) The CAVA Automata Library (RTA-TLCA) Automatic Evaluation of Context-Free Grammars (System Description)
automata theory	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity (CSL-LICS) Infinite-State Energy Games
Automata-Based Reasoning	(KR) Decidable Gödel Description Logics without the Finitely-Valued Model Property (DL) Fuzzy DLs over Finite Lattices with Nominals (DL) Gödel Description Logics with General Models
automate reasoning	(ARW-DT) Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
automated deduction	(IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description) (IJCAR) Otter proofs of theorems in Tarskian geometry
Automated design	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach
automated planning	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Automated Program Verifiers	(VSTTE) Formalizing Semantics with an Automatic Program Verifier
automated reasoning	(KR) Answering Instance Queries Relaxed by Concept Similarity (ACL2) Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4 (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R) (PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5 (ARW-DT) Reasoning about Auctions (ARW-DT) Automated Reasoning in Deontic Logic
automated testing	(ASA) Caetus tool
automated theorem prover	(IJCAR) MleanCoP: A Connection Prover for First-Order Modal Logic
automated theorem proving	(FRIDA) Having SPASS with Pastry and TLA+ (UNIF) Constraint Manipulation in SGGS (ACL2) Experiments with TPTP-style Automated Theorem Provers on ACL2 Problems (Vampire) First Class Boolean Type in First-Order Theorem Proving and TPTP (Vampire) SAT solving experiments in Vampire (ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems (ARQNL) Problem Libraries for Non-Classical Logics (ARQNL) Dialogues for proof search (PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics (PAAR) Automated Theorem Proving using the TPTP Process Instruction Language (PAAR) BliStr: The Blind Strategymaker (PAAR) Beagle as a HOL4 external ATP method (ARW-DT) The Leo-III Project
automated theorem proving process	(PAAR) Automated Theorem Proving using the TPTP Process Instruction Language
Automated theorem proving via SMT solver	(VSTTE) Automatically verified implementation of data structures based on AVL trees (SHORT)
automated verification	(FCS-FCC) Protocol Indistinguishability and the Computationally Complete Symbolic Attacker (WING) Loop Invariants by Mutation, Dynamic Validation, and Static Checking
automatic annotation	(KR4HC) Towards Linked Vital Registration Data for Reconstituting Families and Creating Longitudinal Health Histories
automatic program calculation	(ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
automatic sequences	(CSL-LICS) On Periodically Iterated Morphisms
automatic structures	(AISS) Quantitative Automatic Structures
automatic theorem provers	(Vampire) My Life with an Automatic Theorem Prover
Automatic verification	(CAV) VAC - Verifier of Administrative Role-based Access Control Policies
automation	(FCS-FCC) A tool for automating the computationally complete symbolic attacker (ITP) Implicational Rewriting Tactics in HOL (ITP) Compositional Computational Reflection (ACL2) Data Definitions in ACL2 Sedan (HOL) New Styles of Proof (WST) Automating Elementary Interpretations (RTA-TLCA) Conditional Confluence (System Description) (RTA-TLCA) Automated Complexity Analysis Based on Context-Sensitive Rewriting
Automation of Mathematics	(PAS) The Theorema Approach to Mathematics
automatizability	(PC) Parity games and propositional proofs
Autonomous systems	(ARW-DT) (AI) Planning to Reconfigure your Robot?
autonomy oriented computing	(RCRA) Self Regulating Mechanisms for Network Immunization
autostability	(LC) Boolean algebras and degrees of autostability relative to strong constructivizations
auxiliary relations	(CSL-LICS) Pattern Logics and Auxiliary Relations
AVATAR	(Vampire) Playing with AVATAR
avoidability	(DTP) Sequential decision problems and a computational theory of avoidability
awareness	(KR) Toward a Knowledge Level Analysis of Forgetting
axiom of determinacy	(LC) A new lower bound for the length of the hierarchy of norms
axiom of global choice	(INFINITY) Power Kripke-Platek set theory, ordinal analysis and global choice
axiomatic logic	(Coq) Automating Abstract Logics
axiomatic semantics	(FWFM) Using Esoteric Language for Teaching Formal Semantics (RTA-TLCA) All-Path Reachability Logic
Axiomatics	(LC) An axiomatic approach to modelling of orders of magnitude
axiomatization	(KR) How to Argue for Anything: Enforcing Arbitrary Sets of Labellings Using AFs (KR) Axiomatizing Rationality (LC) A completeness theorem for general relativity (CSL-LICS) Axioms and Decidability for Type Isomorphism in the Presence of Sums (ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems
Axiomatization of Admissible Rules	(LATD) Bases for admissible rules for fragments of RMt
Ayciclicity conditions	(KR) State-Boundedness for Decidability of Verification in Data-Aware Dynamic Systems
B
Bachmann's H(1)	(INFINITY) Systems of Strength H(1)
back and forth	(LATD) Advances on elementary equivalence in model theory of fuzzy logics
back-and-forth	(LC) An ordinal rank characterising when Forth suffices
backdoor set	(PCCR) Backdoors into Heterogeneous Classes of SAT and CSP
backdoor sets	(PCCR) Backdoors into Two Occurrences (PCCR) Backdoors to Planning (PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PCCR) Backdoors into Heterogeneous Classes of SAT and CSP
backdoors	(PCCR) Backdoors to Planning (PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
background theories	(IJCAR) Finite Quantification in Hierarchic Theorem Proving
Backtracking	(RCRA) A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP (NMR) Preliminary Report on WASP 2
Backtracking Algorithms	(CSPSAT) Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms
Backtracking Search	(ParSearchOpt) On the Parallelization of Randomized Propagation-based Constraint Solving
backward induction	(LG) Forward and backward induction in dynamic games: Distilling the axiomatic differences on common ground
backward proof search	(IJCAR) A History-Based Theorem Prover for Intuitionistic Propositional Logic using Global Caching: IntHistGC System Description
Balanced tree data structures	(VSTTE) Automatically verified implementation of data structures based on AVL trees (SHORT)
Banach space	(LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
Banzhaf index	(LATD) Constructing many-valued logical functions with small influence of their variables
Bar recursion	(PSC) Effective Bounds on the Podelski-Rybalchenko Termination Theorem
bases for admissible rules	(LATD) Admissible rules and almost structural completeness in some first-order modal logics
Batch verification	(CSF) Certified Synthesis of Efficient Batch Verifiers
Bayesian inference	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
Bayesian model selection	(PLP) Exploring probabilistic grammars of symbolic music using PRISM
Bayesian networks	(IJCAR) The Bayesian Description Logic BEL (DL) Bayesian Description Logics (LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability
BDD	(iPRA) Practical CNF Interpolants Via BDDs
Beagle	(PAAR) Beagle as a HOL4 external ATP method
Beam Splitter	(ITP) Formal Verification of Optical Quantum Flip Gate
behavior of 2-formulas	(LC) Some remarks on $\aleph_0$-categorical weakly circularly minimal structures
Behavioral Synthesis	(ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview
Behavioural Differential Equations	(PSC) Observational Equivalence for Behavioural Differential Equations
belief base	(KR) Belief Change and Base Dependence
Belief bias	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect
belief change	(KR) A Dynamic Logic Framework for Abstract Argumentation (KR) Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments (KR) Tracking Beliefs and Intentions in the Werewolf Game (KR) Belief Change and Base Dependence (KR) Toward a Knowledge Level Analysis of Forgetting (LC) A Defense of Information Economy Principle (DL) Rational Elimination of DL-Lite TBox Axioms (NMR) Belief merging within fragments of propositional logic
Belief Merging	(KR) On Egalitarian Belief Merging (NMR) Belief merging within fragments of propositional logic
belief probability	(DL) Reasoning about Belief Uncertainty in DL-Lite N bool (PRUV) A New DL‐Lite N Bool Probabilistic Extension Using Belief
belief revision	(KR) On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses (KR) Minimal Change in AGM Revision for Non-classical Logics (KR) Belief Change and Base Dependence (KR) Belief Revision in the Propositional Closure of a Qualitative Algebra (KR) Belief Change and Semiorders (LG) Non-characterizability in belief revision: an application of finite model theory (NMR) Belief Revision and Trust (NMR) Nonmonotonic Reasoning as a Temporal Activity
Belnap-Dunn logic	(LATD) De Morgan logics with a notion of inconsistency
benchmark	(WING) ALICe: A Framework to Improve Affine Loop Invariant Computation (ORE) Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners (ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development
Benchmarking	(ORE) A Scalable Benchmark for OBDA Systems: Preliminary Report (RCRA) Declarative Specification of Benchmark Sessions via ASP
benchmarks	(NMR) Some thoughts about benchmarks for NMR
benign	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
Bernays	(LC) On Bernays' Generalization of Cantor's Theorem
Bernstein basis	(HSB) Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
Best Response Dynamics	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
Beth definability property	(LC) Weak Beth definability property for finite variable fragments.
Betweenness centrality	(SAT) Impact of Community Structure on SAT Solver Performance
BHK	(LC) An outline of intuitionistic epistemic logic
BHK interpretation	(PSC) A joint logic of problems and propositions, a modified BHK-interpretation and proof-relevant topological models of intuitionistic logic
Bi-Abduction	(CAV) Shape Analysis via Second-Order Bi-Abduction
bi-immunity	(LC) A DNC function that computes no effectively bi-immune set
bi-intuitionistic logic	(CLC) Dualized Type Theory
biaffine PROP	(WST) Ordering Networks
Bialethism	(LATD) Truth degrees in the interval [-1,1] for the librationist system $\pounds$.
Bidirectional	(PAS) Symbolic Problem Solving With Bidirectional Executable Representations
BiFL-algebras	(LATD) Embeddings into BiFL-algebras and conservativity
Big Data	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data
Bilinear Pairing	(CSF) Certified Synthesis of Efficient Batch Verifiers
bimodule	(CSL-LICS) Transition systems over games
binary decision diagram	(FRIDA) Models and techniques for verification of Software Defined Networks
binary decision diagrams	(IJCAR) Implementing Tableaux Calculi Using BDDs: BDDTab System Description
binders	(Coq) Presentation of Three Neat Tricks in Coq 8.5
biocompilaton	(VEMDP) Modeling and Analysis of Genetic Boolean Gates Using the Infobiotics Workbench
Bioengineering	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach
Biological Networks	(CAV) Invariant verification of nonlinear hybrid automata networks of cardiac cells
biological systems	(CAV) Analyzing and Synthesizing Genomic Logic Functions (HSB) Exploiting the eigenstructures of linear systems to speed up reachability computation
biology	(CAV) Finding instability in biological models
BioPortal	(DL) Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
bipolar argumentation	(NMR) Towards a Benchmark of Natural Language Arguments
birth/death and marriage records	(KR4HC) Towards Linked Vital Registration Data for Reconstituting Families and Creating Longitudinal Health Histories
bisimulation	(CAV) The Spirit of Ghost Code (LC) Fuzzy Bsimulation for Standard Godel Modal Logic (CSL-LICS) Transition systems over games (DL) Comparing the Expressiveness of Description Logics (VEMDP) Verifying Polymer Reaction Networks using Bisimulation (RTA-TLCA) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
bisimulation invariance	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
Bisimulation Quantifiers	(LC) On Uniform Interpolation for the Guarded Fragment
bisimulation up-to	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
bit-vector	(CAV) Bit-Vector Rewriting with Automatic Rule Generation (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
Bit-vector Preprocessing	(CAV) Bit-Vector Rewriting with Automatic Rule Generation
bit-vectors	(CAV) A Tale of Two Solvers: Eager and Lazy Approaches to Bit-vectors
Bitopological Semantics	(LATD) Bitopological Duality and Three-valued Logic
BL	(LATD) Introducing an exotic MTL-chain
blind multi-counter automata	(AISS) Of stacks (of stacks (...) with blind counters) with blind counters
block-ciphers	(CSF) Automated Analysis and Synthesis of Block-Cipher Modes of Operation
Blocked Clause Decomposition	(SAT) Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask)
Blocked Sets	(SAT) Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask)
blog	(HOL) Modernising HOL's documentation
Blum-Shub-Smale	(CSL-LICS) On the Computing Power of +, −, and ×
bmc	(CAV) SMT-based Model Checking for Recursive Programs
Boehm tree	(CSL-LICS) Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
Boolean algebra	(LC) Boolean algebras and degrees of autostability relative to strong constructivizations
Boolean Algebra and Presburger Arithmetic	(ARW-DT) Combined Reasoning with Sets and Aggregation Functions
Boolean Cardinality	(POS) Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
Boolean circuit complexity	(DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
Boolean games	(KR) Using Answer Set Programming for Solving Boolean Games (KR) ∃GUARANTEENASH for Boolean Games Is NEXP-Hard
Boolean optimization	(LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability (RCRA) Optimal Neighborhood Preserving Visualization by Maximum Satisfiability
boolean-valued model	(LATD) Boolean-valued judgment aggregation
boosting completeness	(KR) Simultaneous Learning and Prediction
Bootstrapping	(LaSh) Meta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine Development
Borel determinancy	(CSL-LICS) Infinite sequential games with real-valued payoffs
Borel flows	(LC) Regular cross-sections of Borel flows
Borel measurable payoffs	(CSL-LICS) Infinite sequential games with real-valued payoffs
bottom-up evaluation	(ICLP) A Framework for Bottom-Up Simulation of SLD-Resolution
Bound Analysis	(CAV) A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
bounded arithmetic	(LC) Circuit lower bounds in bounded arithmetics (LC) Model theory of bounded arithmetic and complexity theory (PC) Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time (PC) Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (PC) Parity games and propositional proofs (PC) Parameter-free induction in bounded arithmetic
bounded model checking	(CAV) Bounded Model Checking of Multi-Threaded C Programs via Lazy Sequentialization (CAV) Lazy Annotation Revisited (IJCAR) A Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (VERIFY) Reasoning About Vote Counting Schemes Using Light-weight and Heavy-weight Methods
bounded morphisms	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
Bounded Polymorphism	(CSL-LICS) System F with Coercion Constraints
bounded quantifier alternation	(CSL-LICS) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
bounded treewidth	(DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
bounded ultrapower	(LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
Boundedness problem	(CSL-LICS) Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
Bounds-propagation	(ICLP) Numerical Properties of Min-closed CSPs
BPMN	(KR4HC) An Algorithm for Guideline Transformation: from BPMN to PROforma
Branching Time	(KR) Representing and Reasoning About Time Travel Narratives: Foundational Concepts
branching VASS	(RTA-TLCA) Implicational Relevance Logic is 2-ExpTime-Complete
BreakIDGlucose	(CSPSAT) BreakIDGlucose: on the importance of row symmetry
Brownian motion	(CSL-LICS) A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Brzozowski derivatives	(ITP) Unified Decision Procedures for Regular Expression Equivalence
Buchholz rule	(GSB) On cuts and cut-elimination in modal fixed point logics
Buchi automata	(CSL-LICS) Abstract Interpretation from Buchi Automata
bulk synchronous parallelism	(ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
Business Process Management	(KR) SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning
Byzantine Failures	(FRIDA) Synthesizing self-stabilizing fault-tolerant algorithms (extended abstract) (FRIDA) Synthesis for Resilient Distributed Systems
Büchi automata	(CAV) Termination Analysis by Learning Terminating Programs
C
C verification	(VSTTE) Separation algebras for C verification in Coq
C. I. Lewis	(LC) C. I. Lewis' Influence on the Early Work of Emil Post
CafeOBJ	(WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ
Calculus of Inductive Constructions	(UNIF) Towards a better-behaved unification algorithm for Coq
Calculus of structures	(CSL-LICS) Equality and Fixpoints in the Calculus of Structures (CSL-LICS) Symmetric Normalisation for Intuitionistic Logic
Call by name	(CLC) A type system for Continuation Calculus
Call by value	(CLC) A type system for Continuation Calculus
call-by-name	(PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
call-by-name and call-by-value	(CLC) Confluence for classical logic through the distinction between values and computations
call-by-need lambda calculus	(WPTE) Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
call-by-value	(LOLA) Call-by-Value in a Basic Logic for Interaction (PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
canonical formulas	(LATD) Canonical formulas for k-potent residuated lattices
Canonical structures	(UNIF) Towards a better-behaved unification algorithm for Coq (Coq) Towards a better-behaved unification algorithm for Coq
canonicity	(LC) Algorithmic-algebraic canonicity for mu-calculi
Cantor	(LC) On Bernays' Generalization of Cantor's Theorem
Cantor's Diagonal Argument	(LC) A characterization for diagonalized--out objects
Cantor's Theorem	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
Cantor-Bendixson rank	(LC) A computability approach to three hierarchies
capabilities	(CSF) Declarative Policies for Capability Control
cardinal invariants	(LC) Cardinal invariants and template iterations (LC) Matrix iterations and Cichoń's diagram
cardinal number	(ITP) Cardinals in Isabelle/HOL
cardinality	(LC) Definable cardinals just beyond R / Q
cardinality constraints	(SAT) Detecting cardinality constraints in CNF
Careflow	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
case studies	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
Categorical semantics	(CSL-LICS) A type theory for productive coprogramming via guarded recursion (CSL-LICS) Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects
categoricity	(LC) On Jonsson sets and some their properties. (LC) On categoricity of scattered linear orders
category theory	(UNIF) A Categorical Perspective on Pattern Unification (Extended Abstract) (ITP) Experience Implementing a Performant Category-Theory Library in Coq (CSL-LICS) Substitution, jumps, and algebraic effects (CSL-LICS) Transition systems over games (INFINITY) Functors in Computable Model Theory (LFMTP) Some constructions on ω-groupoids (Linearity) A Linear/Producer/Consumer model of Classical Linear Logic
Caucal hierarchy	(LC) Ordinal Notations and Fundamental Sequences in Caucal Hierarchy
causal graph	(PCCR) Backdoors to Planning
Causality	(ICLP) Causal Graph Justifications of Logic Programs (ICLP) C-Log: A Knowledge Representation Language of Causality (KR) Appropriate Causal Models and Stability of Causation (CAV) Causal Termination of Multi-threaded Programs (FCS-FCC) On Well-Founded Security Protocols (NMR) Inference in the FO(C) Modelling Language (NMR) FO(C) and Related Modelling Paradigms
Causality in Databases	(NMR) Causality in Databases: The Diagnosis and Repair Connections
causation	(KR) Dynamic Causal Calculus (FCS-FCC) Actual Causes of Security Violations
cautious reasoning	(ICLP) Anytime Computation of Cautious Consequences in Answer Set Programming
CCS	(CSL-LICS) On the Discriminating Power of Passivation and Higher-Order Interaction
CDCL	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) Size-Space Bounds and Trade-offs for CDCL Proofs
CDCL algorithm	(POS) Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (ARW-DT) Extended Resolution in Modern SAT Solving
CDCL solvers	(SAT) Impact of Community Structure on SAT Solver Performance
cdf interval	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
ce degrees	(LC) Integer-valued randomness and degrees
CEGAR	(CAV) CEGAR for Qualitative Analysis of Probabilistic Systems
CEGIS	(SYNT) Are There Good Mistakes? A Theoretical Analysis of CEGIS
cellular automaton	(DCM) Cellular Automata are Generic
Central Limit Theorem	(Isabelle) A formally verified proof of the Central Limit Theorem
CERES	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents
certain answers	(KR) Certain Answers as Objects and Knowledge
certain knowledge	(KR) Certain Answers as Objects and Knowledge
Certificates	(QBF) Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs (QBF) Resolution Paths and Term Resolution
certification	(IWC) Certification of Confluence Proofs using CeTA (VSTTE) Certification of Nontermination Proofs using Strategies and Nonlooping Derivations (UITP) The Certification Problem Format (RTA-TLCA) Formalizing monotone algebras for certification of termination- and complexity proofs
Certifying Algorithms	(Isabelle) A Simpl Shortest Path Checker Verification
Certifying transformation	(NSV) Certifying Square Root and Division Elimination
chaining predictors	(KR) Simultaneous Learning and Prediction
challenging	(ORE) A Family History Knowledge Base in OWL 2
Change Management	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
channel capacity	(SMT) Speeding Up SMT-Based Quantitative Program Analysis (CSF) Additive and multiplicative notions of leakage, and their capacities
chaos theory	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
Chaotic Liar	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
characterisation theorem	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
characteristic formulae	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
Characterizing Cardinals	(LC) Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes
chemical master equation	(HSB) Optimal Observation Time Points in Stochastic Chemical Kinetics
Chemical Reaction Network	(VEMDP) Verifying Polymer Reaction Networks using Bisimulation
Chemical reaction networks	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach
Chinese Remainder Theorem	(SAT) Simplifying Pseudo-Boolean Constraints in Residual Number Systems
chromatic number	(LC) Davies-trees in infinite combinatorics
Church Rule	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Church's type theory	(PSC) Program extraction in Church's simple theory of types (invited talk)
Church-Fitch	(LC) An outline of intuitionistic epistemic logic
Church-Henkin type theory	(LATD) Church-style type theories over finitary weakly implicative logics
Church-Rosser	(RTA-TLCA) Confluence by Critical Pair Analysis
Cichoń's diagram	(LC) Matrix iterations and Cichoń's diagram
CIG Acquisition	(KR4HC) META-GLARE: a meta-system for defining your own CIG system: Architecture and Acquisition
circuit complexity	(INFINITY) Set functions with small circuits
circuit lower bounds	(LC) Circuit lower bounds in bounded arithmetics
circuits	(FRIDA) Towards binary circuit models that faithfully reflect physical (un)solvability
circular proofs	(GSB) Lyndon Interpolation for the Modal Mu-Calculus
circularly ordered structure	(LC) Some remarks on $\aleph_0$-categorical weakly circularly minimal structures
circumscription	(IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (iPRA) Application Patterns of Projection/Forgetting
claim	(VeriSure) Assurance and Verification of Security Properties
class of structures	(LC) Computable structure theory and formulas of special forms
classes	(LC) On Bernays' Generalization of Cantor's Theorem
classical first-order logic	(SD) First-order Proofs Without Syntax: Summary of Work in Progress
classical first-order logic with inductive predicates	(PAS) Building explicit induction schemas for cyclic induction reasoning
classical linear logic	(Linearity) A Linear/Producer/Consumer model of Classical Linear Logic
classical logic	(CLC) Dualized Type Theory (CLC) Infinitary Classical Logic: Recursive Equations and Interactive Semantics (LC) An Intuitionistic Interpretation of Classical Implication (CSL-LICS) Formulae-as-Types for an Involutive Negation (ARQNL) Computer-oriented inference search in first-order sequent logics (ARW-DT) On Herbrand theorems for classical and non-classical logics
Classical Modal Logics	(GSB) Sequent Systems for Classical Modal Logics
Classical Planning	(KR) Heuristic Guided Optimization for Propositional Planning (KR) SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning
Classical Propositional Logic	(LC) Argumentation Logic
Classical realizability	(CLC) Dualized Type Theory (CSL-LICS) A functional functional interpretation
Classification	(PRUV) Learning Preferences for Collaboration
classification theory	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types
clausal proofs	(SAT) MUS Extraction using Clausal Proofs (iPRA) Interpolation from Clausal Proofs
Clause Learning	(PC) Size-Space Bounds and Trade-offs for CDCL Proofs (ParSearchOpt) A Portfolio Based Parallel SAT Solver with Multiple Deletion Strategies
clause sharing	(POS) Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
clinical decision support	(ORE) An update on Genomic CDS, a complex ontology for pharmacogenomics and clinical decision support (KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
clinical decision support systems	(KR4HC) Process Information and Guidance Systems in the Hospital
clinical education	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
Clinical Guidelines	(KR4HC) Towards a Conceptual Model for Enhancing Reasoning about Clinical Guidelines: A case-study on Comorbidity (KR4HC) Conformance Analysis of the Execution of Clinical Guidelines with Basic Medical Knowledge and Clinical Terminology (KR4HC) Assessment of Clinical Guideline Models Based on Metrics for Business Process Models (KR4HC) Semantic Representation of Evidence-based Clinical Guidelines
clinical practice guideline	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
clinical practice guidelines	(KR4HC) Using First-Order Logic to Represent Clinical Practice Guidelines and to Mitigate Adverse Interactions (KR4HC) Preliminary Result on Finding Treatments for Patients with Comorbidity
clinical processes	(KR4HC) An Algorithm for Guideline Transformation: from BPMN to PROforma
Clinical Trial Protocols	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
Clique-Width	(CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets
clitic pronouns	(NLCS) Computing Italian clitic and relative clauses with tupled pregroups
clones with constants	(LC) Non-monotonic extensions of the weak Kleene clone with constants
Closed Sets	(Linearity) Ludics without Designs I: Triads
cloud computing	(CAV) Software Verification in the Google App-Engine Cloud (VSTTE) Formal Modeling and Verification of CloudProxy
CLP applications	(ICLP) Multi-criteria optimal planning for Energy policies in CLP
Clustering	(ACL2) ACL2(ml): Machine-Learning for ACL2
CNF formulas	(POS) New CNF Features and Formula Classification
CNF partitioning	(POS) Formula partitioning revisited
co-analytic sets	(LC) Co-analytic ideals on $\omega$
Co-NP completeness	(LATD) Poof Search and Co-NP completeness for Many-Valued Logics
coalgebra	(IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description) (CSL-LICS) Coinduction Up-To in a Fibrational Setting
coalgebras	(RTA-TLCA) Unnesting of Copatterns
Cobham recursion	(INFINITY) Set functions with small circuits (INFINITY) Cobham Recursive Set Functions
Cobham recursive set functions	(INFINITY) Proof Theoretic Characterisations of Feasible Set Functions
codata	(RTA-TLCA) Unnesting of Copatterns
codatatypes	(IJCAR) Unified Classical Logic Completeness: A Coinductive Pearl (ITP) Recursive Functions on Codatatypes via Domains and Topologies
code generation	(Isabelle) Towards abstract and executable multivariate polynomials in Isabelle
code verification	(VeriSure) Assurance and Verification of Security Properties
coding	(LC) On a theorem of McAloon
Coercion	(CSL-LICS) System F with Coercion Constraints
coercions	(DTP) A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
Cognitive Modeling	(LG) Game Semantics from a Cognitive Modeling Standpoint
cognitive robotics	(KR) A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (KR) How To Progress Beliefs in Continuous Domains (RCRA) A Systematic Analysis of Levels of Integration between High-Level Task Planning and Low-Level Feasibility Checks
Cognitive Science	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
Cognitive Semantics	(LG) Game Semantics from a Cognitive Modeling Standpoint
coherence	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
Coherent Light	(ITP) Formal Verification of Optical Quantum Flip Gate
coinduction	(ICLP) Tabling, Rational Terms, and Coinduction Finally Together! (FCS-FCC) Towards a Coinductive Characterization of Computational Indistinguishability (RTA-TLCA) A Coinductive Confluence Proof for Infinitary Lambda-Calculus.
coinductive predicates	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
Coinductive Types	(DTP) Terminal semantics for codata types in intensional Martin-Löf type theory (PSC) Observational Equivalence for Behavioural Differential Equations
Collaboration	(PRUV) Learning Preferences for Collaboration
Collapsible Pushdown Systems	(HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
collection scheme	(LC) The problem of a model without collection and without exponentiation
collective coin flipping	(LATD) Constructing many-valued logical functions with small influence of their variables
Coloring number	(LC) Reflection principle of list-chromatic number of graphs
Combination	(UNIF) Hierarchical Combination of Matching Algorithms (Extended Abstract)
Combination method	(ADDCT) Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions
combination of equational theories	(UNIF) On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract)
Combination problem	(IJCAR) A Gentle Non-Disjoint Combination of Satisfiability Procedures
Combinatorial hypermap library	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
Combinatorial optimization	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
combinatorial proof	(SD) First-order Proofs Without Syntax: Summary of Work in Progress
Combinatorial proofs	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
combinatorial topology	(SAT) Proof complexity and the Lovasz-Kneser Theorem
combinatorics	(RTA-TLCA) Ramsey Theorem as an intuitionistic property of well founded relations
Combined Approach	(KR) Polynomial Combined Rewritings for Existential Rules (DL) Certain Answers in a Rough World
combined complexity	(KR) Nominal Schemas in Description Logics: Complexities Clarified
Common Logic	(ARQNL) Proof Support for Common Logic
Commonsense reasoning	(NMR) Belief Revision and Trust
communicating automata	(CSL-LICS) Logic for Communicating Automata with Parameterized Topology (WWV) A Local Logic for Realizability in Web Service Choreographies
communicating finite-state machines	(AISS) Model Checking Communicating Finite-State Machines using Local Temporal Logics
Community detection	(SAT) Community Branching for Parallel Portfolio SAT Solvers
Community Structure	(SAT) Impact of Community Structure on SAT Solver Performance
commutative context-free grammars	(CSL-LICS) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
Comorbidity	(KR4HC) Towards a Conceptual Model for Enhancing Reasoning about Clinical Guidelines: A case-study on Comorbidity (KR4HC) Preliminary Result on Finding Treatments for Patients with Comorbidity
Compact Closed Categories	(NLCS) A low-level treatment of quantifiers in categorical compositional distributional semantics
compactness	(LC) On the compactness theorem in many valued logics
Comparative evaluations	(IJCAR) StarExec: a Cross-Community Infrastructure for Logic Solving
Comparative user evaluation	(DL) Graphol: Ontology representation through diagrams
comparatives	(NLCS) Mereological Comparatives in Delineation Semantics
compartmental models	(HSB) Integration of rule-based models and compartmental models of neurons
competency question	(DL) A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
competitive events	(NMR) Some thoughts about benchmarks for NMR
Compilation	(TermGraph) An Implementation Model for Interaction Nets (TermGraph) Needed Computations Shortcutting Needed Steps
Compiler certification	(ITP) Formal C semantics: CompCert and the C standard
compiler construction	(HOR) Experience with Higher Order Rewriting from the Compiler Teaching Trenches
compiler intermediate representation	(CAV) SMACK: Decoupling Source Language Details from Verifier Implementations
compiler verification	(VeriSure) Witnessing an SSA Transformation (VERIFY) Introducing a Sound Deductive Compilation Approach
Complete lattices	(LC) Canonical extensions and prime filter completions of poset expansions.
complete partial orders	(ITP) Recursive Functions on Codatatypes via Domains and Topologies
complete semilattice	(LATD) Semantic information and fuzziness
completely order reflecting	(LATD) Definability of truth predicates in abstract algebraic logic
completeness	(CLC) Dualized Type Theory (CLC) Extensional Models of Typed Lambda-mu Calculus (LC) Models for the probabilistic sequent calculus (LC) Semantic completeness of first order theories in constructive reverse mathematics (ITP) Completeness and Decidability Results for CTL in Coq (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (CSPSAT) BreakIDGlucose: on the importance of row symmetry (VERIFY) Typed First-Order Logic (PAS) A Model Theory for R-calculus without Cut
completeness for isomorphisms	(LC) Coding graphs into fields
completeness of first-order logic	(IJCAR) Unified Classical Logic Completeness: A Coinductive Pearl
completeness theorem	(LC) A completeness theorem for general relativity (LC) Completeness of second-order separation logic for program verification
Completeness theorem for classical logic	(PSC) Computing with Gödel’s completeness theorem
Completeness theorems	(LC) Constructive completeness and Joyal's theorem (PSC) Constructive completeness and exploding models
completion	(ITP) A New and Formalized Proof of Abstract Completion (LATD) Embedding partially ordered sets into distributive lattices (RTA-TLCA) Cut Admissibility by Saturation
completions	(LC) Canonical extensions and prime filter completions of poset expansions. (LATD) Cut and completion?
complex events	(ICLP) Transaction Logic with (Complex) Events
complex events recognition	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
complex networks	(IJCAR) The Fractal Dimension of SAT Formulas (RCRA) Self Regulating Mechanisms for Network Immunization
complexity	(KR) Exact Learning of Lightweight Description Logic Ontologies (UNIF) Unification Modulo Common List Functions (UNIF) Matching with respect to general concept inclusions in the Description Logic EL (IJCAR) Proving Termination of Programs Automatically with AProVE (LC) Computable structure theory and formulas of special forms (LC) Complexity bounds for Multiagent Justification Logic (CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (CSL-LICS) A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates (CSL-LICS) Logics with Counting and Equivalence (DL) Fuzzy DLs over Finite Lattices with Nominals (DL) Complexity of Temporal Query Abduction in DL-Lite (DL) Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs (DL) Gödel Description Logics with General Models (DL) How to Best Nest Regular Path Queries (DL) Matching with respect to general concept inclusions in the Description Logic EL (DL) Analyzing the Complexity of Consistent Query Answering under Existential Rules (DL) Gödel FL_0 with Greatest Fixed-Point Semantics (PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas (PRUV) Many-valued Horn Logic is Hard (PCCR) Intuitionistic modal logics: efficient fragments and parameterized complexity (RTA-TLCA) Implicational Relevance Logic is 2-ExpTime-Complete (RTA-TLCA) Formalizing monotone algebras for certification of termination- and complexity proofs (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R) (NMR) Inference in the FO(C) Modelling Language
complexity analysis	(ICLP) Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types (KR) Decidable Gödel Description Logics without the Finitely-Valued Model Property (KR) Analyzing the Computational Complexity of Abstract Dialectical Frameworks via Approximation Fixpoint Theory (TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion (IJCAR) The Bayesian Description Logic BEL (SAT) Fixed-parameter tractable reductions to SAT (DL) Bayesian Description Logics (RTA-TLCA) Automated Complexity Analysis Based on Context-Sensitive Rewriting (POS) Typical-case complexity and the SAT competitions
complexity hierarchies	(PCCR) Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond
complexity of evaluation	(CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics
complexity of query answering	(DL) Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics
complexity of rewriting	(RTA-TLCA) Amortised Resource Analysis and Typed Polynomial Interpretations
complexity theory	(KR) ∃GUARANTEENASH for Boolean Games Is NEXP-Hard (LC) Model theory of bounded arithmetic and complexity theory (DL) Complexities of Nominal Schemas
complexity-theoretic hierarchies	(LC) The problem of a model without collection and without exponentiation
Composition Lemma	(LCC) First-Order Logic of Order and Metric has the Three-Variable Property
Composition Synthesis	(ITRS) Delegation-based Mixin Composition Synthesis
Compositional Semantics	(NMR) Generalising Modular Logic Programs
compositionality	(NLCS) Algebraic Effects and Handlers in Natural Language Interpretation (CSL-LICS) Transition systems over games (CSF) Compositional Information-flow Security for Interactive Systems
comprehension model	(KR) A Psychology-Inspired Approach to Automated Narrative Text Comprehension
compressed words	(AISS) Unary Pushdown Automata and Straight-Line Programs
compression	(RCRA) A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP (RTA-TLCA) Proof terms for infinitary rewriting
computability	(LC) On the existential interpretability of structures (CSL-LICS) A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Computability and complexity	(UNIF) Unification in the normal modal logic Alt1
computability theory	(LC) A DNC function that computes no effectively bi-immune set (LC) Coding graphs into fields (INFINITY) Functors in Computable Model Theory
computable analysis	(LC) A computability approach to three hierarchies
computable categoricity	(LC) The $ \Delta^{0}_{\alpha} $-dimension of computable structures
computable dimension	(LC) The $ \Delta^{0}_{\alpha} $-dimension of computable structures
computable functions	(LC) On limitwise monotonic reducibility of Σ^0_2-sets.
Computable linear order	(LC) On categoricity of scattered linear orders (LC) On $\Sigma^0_2$-initial segments of computable linear orders
Computable linear orderings	(LC) $\Delta_2^0$-spectra of linear orderings
computable model theory	(LC) Coding graphs into fields (LC) Applications of admissible computability (INFINITY) Functors in Computable Model Theory
Computable numbering	(LC) Computable numberings in Ershov hierarchy (LC) Relativized universal numberings
computable numberings	(LC) Computable numberings in Analytical Hierarchy
computable structure	(LC) The $ \Delta^{0}_{\alpha} $-dimension of computable structures (LC) The isomorphism problem for computable projective planes
computable structure theory	(LC) Computability in generic extensions (LC) Degree spectra of relations on a cone
computably enumerable equivalence relations	(LC) The complexity of computably enumerable graphs
computably enumerable graphs	(LC) The complexity of computably enumerable graphs
Computation of least general generalizations for nominal terms	(UNIF) Nominal Anti-Unification
computational cognitive modeling	(ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
Computational Complexity	(NSV) Computational complexity of iterated maps on points and sets (KR) Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (KR) Characteristics of Multiple Viewpoints in Abstract Argumentation (KR) Query Inseparability for Description Logic Knowledge Bases (CSL-LICS) Anchored LTL Separation (DL) Query Inseparability by Games (DL) Complexity sources in FDL (LG) Game Reductions (NMR) Compact Argumentation Frameworks
computational content	(CLC) A sheaf model of the algebraic closure (PSC) Computing with Gödel’s completeness theorem
computational indistinguishability	(FCS-FCC) Towards a Coinductive Characterization of Computational Indistinguishability
computational linguistics	(NLSR) Exposing Predictive Analytics through Natural Language Dialog
computational logic	(KR) ASP Encodings of Acyclicity Properties (CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
computational model of narrative	(KR) Computing Narratives of Cognitive User Experience for Building Design Analysis: KR for Industry Scale Computer-Aided Architecture Design
Computational Models	(CSL-LICS) Beta Reduction is Invariant, Indeed
Computational models of argument	(NMR) Analysis of Dialogical Argumentation via Finite State Machines
computational neuroscience	(HSB) Integration of rule-based models and compartmental models of neurons
Computational Pragmatics	(KR) Tracking Beliefs and Intentions in the Werewolf Game
computational psychology	(ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
computational reflection	(Coq) Automating Abstract Logics (ITP) Compositional Computational Reflection
computational semantics	(NLCS) Algebraic Effects and Handlers in Natural Language Interpretation (FCS-FCC) Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model
computational social choice	(PCCR) A Parameterized Complexity Analysis of Generalized CP-Nets
computational soundness	(FCS-FCC) Protocol Indistinguishability and the Computationally Complete Symbolic Attacker (FCS-FCC) A tool for automating the computationally complete symbolic attacker
computer algebra	(ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) (Isabelle) Towards abstract and executable multivariate polynomials in Isabelle
computer interpretable guideline (CIG)	(KR4HC) META-GLARE: a meta-system for defining your own CIG system: Architecture and Acquisition
computer music	(IFIP-WG16) Rhythm Tree Rewriting
Computer Science Education	(LC) The place of logic in computer science education (FWFM) Fun With Formal Methods 2014: Opening Remarks
computer vision	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
computer-aided architecture design	(KR) Computing Narratives of Cognitive User Experience for Building Design Analysis: KR for Industry Scale Computer-Aided Architecture Design
Computer-Aided Cryptography	(CSF) Certified Synthesis of Efficient Batch Verifiers
computer-interpretable guidelines	(KR4HC) Towards a Conceptual Model for Enhancing Reasoning about Clinical Guidelines: A case-study on Comorbidity
computer-supported collaborative work	(ITP) Collaborative Interactive Theorem Proving with Clide
Concept Learning	(RCRA) Concept Learning by a Monte-Carlo Tree Search of Argumentations
Concept matching	(iPRA) Application Patterns of Projection/Forgetting
Concept Similarity	(KR) Answering Instance Queries Relaxed by Concept Similarity (DL) Mary, What's Like All Cats?
conceptual model	(KR4HC) Towards a Conceptual Model for Enhancing Reasoning about Clinical Guidelines: A case-study on Comorbidity
Conceptual Similarity	(DL) Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
Concolic	(iPRA) Fault Localization using Interpolation
Concolic Testing	(EC2) Concolic Testing of Concurrent Programs
concrete domains	(PRUV) Similarity-based Relaxed Instance Queries in EL++
concurrency	(EC2) A new reduction for event-driven distributed programs (ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling (FRIDA) Concurrent Data Structures: Semantics and (Quantitative) Relaxation (CAV) Causal Termination of Multi-threaded Programs (CAV) Regression-free Synthesis for Concurrency (CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs (CSL-LICS) Senescent Ground Tree Rewrite Systems (CSL-LICS) Symmetry in Concurrent Games (ACL2) An ACL2 Mechanization of an Axiomatic Framework for Weak Memory (HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract) (WST) Automatic Termination Analysis for GPU Kernels (WST) Reducing Deadlock and Livelock Freedom to Termination (RTA-TLCA) All-Path Reachability Logic
concurrency and synchronization	(FWFM) An Example Demonstrating the Requirement of Fully Formal Verification Method
Concurrency Testing	(EC2) Concolic Testing of Concurrent Programs
concurrent constraint paradigm	(ICLP) Abstract Diagnosis for tccp using a Linear Temporal Logic
Concurrent Constraint Programming	(ICLP) A Proof Theoretic Study of Soft Concurrent Constraint Programming
Concurrent Data Structures	(CAV) Automatic Atomicity Verification for Clients of Concurrent Data Structures
Concurrent datatypes	(CAV) LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes
Concurrent functional programming	(DCM) A Simple Parallel Implementation of Interaction Nets in Haskell
Concurrent interaction net reduction	(DCM) A Simple Parallel Implementation of Interaction Nets in Haskell
concurrent logic programming	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
Concurrent Programming	(ICLP) A Linear Logic Programming Language for Concurrent Programming over Graph Structures
Concurrent programs	(CAV) Bounded Model Checking of Multi-Threaded C Programs via Lazy Sequentialization
Concurrent stack	(FRIDA) A Fast, Correct Time-Stamped Stack
Concurrent systems	(CSL-LICS) Equilibria of Concurrent Games on Event Structures
Condensed-matter physics	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
condition elimination	(WPTE) On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
conditional logic	(LG) Game Semantics for Conditional Logic
conditional logics	(IJCAR) NESCOND: an Implementation of Nested Sequent Calculi for Conditional Logics
Conditional Queries	(ICLP) Adaptive MCMC-Based Inference in Probabilistic Logic Programs
conditional rewriting	(IWC) On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (RTA-TLCA) Cut Admissibility by Saturation
Conditional Term Rewriting	(WPTE) On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (WPTE) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (WPTE) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (RTA-TLCA) Conditional Confluence (System Description)
conditional term rewriting system	(WPTE) Inverse Unfold Problem and Its Heuristic Solving
conference management system	(CAV) A Conference Management System with Verified Document Confidentiality
confidentiality	(CAV) A Conference Management System with Verified Document Confidentiality
conflict resolution	(ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
confluence	(ICLP) On Termination, Confluence and Consistent CHR-based Type Inference (IWC) On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (IWC) Certification of Confluence Proofs using CeTA (IWC) Normalization Equivalence of Rewrite Systems (IWC) Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (IWC) Confluence and Critical-Pair-Closing Systems (ITP) A New and Formalized Proof of Abstract Completion (RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (RTA-TLCA) Conditional Confluence (System Description) (RTA-TLCA) A Coinductive Confluence Proof for Infinitary Lambda-Calculus. (RTA-TLCA) Reduction System for Extensional Lambda-mu Calculus (PAS) Confluence of Pattern-Based Calculi with Finitary Matching
confluence in algebra	(IWC) Confluence of linear rewriting and homology of algebras
Conformance analysis	(KR4HC) Conformance Analysis of the Execution of Clinical Guidelines with Basic Medical Knowledge and Clinical Terminology
conformant planning	(KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals (ASPOCP) A Refinement of the Language of Epistemic Specifications
ConGolog	(KR) A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations
congruence	(ITP) Rough Diamond: An Extension of Equivalence-based Rewriting
Congruence Closure	(IJCAR) Computing All Implied Equalities via SMT-based Partition Refinement
Congruential logics	(LATD) Congruential deductive systems associated with equationally orderable varieties
conjunctive queries	(LCC) Small Dynamic Descriptive Complexity Classes (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries (DL) Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics (DL) Analyzing the Complexity of Consistent Query Answering under Existential Rules
Conjunctive query answering	(DL) Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs (PRUV) Computing k-Rank Answers with Ontological CP-Nets
conjunctive query evaluation	(CSL-LICS) One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries
Connectedness	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion
connection calculus	(IJCAR) MleanCoP: A Connection Prover for First-Order Modal Logic
connection matrices	(PCCR) Connection matrices of finite rank instead of definability in Monadic Second Order Logic
consensus	(FRIDA) Mechanical Verification of a Constructive Proof for FLP (FRIDA) A Logic-based Framework for Verifying Consensus Algorithms
Consequence relation	(LATD) Interpreting Lukasiewicz logic into Intuitionistic logic
Consequence-based Calculus	(ORE) Just: a Tool for Computing Justifications w.r.t. ELH Ontologies
consequence-based reasoning	(DL) Goal-Directed Tracing of Inferences in EL Ontologies (DL) Bridging the Gap between Tableau and Consequence-Based Reasoning
Consequences	(CSF) Who’s Afraid of Which Bad Wolf? A Survey of IT Security Risk Awareness
conservative extension	(ITP) HOL Constant Definitions Done Right (RTA-TLCA) The Structural Theory of Pure Type Systems (RTA-TLCA) Unnesting of Copatterns
Conservative extensions to stable model semantics	(ICLP) Properties of Stable Model Semantics Extensions
conservativity	(LATD) A semantic approach to conservativity (LATD) Embeddings into BiFL-algebras and conservativity
Consistency	(CLC) Dualized Type Theory (ITP) Towards a Formally Verified Proof Assistant (DL) Gödel Description Logics with General Models (Isabelle) From Types to Sets in Isabelle/HOL
Consistency Checking	(DL) Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract
Consistent query answering	(DL) Analyzing the Complexity of Consistent Query Answering under Existential Rules
Constant Definition	(ITP) HOL Constant Definitions Done Right
constrained clauses	(IJCAR) Locality Transfer: From Constrained Axiomatizations to Reachability Predicates
constrained ordered resolution	(IJCAR) Locality Transfer: From Constrained Axiomatizations to Reachability Predicates
Constraint ASP	(ICLP) Grounding Bound Founded Answer Set Programs
Constraint Handling Rules	(CHR) From XML Schema to JSON Schema: Translation with CHR (ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R (ICLP) On Termination, Confluence and Consistent CHR-based Type Inference (ICLP) Visualization of Constraint Handling Rules
Constraint Horn Clause	(ICLP) Analysis and Transformation Tools for Constrained Horn Clause Verification
constraint logic	(CSL-LICS) No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
Constraint Logic Program	(ICLP) Analysis and Transformation Tools for Constrained Horn Clause Verification
Constraint Logic Programming	(CHR) Constraint Handling Rules with Multiset Comprehension Patterns (ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs (ICLP) Logic and Constraint Logic Programming for Distributed Constraint Optimization (WST) Non-termination of Dalvik bytecode via compilation to CLP (CICLOPS-WLPE) Extending the Finite Domain Solver of GNU Prolog (VPT) Program Verification using Constraint Handling Rules and Array Constraint Generalizations
Constraint Postponement	(UNIF) Towards a better-behaved unification algorithm for Coq
constraint programming	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (SMT) Protocol log analysis with constraint programming (CSPSAT) SAT Compilation for Constraints over Finite Structured Domains (ICLP) Bound Founded Answer Set Programming (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty (ParSearchOpt) On the Parallelization of Randomized Propagation-based Constraint Solving (ParSearchOpt) Towards a complete constraint solver on GPU
Constraint Propagation	(ParSearchOpt) Towards a complete constraint solver on GPU
constraint reasoning	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
constraint satisfaction	(ICLP) SUNNY: a Lazy Portfolio Approach for Constraint Solving (PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PCCR) Backdoors into Heterogeneous Classes of SAT and CSP
constraint satisfaction problem	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (LCC) Descriptive Complexity and CSP (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
Constraint satisfaction problems	(CSL-LICS) Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity (RCRA) Dispensable Instantiations in Constraint Satisfaction Problems (RCRA) A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP
constraint solver	(PAS) A hybrid path constraint solver combined with meta-heuristic search
constraint solving	(CAV) Symbolic Resource Bound Inference for Functional Programs (UNIF) Constraint Manipulation in SGGS (PAS) Automated verification of security protocols and services
Constraint-based synthesis	(WST) Geometric Series as Nontermination Arguments for Linear Lasso Programs
Constraints	(PLP) cProbLog: Restricting the Possible Worlds of Probabilistic Logic Programs (WST) Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (CICLOPS-WLPE) Extending the Finite Domain Solver of GNU Prolog (RTA-TLCA) Tree Automata with Height Constraints between Brothers (PAAR) A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses (ARW-DT) Using CSP Meta Variables in AI Planning
constraints-based	(NMR) Some thoughts about benchmarks for NMR
construction	(LATD) Recent advances in the structural description of involutive FL$_e$-chains
constructive algebra	(CLC) A sheaf model of the algebraic closure (ITP) A Coq Formalization of Finitely Presented Modules
Constructive logic	(LC) Constructive completeness and Joyal's theorem
constructive mathematics	(LC) Reductions in computability theory from a constructive point of view (ITP) Formalized, effective domain theory in Coq (RTA-TLCA) Ramsey Theorem as an intuitionistic property of well founded relations
constructive negation	(KR) Constructive Negation in Extensional Higher-Order Logic Programming
constructive reverse mathematics	(LC) Semantic completeness of first order theories in constructive reverse mathematics
Constructive temporal logic	(CSL-LICS) Functional Reactive Types
Constructive type theory	(PSC) Intuitionistic Ancestral Logic
Content representation	(DL) Shape and Content: Incorporating Domain Knowledge into Shape Analysis
context	(LFMTP) Variable Arity for LF
context free grammars	(LFMTP) A Generic Approach to Proofs about Substitution
context schemas	(LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
context semantics	(CLC) Stratified Nested Linear Logic (CSL-LICS) On Context Semantics for Interaction Nets
Context-based Reasoning	(IJCAR) The Bayesian Description Logic BEL (DL) Bayesian Description Logics
context-free grammars	(NLCS) On Translating Context-Free Grammars into Lambek Categorial Grammars (TermGraph) Nested Term Graphs
context-free sets of graphs	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
context-sensitive rewriting	(RTA-TLCA) Automated Complexity Analysis Based on Context-Sensitive Rewriting
Contexts	(DL) DeaLing with Ontologies using CODs
contextual equivalence	(CSL-LICS) On the Discriminating Power of Passivation and Higher-Order Interaction (WPTE) Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report) (RTA-TLCA) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
Contextual Reasoning	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect (DL) Contextualized Knowledge Repositories with Justifiable Exceptions
contextualized description logics	(DL) Contextualized Knowledge Repositories with Justifiable Exceptions
contingent planning	(KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals
continuation	(PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
continuation passing Prolog	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
continuation semantics	(NLCS) Algebraic Effects and Handlers in Natural Language Interpretation
continuations	(CLC) A type system for Continuation Calculus (CSL-LICS) Formulae-as-Types for an Involutive Negation
continuous noise in effectors and sensors	(KR) How To Progress Beliefs in Continuous Domains
continuous payoffs	(CSL-LICS) Infinite sequential games with real-valued payoffs
Continuous Time	(FCS-FCC) Towards Timed Models for Cyber-Physical Security Protocols
continuous time Markov chains	(HSB) Optimal Observation Time Points in Stochastic Chemical Kinetics
contraction	(KR) Belief Change and Base Dependence (DL) Rational Elimination of DL-Lite TBox Axioms (SD) Substructural Cut Elimination
contracts	(CSF) Declarative Policies for Capability Control
contradiction	(LATD) De Morgan logics with a notion of inconsistency
Contradictions	(LC) On the logical use of implicit contradictions
Control	(CSL-LICS) Substitution, jumps, and algebraic effects
Control Flow Analysis	(HOPA) Environment Unrolling (HOPA) Strong Function Call
Controllability	(SAT) Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
controller	(FRIDA) Models and techniques for verification of Software Defined Networks
controller synthesis	(CAV) Minimizing Running Costs in Consumption Systems (SYNT) AbsSynthe: abstract synthesis from succinct safety specifications
Conversion	(CSL-LICS) System F with Coercion Constraints
conversion algorithm	(PAS) The Verification of Conversion Algorithms between Finite Automata
conversion equivalence	(IWC) Normalization Equivalence of Rewrite Systems
Conversions	(ITP) Implicational Rewriting Tactics in HOL
convex hull	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
convex optimisation	(NSV) Policy iteration in finite templates domain
convex structures	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
Coordination Games	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
copattern matching	(RTA-TLCA) Unnesting of Copatterns
COPD	(KR4HC) Exploiting the Relation between Environmental Factors and Diseases: A Case Study on COPD
Coq	(UNIF) Towards a better-behaved unification algorithm for Coq (Coq) Coqoon: towards a modern IDE for Coq (Coq) Towards a better-behaved unification algorithm for Coq (Coq) Autosubst: Automation for de Bruijn Substitutions (Coq) QuickChick: Property-Based Testing for Coq (DTP) Terminal semantics for codata types in intensional Martin-Löf type theory (VSTTE) Separation algebras for C verification in Coq (ITP) Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code (ITP) Completeness and Decidability Results for CTL in Coq (ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction (ITP) Towards a Formally Verified Proof Assistant (ITP) Formal C semantics: CompCert and the C standard (ITP) Formalized, effective domain theory in Coq (ITP) A Coq Formalization of Finitely Presented Modules (ITP) Experience Implementing a Performant Category-Theory Library in Coq (ITP) Balancing lists: a proof pearl (ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) (ITP) Compositional Computational Reflection (UITP) PIDE for Asynchronous Interaction with Coq (CSF) Certificates for Verifiable Forensics (LFMTP) A Generic Approach to Proofs about Substitution
Coq 8.5	(Coq) Presentation of Three Neat Tricks in Coq 8.5
Coq proof assistant	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
Coq/SSReflect	(Coq) Proof-Pattern Search in Coq/SSReflect
Coq/SSReflect Proof Assistant	(ITP) A Formal Library for Elliptic Curves in the Coq Proof Assistant
Corecursion	(ICLP) Guarding Corecursion in Logic Programming (CSL-LICS) A type theory for productive coprogramming via guarded recursion
cores	(SAT) Cores in Core based MaxSat Algorithms: an Analysis
correct program transformation	(WPTE) Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
correctness	(EC2) Group Communication Patterns for High Performance Computing in Scala
correctness criterion	(CSL-LICS) A new correctness criterion for MLL proof nets (SD) A Correctness Criterion Free from Switchings
Correctness Proofs	(FRIDA) Correctness and Performance Analysis of Distributed High Performance Programs in Scala
cost automata	(CSL-LICS) Two-Way Cost Automata and Cost Logics over Infinite Trees
Cost Models	(CSL-LICS) Beta Reduction is Invariant, Indeed
cost monadic second-order logic	(CSL-LICS) Two-Way Cost Automata and Cost Logics over Infinite Trees
countable choice	(RTA-TLCA) A Model of Countable Nondeterminism in Guarded Type Theory
Countably categorical structures	(LC) Extreme amenability of precompact expansions of countably categorical structures
Counterexamples	(SYNT) Are There Good Mistakes? A Theoretical Analysis of CEGIS
countermeasures	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks
counting	(SAT) Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
counting functions	(INFINITY) Analytic combinatorics of the transfinite
counting quantifiers	(CSL-LICS) Logics with Counting and Equivalence
Coupling	(LATD) Coupling games for Lukasiewicz logic
Courcelle's theorem	(FWFM) Explaining the decompositionality of MSO using applications to combinatorics
coverability problem	(CAV) An SMT-Based Approach to Coverability Analysis
coverage metrics	(VeriSure) Quantification of Verification Progress
CP	(CSPSAT) BreakIDGlucose: on the importance of row symmetry
CP-logic	(PLP) An OpenCL implementation of a forward sampling algorithm for CP-logic
CP-nets	(PRUV) Computing k-Rank Answers with Ontological CP-Nets (PCCR) A Parameterized Complexity Analysis of Generalized CP-Nets
CPA	(LC) A descriptive set theoretical axiomatization of the Mathias model.
cps translation	(CLC) Confluence for classical logic through the distinction between values and computations
CPS-translation	(LOLA) Call-by-Value in a Basic Logic for Interaction
Craig interpolation	(CAV) Lazy Annotation Revisited (iPRA) Specification Synthesis via Generalized Abduction (iPRA) Towards Craig Interpolation for String Constraints
Craig's interpolation	(iPRA) Using Interpolation for the Verification of Security Protocols (Extended Abstract)
crash-tolerant	(FRIDA) Mechanical Verification of a Constructive Proof for FLP
crawling	(PAS) Automatic App Testing of LTL Properties
creative telescoping	(ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
Criterion~H	(WST) Kurth's Criterion H Revisited
critical pair	(IWC) Critical Pairs in Network Rewriting
critical pairs	(IWC) Confluence and Critical-Pair-Closing Systems (RTA-TLCA) Confluence by Critical Pair Analysis
critical peak	(HOR) Feebly not weakly
critically trivial	(HOR) Feebly not weakly
cross-sections of flows	(LC) Regular cross-sections of Borel flows
crowd sourcing	(FWFM) Chekofv: Crowd-sourced Formal Verification
cryptographic definitions	(CSF) Malleable Signatures: New Definitions and Delegatable Anonymous Credentials
Cryptographic protocol analysis	(CSF) Decidability for Lightweight Diffie-Hellman Protocols
cryptographic protocols	(FCS-FCC) A Hybrid Analysis for Security Protocols with State
Cryptoki	(ASA) Caetus tool
CSP	(CSPSAT) Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms (CSPSAT) BreakIDGlucose: on the importance of row symmetry (CICLOPS-WLPE) A System for Embedding Global Constraints into SAT (POS) Instance-based Selection of CSP Solvers using Short Training (ARW-DT) Using CSP Meta Variables in AI Planning
CTL	(ITP) Completeness and Decidability Results for CTL in Coq
cumulative quantification	(NLCS) Toward a Logic of Cumulative Quantification
Cumulativity	(ICLP) Properties of Stable Model Semantics Extensions
cut elimination	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents (GSB) Display-type calculi and their cut elimination metatheorem (GSB) Modular Systems for Intuitionistic Modal Logics in Nested Sequents (GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress) (IJCAR) Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (CSL-LICS) Symmetric Normalisation for Intuitionistic Logic (SD) Substructural Cut Elimination (Linearity) Cut Elimination in Multifocused Linear Logic
cut-elimination	(CLC) Confluence for classical logic through the distinction between values and computations (IFIP-WG16) Rewriting, Proofs and Transition Systems (LATD) Cut and completion? (LATD) Cut-free calculus for second-order {G\"odel} logic
cut-introduction	(IJCAR) Introducing quantified cuts in logic with equality
cutoff	(FRIDA) Model-Checking of Parameterized Timed-Systems
cutoffs	(AISS) Parameterized Model Checking of Rendezvous Systems
Cutting and Packing	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
cyber-insurance	(CSF) The Complexity of Estimating Systematic Risk in Networks
cyber-physical security protocols	(FCS-FCC) Towards Timed Models for Cyber-Physical Security Protocols
cyber-physical systems	(NSV) Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics (IJCAR) dTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid Systems
Cycle rewriting	(RTA-TLCA) Termination of Cycle Rewriting
cyclic and structural induction	(PAS) Building explicit induction schemas for cyclic induction reasoning
cyclic lambda-terms	(TermGraph) Nested Term Graphs
D
Dalvik	(WST) Non-termination of Dalvik bytecode via compilation to CLP
Danos-Regnier criterion	(SD) A Correctness Criterion Free from Switchings
data complexity	(KR) Nominal Schemas in Description Logics: Complexities Clarified
data mining ontology	(ORE) Exploring Reasoning with the DMOP Ontology
data structures	(FRIDA) Concurrent Data Structures: Semantics and (Quantitative) Relaxation (TermGraph) An Implementation Model for Interaction Nets (UNIF) Unification Modulo Common List Functions
data structures for tableaux calculi	(IJCAR) Implementing Tableaux Calculi Using BDDs: BDDTab System Description
data synchronization	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
data trees	(CSL-LICS) Pattern Logics and Auxiliary Relations
data visualization	(RCRA) Optimal Neighborhood Preserving Visualization by Maximum Satisfiability
Data-aware dynamic systems	(KR) State-Boundedness for Decidability of Verification in Data-Aware Dynamic Systems
database	(NLSR) Natural Language Access to Data
Database generation	(ORE) A Scalable Benchmark for OBDA Systems: Preliminary Report
database querying	(KR) Certain Answers as Objects and Knowledge
Database semantics	(ICLP) A Measure of Arbitrariness in Abductive Explanations
database theory	(CSL-LICS) On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase (CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
Databases	(iPRA) Interpolation and Domain Independence applied to Databases
Databases Repair	(NMR) Causality in Databases: The Diagnosis and Repair Connections
Datalog	(DL) Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner (DL) Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems (DL) Datalog Rewriting Techniques for Non-Horn Ontologies
Datalog rewritability	(DL) Datalog Rewriting Techniques for Non-Horn Ontologies
datalog rewriting	(DL) Contextualized Knowledge Repositories with Justifiable Exceptions
Datapath Abstraction	(CAV) Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction
datasets	(NMR) Towards a Benchmark of Natural Language Arguments
Datatypes	(DL) Optimised Absorption for Expressive Description Logics
datatypes à la carte	(DTP) Relational ornaments
Davies-trees	(LC) Davies-trees in infinite combinatorics
De Bruijn	(PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
de Bruijn indices	(Coq) Autosubst: Automation for de Bruijn Substitutions
de Morgan algebras	(LATD) De Morgan logics with a notion of inconsistency
de Morgan logic	(LATD) De Morgan logics with a notion of inconsistency
de Morgan negation	(LATD) De Morgan logics with a notion of inconsistency
deadlock	(CSL-LICS) Deadlock and lock freedom in the linear pi-calculus (WST) Reducing Deadlock and Livelock Freedom to Termination
Debugging	(ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs
decidability	(IJCAR) Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (LC) Finite Inseparability of Elementary Theories Based on Connection (FCS-FCC) On Well-Founded Security Protocols (ITP) Completeness and Decidability Results for CTL in Coq (CSL-LICS) Pattern Logics and Auxiliary Relations (CSL-LICS) Decidability of Weak Logics with Deterministic Transitive Closure (CSL-LICS) Axioms and Decidability for Type Isomorphism in the Presence of Sums (LATD) Decidability of order-based modal logics (LATD) Trakhtenbrot theorem and first-order axiomatic extensions of MTL (Linearity) Undecidability of Multiplicative Subexponential Logic (ADDCT) Decidability of Iteration-free PDL with Parallel Composition (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
decidability and complexity	(KR) Model Checking Unbounded Artifact-Centric Systems
Decidability results	(CSF) Decidability for Lightweight Diffie-Hellman Protocols
Decision	(SAT) Community Branching for Parallel Portfolio SAT Solvers
decision diagrams	(KR) Probabilistic Sentential Decision Diagrams
decision method	(IJCAR) Optimal tableaux-based decision procedure for testing satisfiability in the Alternating-time temporal logic ATL+
decision problems	(AISS) Unary Pushdown Automata and Straight-Line Programs
decision procedure	(CAV) Program Verification through String Rewriting (ITP) Unified Decision Procedures for Regular Expression Equivalence (SMT) Weakly Equivalent Arrays
decision procedures	(ICLP) Abstract Diagnosis for tccp using a Linear Temporal Logic (CAV) Automating Separation Logic with Trees and Data (CAV) LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes (CAV) A Nonlinear Real Arithmetic Fragment (CAV) A Tale of Two Solvers: Eager and Lazy Approaches to Bit-vectors (IJCAR) QBF Encoding of Temporal Properties and QBF-Based Verification (IJCAR) Computing All Implied Equalities via SMT-based Partition Refinement (IJCAR) A Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (SMT) Decision Procedures for Flat Array Properties (ADDCT) On dual tableau-based decision procedures for relational fragments
decision rules	(KR) Axiomatizing Rationality (ICLP) Logic Programming as Scripting Language for Bots in Computer Games
Decision trees	(PRUV) Learning Preferences for Collaboration
declarative modeling	(KR) ASP Encodings of Acyclicity Properties (CICLOPS-WLPE) Refining definitions with unknown opens using XSB for IDP3
declarative programming	(NMR) Three Semantics for Modular Systems
declarative programming language constructs	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
declarative specification	(RCRA) Declarative Specification of Benchmark Sessions via ASP
Declarative systems	(LaSh) Meta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine Development
declassification	(CAV) A Conference Management System with Verified Document Confidentiality (CSF) Stateful Declassification Policies for Event-Driven Programs
decomposition	(LATD) Recent advances in the structural description of involutive FL$_e$-chains
decomposition theorems	(CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus
decreasing diagrams	(RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams (RTA-TLCA) Confluence by Critical Pair Analysis
deduction	(WING) A Theorem Prover Backed Approach to Array Abstraction
deduction modulo	(RTA-TLCA) Cut Admissibility by Saturation
deductive compilation	(VERIFY) Introducing a Sound Deductive Compilation Approach
deductive databases	(ICLP) A Framework for Bottom-Up Simulation of SLD-Resolution (ICLP) Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
deductive program verification	(CAV) The Spirit of Ghost Code
deductive verification	(CAV) Automating Separation Logic with Trees and Data (VSTTE) Automatically verified implementation of data structures based on AVL trees (SHORT)
deep	(INFINITY) Infinitely deep languages and neighbors
Deep inference	(CSL-LICS) Equality and Fixpoints in the Calculus of Structures (CSL-LICS) Symmetric Normalisation for Intuitionistic Logic (CSL-LICS) On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
Deep relevant logics	(LC) Blocking the routes to triviality with depth relevance
default logic	(KR) First-Order Default Logic Revisited (NMR) Implementing Default and Autoepistemic Logics via the Logic of GK
default negation	(ICLP) On Strong and Default Negation in Answer-Set Program Updates (NMR) On Strong and Default Negation in Logic Program Updates
default reasoning	(LG) Game Semantics for Conditional Logic (NMR) A Plausibility Semantics for Abstract Argumentation Frameworks
defeasible inheritance	(DL) Rational closure in SHIQ
defeasible knowledge	(DL) Contextualized Knowledge Repositories with Justifiable Exceptions
defeasible logic program	(NMR) Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation
defeasible reasoning	(KR) David Poole’s Specificity Revised (DL) DIP: A Defeasible-Inference Platform for OWL Ontologies
Defectivity	(ICLP) Properties of Stable Model Semantics Extensions
definability	(LC) Definability, automorphisms and enumeration degrees (LC) Definable cardinals just beyond R / Q (LC) On the existential interpretability of structures (LC) Definability of 0' in the structure of $\omega$-enumeration degrees (ARW-DT) Second-Order Characterizations of Definientia in Formula Classes (iPRA) Application Patterns of Projection/Forgetting
definability of truth	(LATD) Definability of truth predicates in abstract algebraic logic
definable groups	(LC) Pregeometries and definable groups
Definable well-orders	(LC) Locally definable well-orders
Definition evaluation	(CICLOPS-WLPE) Refining definitions with unknown opens using XSB for IDP3
Definition refining	(CICLOPS-WLPE) Refining definitions with unknown opens using XSB for IDP3
definitional package	(ITP) Truly Modular (Co)datatypes for Isabelle/HOL (Isabelle) Primitively (Co)recursive Definitions for Isabelle/HOL
degree	(SAT) Long Proofs of (Seemingly) Simple Formulas (LC) Definability of 0' in the structure of $\omega$-enumeration degrees (PC) Narrow Proofs May Be Maximally Long (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
degree of autostability	(LC) Boolean algebras and degrees of autostability relative to strong constructivizations
degree sequences	(CSL-LICS) On Hanf-equivalence and the number of embeddings of small induced subgraphs
Degree spectra	(LC) Degree spectra of structures under $\Sigma_n$-equivalence.
degree spectra of relations	(LC) Degree spectra of relations on a cone
degree spectrum	(LC) Degree spectra of sequences of structures
degree structure	(LC) The order dimensions of degree structures
degree theory	(LC) Definability, automorphisms and enumeration degrees (LC) A DNC function that computes no effectively bi-immune set
degrees of belief	(KR) How To Progress Beliefs in Continuous Domains
degrees of truth	(LATD) A Semi-relevant, Paraconsistent Dual of {\L}ukasiewicz Logic (LATD) Ordinal foundation for Lukasiewicz semantics (LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
delay	(CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
delegatable anonymous credentials	(CSF) Malleable Signatures: New Definitions and Delegatable Anonymous Credentials
delimited control operators	(CSL-LICS) Formulae-as-Types for an Involutive Negation
Delineation semantics	(NLCS) Mereological Comparatives in Delineation Semantics
demonstration	(LC) Aristotle’s conception of demonstration and modern proof theory
Denjoy integration	(LC) A computability approach to three hierarchies
denotational semantics	(CSL-LICS) A type theory for productive coprogramming via guarded recursion (CSL-LICS) Transition systems over games (CSL-LICS) On Context Semantics for Interaction Nets (CSL-LICS) On the characterization of models of H* (FWFM) Using Esoteric Language for Teaching Formal Semantics
Densification	(LATD) Densification via polynomial extensions
density elimination	(GSB) A proof theoretic approach to standard completeness
deontic logic	(KR) Aggregative Deontic Detachment for Normative Reasoning (ARW-DT) Automated Reasoning in Deontic Logic
dependence	(KR) Belief Change and Base Dependence
dependence logic	(LC) Dependence and independence - a logical approach
dependencies	(DL) Pushing the CFDnc Envelope
Dependency graphs	(SD) A Correctness Criterion Free from Switchings
dependency pair framework	(WST) A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion
dependency parsers	(NLCS) Transfer Semantics for the Clear Parser
Dependency Schemes	(SAT) Variable Dependencies and Q-Resolution (QBF) Resolution Paths and Term Resolution
dependent elimination	(RTA-TLCA) Self Types for Dependently Typed Lambda Encodings
dependent type theory	(DTP) A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
dependent types	(DTP) Type-Directed Editing for Dependently-Typed Programs. (DTP) An Embedded Hardware Description Language using Dependent Types (DTP) Tool Demonstration: An IDE for Programming and Proving in Idris (CSL-LICS) Eilenberg-MacLane Spaces in Homotopy Type Theory (CSL-LICS) A functional functional interpretation (LFMTP) A Generic Approach to Proofs about Substitution (RTA-TLCA) Self Types for Dependently Typed Lambda Encodings
dependently typed lambda calculus	(CICLOPS-WLPE) A Lambda Prolog Based Animation of Twelf Specifications
dependently typed languaged	(DTP) Sequential decision problems and a computational theory of avoidability
Dependently-typed programming	(DTP) Scrapping Your Dependently-Typed Boilerplate is Hard (DTP) An Embedded Hardware Description Language using Dependent Types
Depth relevance	(LC) Blocking the routes to triviality with depth relevance
derivability	(PCCR) Intuitionistic modal logics: efficient fragments and parameterized complexity
Derivational complexity	(WST) On the derivational complexity of Kachinuki orderings (RTA-TLCA) Termination of Cycle Rewriting
Description logic	(KR) Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference (KR) Finite Model Reasoning in Horn Description Logics (GSB) An Intuitionisticaly based Description Logic (UNIF) Matching with respect to general concept inclusions in the Description Logic EL (DL) Shape and Content: Incorporating Domain Knowledge into Shape Analysis (DL) Understandable Explanations in Description Logic (DL) An ABox Revision Algorithm for the Description Logic EL_\bot (DL) Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies (KR4HC) Conformance Analysis of the Execution of Clinical Guidelines with Basic Medical Knowledge and Clinical Terminology
Description Logic Ontologies	(DL) Graphol: Ontology representation through diagrams
Description Logics	(KR) Exact Learning of Lightweight Description Logic Ontologies (KR) Answering Instance Queries Relaxed by Concept Similarity (KR) Minimal Change in AGM Revision for Non-classical Logics (KR) Nested Regular Path Queries in Description Logics (KR) Concept Dissimilarity with Triangle Inequality (KR) Lightweight Description Logics and Branching Time: a Troublesome Marriage (IJCAR) EL-ifying Ontologies (IJCAR) The Bayesian Description Logic BEL (IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (IJCAR) Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures (DL) Abstraction Refinement for Ontology Materialization (DL) Reasoning about Belief Uncertainty in DL-Lite N bool (DL) TBox abduction in ALC using a DL tableau (DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs (DL) Optimised Absorption for Expressive Description Logics (DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes (DL) Controlled Query Evaluation over Lightweight Ontologies (DL) Datalog Rewriting Techniques for Non-Horn Ontologies (DL) Comparing the Expressiveness of Description Logics (PRUV) Multi-Attribute Decision Making using Weighted Description Logics (PRUV) A New DL‐Lite N Bool Probabilistic Extension Using Belief (ORE) Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners (ORE) Mini-ME 2.0: powering the Semantic Web of Things (ORE) Android Went Semantic: Time for Evaluation (ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development (PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics (iPRA) Resolution Based Uniform Interpolation for Expressive Description Logics
Description Logics and Ontologies	(KR) Query Inseparability for Description Logic Knowledge Bases
descriptive complexity	(LCC) Descriptive Complexity and CSP (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
Descriptive complexity theory	(CSL-LICS) Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
Descriptive set theory	(LC) Determinacy of Refinements to the Difference Hierarchy of Co-analytic sets
Design	(PAS) Symbolic Problem Solving With Bidirectional Executable Representations
determinacy	(LC) Determinacy of Refinements to the Difference Hierarchy of Co-analytic sets (LC) Unraveling $\Sigma^0_\alpha(\Pi^1_1)$-Determinacy
deterministic transitive closure	(CSL-LICS) Decidability of Weak Logics with Deterministic Transitive Closure
determinization	(CAV) From LTL to Deterministic Automata: A Safraless Compositional Approach
Device Drivers	(CAV) Regression-free Synthesis for Concurrency
Device Enrolment	(ASA) Security APIs for Device Enrolment
diagnosis	(KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals
diagnosis discrimination	(ASPOCP) Interactive Query-based Debugging of ASP Programs (NMR) Interactive Debugging of ASP Programs
Diagnosis of Arterial Hypertension causes	(KR4HC) Training residents in the application of clinical guidelines for differential diagnosis of the most frequent causes of arterial hypertension with decision tables
Diagnostic Reasoning	(NMR) Causality in Databases: The Diagnosis and Repair Connections
Diagonalization	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
diagonally non-computable	(LC) A DNC function that computes no effectively bi-immune set
diagrams	(LC) Natural Deduction in Renaissance Geometry
Dialectic Logic	(LC) On the logical use of implicit contradictions
Dialectica translation	(CSL-LICS) A functional functional interpretation
dialog systems	(NLSR) Exposing Predictive Analytics through Natural Language Dialog
Dialogical argumentation	(NMR) Analysis of Dialogical Argumentation via Finite State Machines
dialogical logic	(LG) Game Semantics from a Cognitive Modeling Standpoint (ARQNL) Dialogues for proof search
Dialogical Proof Theory	(NMR) Abduction in Argumentation: Dialogical Proof Procedures and Instantiation
dialogical semantics	(LG) Multi-Agent Dialogical Games for Modal Logic
dialogue	(NLCS) Divergence in Dialogues (NLCS) How to do things with types
dialogue games	(ARQNL) Dialogues for proof search
Dialogue Modeling	(KR) Tracking Beliefs and Intentions in the Werewolf Game
dict	(CICLOPS-WLPE) SWI-Prolog version 7 extensions
Difference Equations	(ITP) On the Formalization of Z-Transform in HOL
Difference hierarchy	(LC) Determinacy of Refinements to the Difference Hierarchy of Co-analytic sets
differentiability	(LC) Effective genericity and differentiable functions
Differential Evolution	(RCRA) A Discrete Differential Evolution Algorithm for the Total Flowtime Flowshop Scheduling Problem
Differential fields	(LC) Differential Galois theory in the class of formally real fields.
Differential Linear Logic	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
differential power analysis	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks
Differential Privacy	(CSF) Differential Privacy: An Economic Method for Choosing Epsilon (CSF) Proving differential privacy in Hoare logic (DCM) Differential privacy at work: Verification of approximate probabilistic programs and models for choosing epsilon
Differential Temporal Dynamic Logic	(IJCAR) dTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid Systems
Differentiation	(LC) Natural deduction for intuitionistic differential linear logic
Diffie-Hellman	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System (CSF) Modeling Diffie-Hellman Derivability for Automated Analysis
Diffie-Hellman key exchange	(CSF) Decidability for Lightweight Diffie-Hellman Protocols
Diffnets	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion
Diffusion Dynamics	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
digital forensics	(CSF) Certificates for Verifiable Forensics
digital repository	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
digital revolution	(IFIP-WG16) Impacts of the Digital Revolution on two Main Activities of Scientists: Teaching and Publishing
dilation	(PRUV) Towards a Logic of Dilation
Direct style	(CSL-LICS) A functional functional interpretation
Directed Testing	(EC2) Concolic Testing of Concurrent Programs
discourse analysis	(NLCS) Analyzing and Modelling the Structure of Argument Compounds in Logic: the case of technical texts
Discrete dynamical systems	(NSV) Computational complexity of iterated maps on points and sets
Discrete Time Markov Chain	(SYNT) Program Synthesis and Linear Operator Semantics
discrimination tree	(PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
disjoint amalgamation	(INFINITY) When excellence and local finiteness collide
disjoint unions	(CSL-LICS) Axioms and Decidability for Type Isomorphism in the Presence of Sums
Disjunction Property	(LC) Some properties of Intuitionistic Set Theory with the principle UP. (LATD) The Admissible Rules of Subframe Logics
disjunctive answer set programming	(PCCR) Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond (NMR) Implementing Default and Autoepistemic Logics via the Logic of GK
Disjunctive Datalog	(DL) Datalog Rewriting Techniques for Non-Horn Ontologies
Disjunctive existential rules	(DL) Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
disjunctive logic program	(NMR) An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence
dispensability	(RCRA) Dispensable Instantiations in Constraint Satisfaction Problems
display calculi	(GSB) Display-type calculi and their cut elimination metatheorem
display type calculus	(LC) Display-type calculi for non classical logics
distance metrics	(CSL-LICS) On the Total Variation Distance of Labelled Markov Chains
Distributed Algorithm	(CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
distributed algorithms	(FRIDA) Model-Checking of Parameterized Timed-Systems (FRIDA) Model Checking Distributed Consensus Algorithms (FRIDA) Synthesizing self-stabilizing fault-tolerant algorithms (extended abstract) (FRIDA) A Logic-based Framework for Verifying Consensus Algorithms
distributed computing	(POS) Dolius: A Distributed Parallel SAT Solving Framework
Distributed Constraint Optimization Problems	(ICLP) Logic and Constraint Logic Programming for Distributed Constraint Optimization
distributed hybrid systems	(ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems
distributed programming	(ICLP) Pengines: Web Logic Programming Made Easy
distributed search	(RCRA) Self Regulating Mechanisms for Network Immunization
distributed system	(FRIDA) Round model for distributed algorithms: from verification to implementation. (LATD) Five-valued LTL for Runtime Verification
Distributed Systems	(FRIDA) Parameterized Synthesis (FRIDA) Synthesis for Resilient Distributed Systems (FRIDA) Having SPASS with Pastry and TLA+
distributed version control systems	(CAV) Regression Test Selection for Distributed Software Histories
Distributed-Algorithms	(FRIDA) Correctness and Performance Analysis of Distributed High Performance Programs in Scala
Distribution Semantics	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming
Distributional Semantics	(NLCS) A low-level treatment of quantifiers in categorical compositional distributional semantics
distributive lattice	(LATD) Embedding partially ordered sets into distributive lattices
distributivity	(LC) A descriptive set theoretical axiomatization of the Mathias model.
Diversification	(SAT) Community Branching for Parallel Portfolio SAT Solvers
divide-and-conquer	(POS) Formula partitioning revisited
DL Lite	(DL) Reasoning about Belief Uncertainty in DL-Lite N bool (PRUV) A New DL‐Lite N Bool Probabilistic Extension Using Belief
DL reasoning	(ORE) Incremental and Persistent Reasoning in FaCT++
DL-Lite	(DL) Practical query answering over Hi (DL-LiteR) knowledge bases (DL) Complexity of Temporal Query Abduction in DL-Lite (DL) Temporal OBDA with LTL and DL-Lite (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries (DL) Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics (DL) XPath for DL-Lite Ontologies (DL) Visualization and management of mappings in ontology-based data access (progress report) (DL) Instance-driven TBox Revision in DL-Lite (DL) SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment (DL) Rational Elimination of DL-Lite TBox Axioms
DL-programs	(DL) Towards Practical Deletion Repair of Inconsistent DL-programs
DL-safe rules	(DL) Complexities of Nominal Schemas
DNA computing	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach
DNA nanotechnology	(VEMDP) A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures
DNA Strand Displacement	(VEMDP) Verifying Polymer Reaction Networks using Bisimulation
DNC	(LC) A DNC function that computes no effectively bi-immune set
DNF duality	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
DNF minimization	(SAT) Fixed-parameter tractable reductions to SAT
documentation	(ACL2) Industrial-Strength Documentation for ACL2 (HOL) Modernising HOL's documentation
domain	(LATD) Semantic information and fuzziness
Domain Independence	(iPRA) Interpolation and Domain Independence applied to Databases
domain specific modeling	(FWFM) Introducing Formal Verification with Lego
domain theory	(ITP) Formalized, effective domain theory in Coq (CSL-LICS) A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Domain-specific languages	(ICLP) A Module System for Domain-Specific Languages
domains	(CSL-LICS) On the characterization of models of H* (VEMDP) A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures
Dominance	(KR) Transforming Situation Calculus Action Theories for Optimised Reasoning
Dominating Functions	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
domination	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types
Double negation shift	(LC) Predicate Glivenko theorems and substructural aspects of negative translations
Double negation translation	(GSB) On Affine Logic and Łukasiewicz Logic
downward closure	(AISS) Of stacks (of stacks (...) with blind counters) with blind counters
doxastic logic	(KR) Justified Beliefs by Justified Arguments (KR) Axioms .2 and .4 as Interaction Axioms (LC) Formalizing vagueness as a doxastic, relational concept
DPLL	(CAV) AVATAR: The New Architecture for First-Order Theorem Provers (PC) Lower bounds for splittings by linear combinations
DPLL(T)	(CAV) A Tale of Two Solvers: Eager and Lazy Approaches to Bit-vectors (CAV) A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
DQBF	(POS) iDQ: Instantiation-Based DQBF Solving
DQBF solving	(SAT) Fast DQBF Refutation
DQDIMACS	(POS) iDQ: Instantiation-Based DQBF Solving
DRed	(DL) SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
DRUP	(iPRA) Interpolation from Clausal Proofs
duality	(CLC) Dualized Type Theory (ITP) Experience Implementing a Performant Category-Theory Library in Coq (LATD) Bitopological Duality and Three-valued Logic
Dynamic Algebra	(Linearity) Geometry of Resource Interaction – A Minimalist Approach
Dynamic Analysis	(PAS) Source code profiling and classification for automated detection of logical errors
dynamic complexity	(LCC) Small Dynamic Descriptive Complexity Classes
dynamic consistency checking	(ICLP) Dynamic Consistency Checking in Goal-Directed Answer Set Programming
dynamic contexts	(LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
Dynamic Domains	(ICLP) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments
Dynamic Epistemic Logic	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
dynamic games	(LG) Forward and backward induction in dynamic games: Distilling the axiomatic differences on common ground
Dynamic information flow control	(FCS-FCC) Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
dynamic logic	(KR) A Dynamic Logic Framework for Abstract Argumentation (KR) Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments (IJCAR) dTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid Systems (LC) Dynamic logic on approximation spaces (LC) Display-type calculi for non classical logics
dynamic logics	(GSB) Display-type calculi and their cut elimination metatheorem
dynamic pattern calculus	(HOR) The dynamic pattern calculus as a higher-order pattern rewriting system
Dynamic Predicate Logic	(NLCS) Modelling implicit dynamic introduction of function symbols in mathematical texts
dynamic programming	(SAT) Solving MaxSAT and #SAT on structured CNF formulas
dynamic quantification	(NLCS) Modelling implicit dynamic introduction of function symbols in mathematical texts
Dynamic reasoning	(NMR) Nonmonotonic Reasoning as a Temporal Activity
dynamic security enforcement mechanisms	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
Dynamic systems	(ICLP) Simulating Dynamic Systems Using Linear Time Calculus Theories
dynamic techniques	(WING) Loop Invariants by Mutation, Dynamic Validation, and Static Checking
dynamical model	(LC) Truth theory for logic of self-reference statements as a quaternion structure
dynamical systems	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
E
e-Health	(KR4HC) Exploiting the Relation between Environmental Factors and Diseases: A Case Study on COPD
E-matching	(QUANTIFY) Finding Conflicting Instances of Quantified Formulas in SMT
Eager Languages	(ICLP) Guarding Corecursion in Logic Programming
Earley deduction	(ICLP) Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
Eclipse	(Coq) Coqoon: towards a modern IDE for Coq
economics	(ARW-DT) Reasoning about Auctions
economics of security	(CSF) The Complexity of Estimating Systematic Risk in Networks
editing	(DTP) Type-Directed Editing for Dependently-Typed Programs.
education	(FWFM) Introducing Formal Verification with Lego
EF Games	(LCC) First-Order Logic of Order and Metric has the Three-Variable Property
effect handling	(LOLA) Programming and Verifying with Effect Handling and Iteration
effect system	(CSL-LICS) Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
effective bi-immunity	(LC) A DNC function that computes no effectively bi-immune set
effective bounds	(LC) Effective results on the asymptotic behavior of nonexpansive iterations
effective computation	(DCM) Cellular Automata are Generic
effective reducibility	(INFINITY) Classes of structures with no intermediate isomorphism problems
effectivity properties	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Efficient protocols	(CSF) From input private to universally composable secure multiparty computation primitives
efficient refinement check in VCC	(VSTTE) Efficient Refinement Checking in VCC
EFL-ontology	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
egalitarianism	(KR) On Egalitarian Belief Merging
Ehrenfeucht-Fraisse games	(LG) Game Reductions
Ehrenfeucht-Fraïssé games	(CSL-LICS) Separating Regular Languages with First-Order Logic
EL	(UNIF) Matching with respect to general concept inclusions in the Description Logic EL (DL) Brave and Cautious Reasoning in EL (DL) Goal-Directed Tracing of Inferences in EL Ontologies (DL) An ABox Revision Algorithm for the Description Logic EL_\bot (DL) Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs (DL) Mary, What's Like All Cats? (DL) Temporalising EL Concepts with Time Intervals (DL) Certain Answers in a Rough World (ORE) Just: a Tool for Computing Justifications w.r.t. ELH Ontologies
EL TBoxes	(DL) Query Rewriting under EL TBoxes: Efficient Algorithms
Elections	(LC) Elections and knowledge
elementary algorithms	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
elementary epimorphism	(LC) Elementary epimorphisms between models of set theory
elementary equivalence	(LATD) Advances on elementary equivalence in model theory of fuzzy logics
elementary indivisibility	(LC) On various strengthenings of the notion of indivisibility
elementary interpretations	(WST) Automating Elementary Interpretations
elementary submodels	(LC) Davies-trees in infinite combinatorics
Elliptic Curves	(ITP) A Formal Library for Elliptic Curves in the Coq Proof Assistant
embedded systems	(VeriSure) Assurance and Verification of Security Properties
embedding	(LATD) Embeddings into BiFL-algebras and conservativity (CICLOPS-WLPE) A System for Embedding Global Constraints into SAT (ARQNL) Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic (HOR) The dynamic pattern calculus as a higher-order pattern rewriting system
Emil Post	(LC) C. I. Lewis' Influence on the Early Work of Emil Post
Empire	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion
empirical analysis	(KR) An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
Empirical investigation	(ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
Emptiness	(RTA-TLCA) Tree Automata with Height Constraints between Brothers
Emptiness Check for Generalized Buchi Automata	(ITP) Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm
end-extensions	(LC) The problem of a model without collection and without exponentiation
endocytosis	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
Energy games	(CAV) Minimizing Running Costs in Consumption Systems (CSL-LICS) Infinite-State Energy Games
Engineering	(CAV) Engineering a Static Verification Tool for GPU Kernels
Entropy of formal languages	(CSL-LICS) Asymptotic behaviour in temporal logic
enumeration	(LC) Definability of 0' in the structure of $\omega$-enumeration degrees (CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
enumeration degrees	(LC) Degree spectra of sequences of structures
enumeration of family	(LC) Limitwise monotonic sets of reals
enumeration operator	(LC) Uniform and non-uniform reducibilities of algebraic structures
enumeration reducibility	(LC) Definability, automorphisms and enumeration degrees
enumerators	(ACL2) Data Definitions in ACL2 Sedan
environment assumptions	(SYNT) How to Handle Assumptions in Synthesis
epidemic models	(HSB) Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
epistemic entrenchment	(LC) A Defense of Information Economy Principle
epistemic logic	(KR) A Temporal Logic of Strategic Knowledge (KR) Justified Beliefs by Justified Arguments (KR) Satisfiability of Alternating-time Temporal Epistemic Logic through Tableaux (KR) Axioms .2 and .4 as Interaction Axioms (LC) An outline of intuitionistic epistemic logic (LG) Forward and backward induction in dynamic games: Distilling the axiomatic differences on common ground
epistemic logic programs	(ASPOCP) A Refinement of the Language of Epistemic Specifications (ASPOCP) Epistemic Logic Programs with Sorts
epistemic planning	(KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals
Epistemic reasoning	(LC) Elections and knowledge
Epistemic Specification	(ICLP) ESmodels: An Epistemic Specification Solver
epistemic specifications	(ASPOCP) A Refinement of the Language of Epistemic Specifications (ASPOCP) Epistemic Logic Programs with Sorts
epistemic temporal specification	(CAV) Safraless Synthesis for Epistemic Temporal Specifications
EPR	(PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics (POS) iDQ: Instantiation-Based DQBF Solving
Epsilon	(CSF) Differential Privacy: An Economic Method for Choosing Epsilon
epsilon-recursion	(INFINITY) Cobham Recursive Set Functions
Equality	(IJCAR) Introducing quantified cuts in logic with equality (CSL-LICS) Equality and Fixpoints in the Calculus of Structures
Equality constraints	(KR) Action Theories over Generalized Databases with Equality Constraints (Extended Abstract)
equational base	(LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras
equational constraint	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving
equational logic	(IJCAR) A Rewriting Strategy to Generate Prime Implicates in Equational Logic (PAAR) A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses
equational simplification	(IJCAR) A Rewriting Strategy to Generate Prime Implicates in Equational Logic
equational translation	(LATD) Definability of truth predicates in abstract algebraic logic
Equational Unification	(UNIF) Unification Modulo Common List Functions
equationally definable	(LATD) Definability of truth predicates in abstract algebraic logic
Equationally orderable quasivarieties	(LATD) Congruential deductive systems associated with equationally orderable varieties
equations over types	(LC) Type equations and second order logic
equilibrium logic	(KR) Strong Equivalence of Non-monotonic Temporal Theories (ASPOCP) Infinitary Equilibrium Logic (ASPOCP) Temporal Stable Models are LTL-representable
Equilibrium Semantics	(KR) Generalized Multi-Context Systems
equivalence	(CSL-LICS) On the Total Variation Distance of Labelled Markov Chains (WPTE) Attractor Equivalence: An Observational Semantics for Reaction Networks (RTA-TLCA) Automatic Evaluation of Context-Free Grammars (System Description) (PAS) Programming Language Aggregation with Applications in Equivalence Checking
equivalence properties	(FCS-FCC) Protocol Indistinguishability and the Computationally Complete Symbolic Attacker
equivalence relation	(ITP) Rough Diamond: An Extension of Equivalence-based Rewriting (CSL-LICS) Logics with Counting and Equivalence
Equivalence relations	(LC) Degree spectra of structures under $\Sigma_n$-equivalence.
equivariance	(LFMTP) A Generic Approach to Proofs about Substitution
Error Explanation	(VSTTE) What Gives? A Hybrid Algorithm for Error Explanation
Error localization	(ADDCT) Finding Minimum Type Error Sources
Error-correcting codes	(Coq) Formalization of Error-correcting Codes using SSReflect
Error-tolerant reasoning	(DL) Brave and Cautious Reasoning in EL
Ershov hierarchy	(LC) Computable numberings in Ershov hierarchy
Escrowed public key	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
ESL Design	(ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview
esoteric language	(FWFM) Using Esoteric Language for Teaching Formal Semantics
Euclid's Theorem	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
evaluation	(DL) Brave and Cautious Reasoning in EL
evaluation of clinical guideline models	(KR4HC) Assessment of Clinical Guideline Models Based on Metrics for Business Process Models
Event structures	(CSL-LICS) Symmetry in Concurrent Games (CSL-LICS) Equilibria of Concurrent Games on Event Structures
Event-B	(CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
events API	(Isabelle) Using Isabelle/HOL to Develop and Maintain Separation Invariants for an Operating System (Extended Abstract)
evidence	(VeriSure) Assurance and Verification of Security Properties
exact algebra	(UNIF) From Admissibility to a New Hierarchy of Unification Types
Exact Inference	(PLP) Compiling Probabilistic Logic Programs into Sentential Decision Diagrams
Exact Learning	(KR) Exact Learning of Lightweight Description Logic Ontologies
exact real-number computation	(RTA-TLCA) Abstract datatypes for real numbers in type theory
excellence	(LC) Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes (INFINITY) When excellence and local finiteness collide
Excessiveness	(ICLP) Properties of Stable Model Semantics Extensions
Executable Formal Models	(ACL2) Development of a Translator from LLVM to ACL2
execution	(ACL2) An ACL2 Mechanization of an Axiomatic Framework for Weak Memory
execution monitoring	(CSF) Information flow monitoring as abstract interpretation for relational logic
Execution monitors	(CSF) On Dynamic Flow-sensitive Floating-Label Systems
Existence	(ICLP) Properties of Stable Model Semantics Extensions
Existence Property	(LC) Some properties related to the existence property in intermediate predicate logics
existential interpretation	(LC) On the existential interpretability of structures
existential rules	(KR) Stable Model Semantics for Guarded Existential Rules and Description Logics (KR) Polynomial Combined Rewritings for Existential Rules (ICLP) The Impact of Disjunction on Reasoning under Existential Rules (NMR) Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
existentially closed model	(LC) On Jonsson sets and some their properties.
Expected mean-payoff	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Experiment	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
experiment design	(HSB) Optimal Observation Time Points in Stochastic Chemical Kinetics
Experimental Evaluation	(KR) Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference (ORE) TROvE: a Graphical Tool to Evaluate OWL Reasoners (RCRA) Evaluating Probabilistic Model Checking Tools for Verification of Robot Control Policies (NMR) The Multi-engine ASP Solver ME-ASP: Progress Report
Experimental mathematics	(SAT) A SAT Attack on the Erdos Discrepancy Conjecture
Experimentations	(POS) Post Mortem Analysis of SAT Solver Proofs
Experiments	(ARQNL) HOL Provers for First-order Modal Logics --- Experiments
Explanations	(DL) Understandable Explanations in Description Logic (DL) Goal-Directed Tracing of Inferences in EL Ontologies
Explicit Mathematics	(LC) Reverse Mathematics, more explicitly
Explicit Substitutions	(Coq) Autosubst: Automation for de Bruijn Substitutions (CSL-LICS) Beta Reduction is Invariant, Indeed (HOR) Distilling Abstract Machines
explosion rule	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving
explosiveness	(LC) Explosiveness, Model Existence, and Incompatible Paraconsistencies
exponential integer part	(INFINITY) Computing a floor function
exponential modality	(HOPA) The modal nature of colors in higher-order model-checking
exponential time algorithm	(SAT) Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
exponentiation	(LC) The problem of a model without collection and without exponentiation
expressive completeness	(CSL-LICS) Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
Expressive Description Logics	(ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge
Expressive Ontologies	(DL) OBDA Using RL Reasoners and Repairing
expressive power	(CSL-LICS) Separating Regular Languages with First-Order Logic (CSL-LICS) Pattern Logics and Auxiliary Relations
expressive TBoxes	(DL) Hybrid Query Answering Over DL Ontologies
expressiveness	(KR) Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (DL) Comparing the Expressiveness of Description Logics (NMR) On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks
EXPSPACE	(LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
Extended Church Principle ECT and the Uniformization Principle UP	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Extended resolution	(SAT) DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (ARW-DT) Extended Resolution in Modern SAT Solving
extensional model	(RTA-TLCA) Reduction System for Extensional Lambda-mu Calculus
extensional models	(CLC) Extensional Models of Typed Lambda-mu Calculus
extensionality axiom	(Vampire) Reasoning in First-Order Theories with Extensionality
extensions of models	(LC) Model theory of bounded arithmetic and complexity theory
External Numbers	(LC) An axiomatic approach to modelling of orders of magnitude
Extraction	(NLCS) Program Extraction Applied to Monadic Parsing (PSC) Extracting Monadic Parsers from Proofs (PAS) Synthesis of Algorithms on Sets Represented as Monotone Lists
Extreme amenability	(LC) Extreme amenability of precompact expansions of countably categorical structures
F
Faceted search	(DL) On Faceted Search over Knowledge Bases
FaCT++	(ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development (ORE) Incremental and Persistent Reasoning in FaCT++
failed literal detection	(SAT) Conditional Lower Bounds for Failed Literals and Related Techniques
Failure Resilience	(FRIDA) Synthesis for Resilient Distributed Systems
Failures of the GCH	(LC) Locally definable well-orders
Fair CTL	(WST) Fairness for Infinite-State Systems
Fair Termination	(WST) Fairness for Infinite-State Systems
fairness	(WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ
Fan Functional	(LC) Reverse Mathematics, more explicitly
fast-growing complexity	(CSL-LICS) Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Fault Localization	(iPRA) Fault Localization using Interpolation
fault-tolerance	(FRIDA) Round model for distributed algorithms: from verification to implementation.
fault-tolerant computing	(VeriSure) Assurance of some system reliability characteristics in formal design verification
feasibility checks	(RCRA) A Systematic Analysis of Levels of Integration between High-Level Task Planning and Low-Level Feasibility Checks
feasible set functions	(INFINITY) Proof Theoretic Characterisations of Feasible Set Functions
feature extraction	(POS) New CNF Features and Formula Classification
feeble orthogonality	(HOR) Feebly not weakly
Feferman-Vaught	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
fibrations	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
Fiduccia-Mattheyses algorithm	(POS) Formula partitioning revisited
field theory	(LC) Coding graphs into fields
Fields	(LC) Around n-dependent fields
filter-model	(CSL-LICS) On the characterization of models of H*
filtrality	(LATD) Relatively filtral quasivarieties
Finitary matching	(PAS) Confluence of Pattern-Based Calculi with Finitary Matching
Finite and Infinite Transition Systems	(CAV) The nuXmv Symbolic Model Checker
finite automata	(CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates (CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability (LATD) A method for generalizing finite automata arising from Stone-like dualities (PAS) The Verification of Conversion Algorithms between Finite Automata
finite domain	(CSPSAT) SAT Compilation for Constraints over Finite Structured Domains
Finite Domain Solver	(CICLOPS-WLPE) Extending the Finite Domain Solver of GNU Prolog
finite inseparability	(LC) Finite Inseparability of Elementary Theories Based on Connection
Finite Lattices	(DL) Fuzzy DLs over Finite Lattices with Nominals
finite mixtures	(LC) Restricting Martin's axiom to a ccc ground model
Finite model property	(LC) Hybrid extensions of S4 with the finite model property (ITRS) A Finite Model Property for Intersection Types (LATD) Decidability of order-based modal logics (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
Finite model theory	(CSL-LICS) On Hanf-equivalence and the number of embeddings of small induced subgraphs (LATD) Trakhtenbrot theorem and first-order axiomatic extensions of MTL (LG) Non-characterizability in belief revision: an application of finite model theory
finite satisfiability	(KR) Finite Model Reasoning in Horn Description Logics
Finite satisfiability and implication algorithm	(DL) Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
finite variable fragments	(LC) Weak Beth definability property for finite variable fragments.
Finite-valued Logic	(DL) Complexity sources in FDL
Finiteness	(RTA-TLCA) Tree Automata with Height Constraints between Brothers
Firewall	(CSF) Mignis: A semantic based tool for firewall configuration
First order	(Vampire) SAT solving experiments in Vampire
first order logic	(IJCAR) Knowledge Engineering for Large Ontologies with Sigma KEE 3.0 (FCS-FCC) Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model (CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (LCC) First-Order Logic of Order and Metric has the Three-Variable Property (PLP) cProbLog: Restricting the Possible Worlds of Probabilistic Logic Programs
first order logic with majority quantifiers	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
First Order Monadic Logic	(LC) Synthesis for monadic logic over the reals
First-Degree Entailment	(LG) Game Semantics for Some Non-Classical Logics
first-order	(KR) First-Order Default Logic Revisited (LC) On the compactness theorem in many valued logics
First-order classical proof nets	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
First-order Classical Sequent Calculus	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
first-order intermediate language	(LOLA) Call-by-Value in a Basic Logic for Interaction
first-order logic	(ICLP) A Well-Founded Semantics for FOL-Programs (KR) A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (IJCAR) Finite Quantification in Hierarchic Theorem Proving (LC) A completeness theorem for general relativity (QBF) On the Relation between Resolution Calculi for QBFs and First-order Formulas (CSL-LICS) Faster decision of first-order graph properties (CSL-LICS) Separating Regular Languages with First-Order Logic (CSL-LICS) Pattern Logics and Auxiliary Relations (CSL-LICS) Logics with Counting and Equivalence (CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures (SMT) Reasoning About Set Comprehensions (IFIP-WG16) Semantically-Guided Goal-Sensitive Theorem Proving (ARQNL) Computer-oriented inference search in first-order sequent logics (PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics (NMR) FO(C) and Related Modelling Paradigms (ARW-DT) On Herbrand theorems for classical and non-classical logics (KR4HC) Using First-Order Logic to Represent Clinical Practice Guidelines and to Mitigate Adverse Interactions (VERIFY) Typed First-Order Logic (PAS) An Attempt to Formalize Popper's Logic of Scientific Discovery
First-Order Logic Model Checking	(CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets
first-order logic of discrete linear order	(KR) A Formalization of Programs in First-Order Logic with a Discrete Linear Order
first-order modal logic	(IJCAR) MleanCoP: A Connection Prover for First-Order Modal Logic (LC) Modal logic of clocks: Modalizing a first-order theory of time to get a better understanding of relativity theories (LATD) Admissible rules and almost structural completeness in some first-order modal logics
First-order modal logics	(ARQNL) HOL Provers for First-order Modal Logics --- Experiments
first-order model checking	(CSL-LICS) The Tractability Frontier of Graph-Like First-Order Query Sets
first-order predicate fuzzy logics	(LATD) Advances on elementary equivalence in model theory of fuzzy logics
First-order temporal logic	(CAV) Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
first-order term rewriting	(RTA-TLCA) First-Order Formative Rules
first-order theorem proving	(CAV) AVATAR: The New Architecture for First-Order Theorem Provers (Vampire) Reasoning in First-Order Theories with Extensionality (Vampire) Playing with AVATAR
Fisher information matrix	(HSB) Optimal Observation Time Points in Stochastic Chemical Kinetics
five-valued LTL	(LATD) Five-valued LTL for Runtime Verification
fix-sized subontologies	(DL) Evaluation of Extraction Techniques for Ontology Excerpts
fixed parameter tractability	(PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
fixed parameter tractable	(PCCR) Backdoors into Two Occurrences (PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction (PCCR) A Parameterized Complexity Analysis of Generalized CP-Nets (PCCR) Connection matrices of finite rank instead of definability in Monadic Second Order Logic
fixed point operators	(LC) Algorithmic-algebraic canonicity for mu-calculi
Fixed point theory	(TermGraph) Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse
fixed-parameter complexity	(CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus
fixed-parameter tractability	(KR) The Parameterized Complexity of Reasoning Problems Beyond NP (PCCR) Backdoors into Two Occurrences
Fixed-parameter tractable algorithms	(PCCR) A Parameterized Complexity Analysis of Generalized CP-Nets
Fixed-Points	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
Fixpoint Logic	(LCC) Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic
Fixpoints	(IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (CSL-LICS) Equality and Fixpoints in the Calculus of Structures
FL-algebras	(LATD) The lattice of varieties generated by small residuated lattices
FL_0	(DL) Gödel FL_0 with Greatest Fixed-Point Semantics
Flattening	(ICLP) Grounding Bound Founded Answer Set Programs
FLew-algebra	(LATD) On satisfiability of terms in FLew-algebras
floating point	(CAV) Verifying Relative Error Bounds using Symbolic Simulation
Floating-label systems	(CSF) On Dynamic Flow-sensitive Floating-Label Systems
Floating-point arithmetic	(NSV) Transformation of a PID Controller for Numerical Accuracy (IJCAR) Approximations for Model Construction
floor function	(INFINITY) Computing a floor function
Flow-sensitive references	(CSF) On Dynamic Flow-sensitive Floating-Label Systems
flow-table	(FRIDA) Models and techniques for verification of Software Defined Networks
Floyd-Hoare logic	(CAV) Termination Analysis by Learning Terminating Programs
FLP	(FRIDA) Mechanical Verification of a Constructive Proof for FLP
flux balance analysis	(HSB) Bayesian Design for Whole Cell Synthetic Biology Models
fMV-algebra	(LATD) MV-algebras with product and the Pierce-Birkhoff conjecture
FO(.)	(LaSh) Meta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine Development
focalisation	(CSL-LICS) Formulae-as-Types for an Involutive Negation
Focus Groups	(UITP) How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers (ARW-DT) Towards Evaluating the Usability of Interactive Theorem Provers
focused derivations	(IJCAR) A Focused Sequent Calculus for Higher-Order Logic
Focusing	(Linearity) Cut Elimination in Multifocused Linear Logic
focusing proofs	(RTA-TLCA) Construction of retractile proof structures (RTA-TLCA) Implicational Relevance Logic is 2-ExpTime-Complete
fodot	(ICLP) Model Revision Inference for Extensions of First Order Logic
forcing	(LC) Forcing with finite conditions and preserving CH (LC) Computability in generic extensions (LC) A generalization of Solovay's Sigma-construction with application to intermediate models (LC) Locally definable well-orders (LC) Cardinal invariants and template iterations
Forcing axioms	(LC) Large cardinals, forcing axioms, and the theory of subsets of \omega_1
Forgetting	(KR) Toward a Knowledge Level Analysis of Forgetting (IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes (PRUV) Towards a Logic of Dilation (NMR) An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence (ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge (iPRA) Resolution Based Uniform Interpolation for Expressive Description Logics (iPRA) Application Patterns of Projection/Forgetting
Forgetting in Reasoning about Actions	(KR) Forgetting in Action
Forgetting in the Situation Calculus	(KR) Forgetting in Action
Forgetting/projection/uniform interpolation	(ARW-DT) Second-Order Characterizations of Definientia in Formula Classes
Forking	(LC) Indiscernible extraction and Morley sequences
formal fuzzy logic	(PRUV) In Which Sense Is Fuzzy Logic a Logic for Vagueness?
formal mathematics	(NLCS) Modelling implicit dynamic introduction of function symbols in mathematical texts (PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5
Formal Metatheory	(LFMTP) Gentle Formalisation of Stoughton’s Lambda Calculus Substitution
formal methods	(NSV) Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics (FRIDA) On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering (FRIDA) Synthesis for Resilient Distributed Systems (CAV) Software Verification in the Google App-Engine Cloud (VeriSure) Implicit Assumptions in a Model for Separation Kernels (VSTTE) A Model for Capturing and Replaying Proof Strategies (CSF) Mignis: A semantic based tool for firewall configuration (CSF) Provably Sound Browser-Based Enforcement of Web Session Integrity (FWFM) Towards the Application of Formal Methods in Process Engineering (FWFM) Fun With Formal Methods 2014: Opening Remarks (FWFM) Introducing Formal Verification with Lego (FWFM) An Example Demonstrating the Requirement of Fully Formal Verification Method (ARW-DT) Reasoning about Auctions (PAS) Programming Language Aggregation with Applications in Equivalence Checking
formal model	(FRIDA) Models and techniques for verification of Software Defined Networks
Formal models	(LC) Modelling Inference in Fiction
Formal semantics	(ITP) Formal C semantics: CompCert and the C standard (FWFM) Using Esoteric Language for Teaching Formal Semantics
formal specification	(VSTTE) Efficient Refinement Checking in VCC (PAS) Symbolic Problem Solving With Bidirectional Executable Representations
Formal verification	(FRIDA) A Logic-based Framework for Verifying Consensus Algorithms (CAV) MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications (CAV) Verifying Relative Error Bounds using Symbolic Simulation (VeriSure) Assurance and Verification of Security Properties (IJCAR) Visibly Linear Temporal Logic (DTP) An Embedded Hardware Description Language using Dependent Types (VSTTE) A Verification Condition Visualizer (FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper) (CSL-LICS) Local Temporal Reasoning (ACL2) Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis (ACL2) Industrial-Strength Documentation for ACL2 (VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach (CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems (CSF) A Sound Abstraction of the Parsing Problem (Isabelle) A Simpl Shortest Path Checker Verification (ARW-DT) Automating Regression Verification (iPRA) Using Interpolation for the Verification of Security Protocols (Extended Abstract)
formal verification of OS	(PAS) VTOS: A Finite State Machine Model of OS and Formalized Verification of Its Microkernel
Formalisation	(LFMTP) Some constructions on ω-groupoids
formalisation of clinical guidelines	(KR4HC) Assessment of Clinical Guideline Models Based on Metrics for Business Process Models
formalisms	(HOR) Experience with Higher Order Rewriting from the Compiler Teaching Trenches
formalization	(KR) Dynamic Causal Calculus (PC) Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic (DTP) Sequential decision problems and a computational theory of avoidability (VPT) Formal Replay of Translation Validation for Highly Optimised C
Formalization of Language Semantics	(VSTTE) Formalizing Semantics with an Automatic Program Verifier
Formalization of mathematics	(ITP) A Coq Formalization of Finitely Presented Modules
formalization of medical processes and knowledge-based health-care models	(KR4HC) META-GLARE: a meta-system for defining your own CIG system: Architecture and Acquisition
formalized mathematics	(CSL-LICS) Eilenberg-MacLane Spaces in Homotopy Type Theory
ForMaRE	(ACL2) On Vickrey's Theorem and the Use of ACL2 for Formal Reasoning in Economics
Formats	(Vampire) Proofs in Vampire
Forms of agitation	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
formula	(LC) Computable structure theory and formulas of special forms
formula trimming	(SAT) DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
formulae-as-types	(CSL-LICS) Formulae-as-Types for an Involutive Negation
formulas with two occurrences	(PCCR) Backdoors into Two Occurrences
forward induction	(LG) Forward and backward induction in dynamic games: Distilling the axiomatic differences on common ground
forwarding rule	(FRIDA) Models and techniques for verification of Software Defined Networks
foundations	(LFMTP) Proof-Theoretic Foundations of Indexing in Logic Programming
Foundations of Logic	(LC) C. I. Lewis' Influence on the Early Work of Emil Post
Foundations of Mathematics	(LC) Computational reverse mathematics and foundational analysis (LATD) Truth degrees in the interval [-1,1] for the librationist system $\pounds$.
Fractal Dimension	(IJCAR) The Fractal Dimension of SAT Formulas
fractals	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
Fragments of arithmetic	(LC) On local induction schemes
fragments of MA	(LC) Restricting Martin's axiom to a ccc ground model
Fragments of Propositional Logic	(NMR) Belief merging within fragments of propositional logic
Fraisse limits	(LC) (LC) Computability in generic extensions
framework	(POS) Dolius: A Distributed Parallel SAT Solving Framework
Framing	(VSTTE) A logical analysis of framing for specifications with pure method calls
Frege	(LC) Frege on mathematical progress
Frege proofs	(SAT) Proof complexity and the Lovasz-Kneser Theorem
Frege systems	(PC) Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets
full abstraction	(CSL-LICS) On the characterization of models of H*
full intuitionistic linear logic	(LC) An intuitive semantics for {Full Intuitionistic Linear Logic}
Full trees	(ITP) Balancing lists: a proof pearl
fully invertible and injective programs	(FWFM) Algebraic description of restricted programming and elements of its logics
fun	(FWFM) Introducing Formal Verification with Lego
Function combinators	(CSL-LICS) Regular Combinators for String Transformations
function fields	(LC) Generalizations of Hilbert's Tenth Problem
function introduction	(NLCS) Modelling implicit dynamic introduction of function symbols in mathematical texts
functional dependencies	(DL) Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
Functional instantiation	(ACL2) Polymorphic Types In ACL2
functional notation	(CICLOPS-WLPE) SWI-Prolog version 7 extensions
functional programming	(EC2) Group Communication Patterns for High Performance Computing in Scala (DTP) On a style of presentation of type systems (DTP) Domain Specific Languages of Mathematics (ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction (Isabelle) Programming TLS in Isabelle/HOL (ASA) Well-typed generic smart-fuzzing for APIs (ARW-DT) Reasoning about Auctions
Functional reactive programming	(CSL-LICS) Functional Reactive Types
functional roles	(DL) Pushing the CFDnc Envelope
functor	(INFINITY) Functors in Computable Model Theory
Fundamental Sequences	(LC) Ordinal Notations and Fundamental Sequences in Caucal Hierarchy
fuzzy	(LC) Formalizing vagueness as a doxastic, relational concept
Fuzzy Description Logic	(DL) Complexity sources in FDL
Fuzzy Description Logics	(KR) Decidable Gödel Description Logics without the Finitely-Valued Model Property (DL) Fuzzy DLs over Finite Lattices with Nominals (DL) A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB (DL) Gödel Description Logics with General Models (DL) Gödel FL_0 with Greatest Fixed-Point Semantics
fuzzy likelihood	(LATD) Qualified Syllogisms with Fuzzy Predicates
fuzzy logic	(PRUV) Stable Models of Fuzzy Propositional Formulas (PRUV) Many-valued Horn Logic is Hard (LATD) Coupling games for Lukasiewicz logic (LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox (LATD) An application of distance-based approximate reasoning for diagnostic questionnaires in healthcare (PAS) Source code profiling and classification for automated detection of logical errors
Fuzzy logic for medical knowledge	(KR4HC) A Logic-Based Framework for Medical Assessment Questionnaires
fuzzy logics	(LATD) A Semi-relevant, Paraconsistent Dual of {\L}ukasiewicz Logic
Fuzzy modal logic	(LATD) Axiomatising a fuzzy modal logic over the standard product algebra
Fuzzy Ontologies	(DL) A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB
fuzzy plurivaluationism	(PRUV) In Which Sense Is Fuzzy Logic a Logic for Vagueness?
fuzzy probability	(LATD) Qualified Syllogisms with Fuzzy Predicates
fuzzy quantification	(LATD) Qualified Syllogisms with Fuzzy Predicates
fuzzy usuality	(LATD) Qualified Syllogisms with Fuzzy Predicates
G
gain function	(FCS-FCC) Adversary Gain vs. Defender Loss in Quantified Information Flow
Gale-Stewart games	(CSL-LICS) Infinite sequential games with real-valued payoffs
Gallina	(Coq) Presentation of Three Neat Tricks in Coq 8.5
Galois theory	(LC) Differential Galois theory in the class of formally real fields.
Galoius Types	(LC) Computing the number of types of infinite tuples
game characterisations	(SAT) Unified characterisations of resolution hardness measures
Game Semantics	(LOLA) Tensorial logic with algebraic effects (CLC) Infinitary Classical Logic: Recursive Equations and Interactive Semantics (CSL-LICS) Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees (CSL-LICS) Transition systems over games (CSL-LICS) Equilibria of Concurrent Games on Event Structures (LG) Game Semantics for Some Non-Classical Logics (LG) Game Semantics from a Cognitive Modeling Standpoint (LG) Game Semantics for Conditional Logic
game theories	(LG) Multi-Agent Dialogical Games for Modal Logic
Game theory	(KR) ∃GUARANTEENASH for Boolean Games Is NEXP-Hard (LC) A Defense of Information Economy Principle
game-theoretical semantics	(LC) Nash equilibrium semantics for Independence-Friendly Logic
Games	(CAV) Safraless Synthesis for Epistemic Temporal Specifications (CAV) CEGAR for Qualitative Analysis of Probabilistic Systems (LC) The DNA of logic and games. (CSL-LICS) The Complexity of Admissibility in Omega-Regular Games (CSL-LICS) Symmetry in Concurrent Games
games in logic	(LC) Dependence and independence - a logical approach
Games on graphs	(CSL-LICS) Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives (LG) Game Reductions
Games on Networks	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
gamification	(FWFM) Chekofv: Crowd-sourced Formal Verification
Gappiness	(LC) Adding a Conditional to Kripke's Theory of Truth
Gathering	(FRIDA) On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering
gene expression	(HSB) Bayesian Design for Whole Cell Synthetic Biology Models
gene regulatory network	(HSB) Modeling and analysis of qualitative behavior of gene regulatory networks
General logic	(LC) Fuzzy Bsimulation for Standard Godel Modal Logic
General Models	(DL) Gödel Description Logics with General Models
general relativity	(LC) A completeness theorem for general relativity
General resolution	(ARW-DT) Extended Resolution in Modern SAT Solving
General safe recursion	(TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion
general stable models	(ASPOCP) Temporal Stable Models are LTL-representable
general theory of stable models	(KR) Stable Models of Multi-Valued Formulas: Partial vs. Total Functions
generalised entropy measurements	(CSF) Additive and multiplicative notions of leakage, and their capacities
Generalization of nominal terms-in-context	(UNIF) Nominal Anti-Unification
generalized computability	(LC) Dynamic logic on approximation spaces
Generalized Craig interpolation	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
Generalized databases	(KR) Action Theories over Generalized Databases with Equality Constraints (Extended Abstract)
Generalized Hypertree Decomposition	(RCRA) A compression algorithm to improve generalized hypertree decomposition-based solving approaches for large extensional non binary CSP
generalized predicativity	(INFINITY) Systems of Strength H(1)
Generalized Quantifiers	(NLCS) A low-level treatment of quantifiers in categorical compositional distributional semantics
generalized rational grading	(LC) Complexity of generalized grading with inverse relations and intersection of relations
generalized truth value	(LC) Two Formalisms for a Logic of Generalized Truth Values
generating functions	(INFINITY) Analytic combinatorics of the transfinite
generic	(UITP) A Logic-Independent IDE
generic extensions	(LC) A generalization of Solovay's Sigma-construction with application to intermediate models
generic programming	(DTP) Sequential decision problems and a computational theory of avoidability (DTP) Scrapping Your Dependently-Typed Boilerplate is Hard (LFMTP) A Generic Approach to Proofs about Substitution
genericity	(LC) Effective genericity and differentiable functions
Genetic algorithms	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
genetic gates	(VEMDP) Modeling and Analysis of Genetic Boolean Gates Using the Infobiotics Workbench
Gentzen	(SD) First-order Proofs Without Syntax: Summary of Work in Progress
Gentzen's sharpened Hauptsatz	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
geometric	(HOR) Feebly not weakly
geometric logic	(PAAR) Razor: Provenance and Exploration in Model-Finding
geometry	(IJCAR) Otter proofs of theorems in Tarskian geometry
Geometry of Interaction	(LOLA) Compiling Effectful Terms to Transducers: Prototype Implementation of Memoryful Geometry of Interaction (CSL-LICS) The Geometry of Synchronization (CSL-LICS) Memoryful Geometry of Interaction: From Coalgebraic Components to Algebraic Effects (Linearity) Wave-Style Token Machines and Quantum Lambda Calculi (Linearity) Geometry of Resource Interaction – A Minimalist Approach (RTA-TLCA) Unification and Logarithmic Space
germinal ideal	(LATD) Classification of germinal MV-algebras
ghost code	(CAV) The Spirit of Ghost Code
git	(CAV) Regression Test Selection for Distributed Software Histories
GLEE	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
GLIF	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
Glivenko's theorem	(LC) An Intuitionistic Interpretation of Classical Implication
Glivenko’s theorem	(LC) Predicate Glivenko theorems and substructural aspects of negative translations
global assumptions	(IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description)
global caching	(IJCAR) A History-Based Theorem Prover for Intuitionistic Propositional Logic using Global Caching: IntHistGC System Description (IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description)
Global Constraints	(CICLOPS-WLPE) A System for Embedding Global Constraints into SAT
Global Optimisation	(SYNT) Program Synthesis and Linear Operator Semantics
global sensitivity analysis	(HSB) RKappa: Statistical sampling suite for Kappa models.
Glucose	(CSPSAT) BreakIDGlucose: on the importance of row symmetry
goal-directed	(ICLP) Dynamic Consistency Checking in Goal-Directed Answer Set Programming
Godel logic	(LATD) A method for generalizing finite automata arising from Stone-like dualities
Godel negative translation	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Goedel T-norm	(DL) Gödel FL_0 with Greatest Fixed-Point Semantics
Golog	(KR) A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations
GPGPU programming	(PLP) An OpenCL implementation of a forward sampling algorithm for CP-logic
GPGPUs	(ParSearchOpt) Towards a complete constraint solver on GPU
GPU	(CAV) Engineering a Static Verification Tool for GPU Kernels
GPUs	(WST) Automatic Termination Analysis for GPU Kernels
GR(1) synthesis	(SYNT) Low-effort Specification Debugging and Analysis
graded modal logic	(LC) Complexity of generalized grading with inverse relations and intersection of relations
Graded theories	(RTA-TLCA) Local stores in string diagrams
grammars	(RTA-TLCA) Automatic Evaluation of Context-Free Grammars (System Description)
graph algorithms	(CSL-LICS) Faster decision of first-order graph properties (PCCR) Connection matrices of finite rank instead of definability in Monadic Second Order Logic
Graph calculi	(LC) On graph calculus approach to modalities
graph decomposition	(CAV) GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
graph property	(RCRA) Latin Squares with Graph Properties
graph rewriting	(TermGraph) Needed Computations Shortcutting Needed Steps (CSL-LICS) On Context Semantics for Interaction Nets (RTA-TLCA) Construction of retractile proof structures
Graph structured data	(DL) Planning Problems for Graph Structured Data in Description Logics
graph theory	(CSL-LICS) On Hanf-equivalence and the number of embeddings of small induced subgraphs (CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (CSL-LICS) One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries (Isabelle) A Simpl Shortest Path Checker Verification
graph-based formulas	(LC) The relation between the graphs structures and proof complexity of corresponding Tseitin graph tautologies
graphical specification patterns	(VeriSure) A Graphical Notation for Probabilistic Specifications
Graphical user interface	(UITP) Tinker, tailor, solver, proof
graphics processing units	(CAV) GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
Graphs	(ICLP) A Linear Logic Programming Language for Concurrent Programming over Graph Structures (SD) A Correctness Criterion Free from Switchings
Ground Tree Rewrite Systems	(CSL-LICS) Senescent Ground Tree Rewrite Systems
Grounded Equilibrium Semantics	(KR) Generalized Multi-Context Systems
grounded Martin's axiom	(LC) Restricting Martin's axiom to a ccc ground model
Grounding	(ICLP) Grounding Bound Founded Answer Set Programs
Grounding bottleneck	(ICLP) Bound Founded Answer Set Programming
GSOS	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
Guarded fragment	(LC) On Uniform Interpolation for the Guarded Fragment (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
guarded logics	(CSL-LICS) Effective Interpolation and Preservation in Guarded Logics
Guarded recursion	(CSL-LICS) A type theory for productive coprogramming via guarded recursion (RTA-TLCA) A Model of Countable Nondeterminism in Guarded Type Theory
Guardedness	(ICLP) Guarding Corecursion in Logic Programming (DL) Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs
Guards	(ACL2) ACL2(ml): Machine-Learning for ACL2
Guideline representation	(KR4HC) An Algorithm for Guideline Transformation: from BPMN to PROforma
guideline transformation	(KR4HC) An Algorithm for Guideline Transformation: from BPMN to PROforma
Guillotine Constraint	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
Gödel 3-valued logic	(LC) A Routley-Meyer semantics for Göodel 3-valued logic G3
Gödel logics	(LATD) Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences (LATD) Decidability of order-based modal logics
Gödel Semantics	(KR) Decidable Gödel Description Logics without the Finitely-Valued Model Property
Gödel t-norm	(DL) Gödel Description Logics with General Models
Gödel's incompleteness theorem	(Isabelle) Proving Gödel’s Incompleteness Theorems
H
Hallden completeness	(LC) On Hallden complete modal logics determined by homogeneous frames
Hamiltonian Cycle Problem	(POS) Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
Hanf-locality	(CSL-LICS) On Hanf-equivalence and the number of embeddings of small induced subgraphs
hard constraint	(SAT) Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
hard SAT instances	(SAT) Long Proofs of (Seemingly) Simple Formulas
hard subsets	(DL) An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
hardness	(SAT) Unified characterisations of resolution hardness measures
hardness results	(SAT) Fixed-parameter tractable reductions to SAT
hardware	(CAV) Verifying Relative Error Bounds using Symbolic Simulation
Hardware design	(DTP) An Embedded Hardware Description Language using Dependent Types
hardware verification	(ACL2) Modeling Algorithms in SystemC and ACL2
Hash Tries	(ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling
hashing	(RTA-TLCA) Automatic Evaluation of Context-Free Grammars (System Description)
Haskell	(IJCAR) Proving Termination of Programs Automatically with AProVE (CSPSAT) SAT Compilation for Constraints over Finite Structured Domains (CSF) On Dynamic Flow-sensitive Floating-Label Systems (Linearity) Type Classes for Lightweight Substructural Types
HCV	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
Health Care	(KR4HC) Real Rules, Real Data -- Addressing Challenges of Reasoning HIPAA Privacy Rule in Health Information Exchange (HIE)
health histories	(KR4HC) Towards Linked Vital Registration Data for Reconstituting Families and Creating Longitudinal Health Histories
healthcare	(LATD) An application of distance-based approximate reasoning for diagnostic questionnaires in healthcare
heap structures	(CAV) Automating Separation Logic with Trees and Data
Henkin Quantifier	(CLC) Relative Computability and Uniform Continuity of Non-Extensional (aka Multivalued) 'Functions'
Henkin's proof	(PSC) Computing with Gödel’s completeness theorem
Herbrand functions	(QBF) Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs
Herbrand model	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving
Herbrand Sequent	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents
Herbrand theorem	(ARW-DT) On Herbrand theorems for classical and non-classical logics
Herbrand's theorem	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
Hereditarily finite superstructure	(LC) Uniformization in the hereditarily finite list superstructure over the real exponential field
HermiT	(ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development
Heuristics	(LaSh) Logical Machinery of Heuristics (Preliminary Report) (RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem (ARW-DT) Using CSP Meta Variables in AI Planning
Heyting algebra	(LATD) Interpreting Lukasiewicz logic into Intuitionistic logic
Heyting Algebra Expansions	(CLC) Negative Translations and Heyting Algebra Expansions
Heyting Arithmetic	(CLC) A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle
Heyting's logic	(LC) An Intuitionistic Interpretation of Classical Implication
hidden features	(HOL) HOL4 Hidden Features
hierarchical planning	(ASPOCP) Applying Action Language BC with Hierarchical Domain Abstraction to Mobile Robots
Hierarchized linked implementation	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
hierarchy of norms	(LC) A new lower bound for the length of the hierarchy of norms
high assurance	(VeriSure) Assurance and Verification of Security Properties
High Level Synthesis	(ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview (ACL2) Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis
High School Timetabling	(LaSh) Modeling High School Timetabling as PartialWeighted maxSAT
high-performance computing	(EC2) Group Communication Patterns for High Performance Computing in Scala
Higher dimensional structures	(LFMTP) Some constructions on ω-groupoids
Higher Order Logic	(ARQNL) Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
Higher Order Program Analysis	(HOPA) Environment Unrolling (HOPA) Strong Function Call
higher-dimensional rewriting	(IWC) Confluence of linear rewriting and homology of algebras
higher-order	(ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs (HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract) (VPT) Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem (ARW-DT) The Leo-III Project
Higher-order automated theorem provers	(ARQNL) HOL Provers for First-order Modal Logics --- Experiments
Higher-order description logics	(DL) Practical query answering over Hi (DL-LiteR) knowledge bases (DL) Typed Higher-Order Variant of SROIQ - Why Not?
higher-order logic	(IJCAR) A Focused Sequent Calculus for Higher-Order Logic (VSTTE) Formalizing Semantics with an Automatic Program Verifier (ITP) Cardinals in Isabelle/HOL (ITP) On the Formalization of Z-Transform in HOL (ITP) Truly Modular (Co)datatypes for Isabelle/HOL (LCC) Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic (PSC) Program extraction in Church's simple theory of types (invited talk) (Isabelle) Primitively (Co)recursive Definitions for Isabelle/HOL (LATD) Church-style type theories over finitary weakly implicative logics
higher-order logic programming	(ICLP) Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation (KR) Constructive Negation in Extensional Higher-Order Logic Programming
higher-order model checking	(CSL-LICS) Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees
higher-order model-checking	(ITRS) Indexed linear logic and higher-order model checking
Higher-order pattern unification	(Coq) Towards a better-behaved unification algorithm for Coq
higher-order pi-calculus	(CSL-LICS) On the Discriminating Power of Passivation and Higher-Order Interaction
Higher-order programs	(CSL-LICS) Local Temporal Reasoning
higher-order recursion schemes	(ITRS) Indexed linear logic and higher-order model checking
higher-order rewrite systems	(TermGraph) Nested Term Graphs
higher-order term graphs	(TermGraph) Nested Term Graphs
higher-order term rewriting	(RTA-TLCA) First-Order Formative Rules
higher-order unification	(UNIF) A Categorical Perspective on Pattern Unification (Extended Abstract)
hilbert	(LC) The Birth of Semantic Entailment
Hilbert axiomatisation	(ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
Hilbert axiomatizations	(ITP) Completeness and Decidability Results for CTL in Coq
Hilbert Axioms	(IJCAR) Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
Hilbert systems	(GSB) Comparing Sequent Calculi via Hilbert-style Axioms
Hilbert's Tenth Problem	(LC) Generalizations of Hilbert's Tenth Problem
History of Logic	(LC) C. I. Lewis' Influence on the Early Work of Emil Post
HIV	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
Hoare assertions	(NLCS) Grice, Hoare and Nash: some comments on conversational implicature
Hoare logic	(VSTTE) What Gives? A Hybrid Algorithm for Error Explanation (CSL-LICS) On the Hoare Theory of Monadic Recursion Schemes (CSF) Proving differential privacy in Hoare logic
Hoare's logic	(LC) Completeness of second-order separation logic for program verification
HOAS	(LFMTP) Internal Adequacy of Bookkeeping in Coq
HOL	(ITP) HOL with Definitions: Semantics, Soundness, and a Verified Implementation (ITP) HOL Constant Definitions Done Right (HOL) Modernising HOL's documentation (HOL) Writing proof automation for HOL4 (Isabelle) From Types to Sets in Isabelle/HOL
HOL Light	(ITP) Implicational Rewriting Tactics in HOL (ITP) On the Formalization of Z-Transform in HOL (ITP) Formal Verification of Optical Quantum Flip Gate
HOL4	(ITP) Implicational Rewriting Tactics in HOL (HOL) HOL4 Hidden Features (HOL) New Styles of Proof (PAAR) Beagle as a HOL4 external ATP method
HOL4 for non-computer science community	(HOL) Using HOL4 to Formalize Physical Systems
homogeneous frames	(LC) On Hallden complete modal logics determined by homogeneous frames
homogeneous models	(LC)
homogeneous structures	(LC) An ordinal rank characterising when Forth suffices (LC) On various strengthenings of the notion of indivisibility
Homological algebra	(ITP) A Coq Formalization of Finitely Presented Modules
homomorphism preservation in the finite	(CSL-LICS) Pattern Logics and Auxiliary Relations
homomorphisms	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
homotopy	(CSL-LICS) Symmetry in Concurrent Games
homotopy type theory	(ITP) Experience Implementing a Performant Category-Theory Library in Coq (CSL-LICS) Eilenberg-MacLane Spaces in Homotopy Type Theory (LFMTP) Some constructions on ω-groupoids
honest elementary degrees	(LC) Every non-zero honest elementary degree has the cupping property
hoops	(LATD) On Pocrims and Hoops
horn	(CAV) SMT-based Model Checking for Recursive Programs
Horn logic	(KR) Minimal Change in AGM Revision for Non-classical Logics
Horn theories	(PRUV) Many-valued Horn Logic is Hard
HPC	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
Hrushovski construction	(LC) Reducts of simple (non-collapsed) Fraisse-Hrushovski constructions
HS-posets	(LATD) The lattice of varieties generated by small residuated lattices
html	(HOL) Modernising HOL's documentation
Human Behavior	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
Human Factors	(STAST) The Social Engineering Personality Framework
Human Reasoning	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect (ARW-DT) Automated Reasoning in Deontic Logic
Human-computer interaction	(VeriSure) Human-Computer Interaction and the Formal Certification and Assurance of Medical Devices: The CHI+MED Project
hybrid algorithm	(RCRA) Neighbourhood SAC for Preprocessing and Search
hybrid automata	(CAV) Verifying LTL properties of hybrid systems with K-liveness (ARW-DT) Modular Verification of Interconnected Families of Uniform Linear Hybrid Automata
Hybrid Logic	(LC) Hybrid extensions of S4 with the finite model property (ARQNL) Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
Hybrid Logics	(LFMTP) Hybrid Extensions in a Logical Framework
hybrid spatial-nonspatial simulations	(HSB) Integration of rule-based models and compartmental models of neurons
hybrid stochastic simulation	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
hybrid stochastic simulations	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
hybrid stochastic-deterministic simulations	(HSB) Integration of rule-based models and compartmental models of neurons
hybrid system modelling	(HSB) Modeling and analysis of qualitative behavior of gene regulatory networks
hybrid system models	(HSB) Modeling and analysis of qualitative behavior of gene regulatory networks
hybrid systems	(NSV) Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics (CAV) Invariant verification of nonlinear hybrid automata networks of cardiac cells (IJCAR) dTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid Systems (HSB) Exploiting the eigenstructures of linear systems to speed up reachability computation
Hyper-Ackermannian complexity	(CSL-LICS) Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
hyperarithmetic hierarchy	(LC) A computability approach to three hierarchies
hyperarithmetical hierarchy	(LC) The $ \Delta^{0}_{\alpha} $-dimension of computable structures
hypergraph	(DL) Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
Hypergraph decomposition	(SAT) Hypergraph Acyclicity and Propositional Model Counting
hypergraph duality	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
hypergraph partitioning	(POS) Formula partitioning revisited
Hypergraph transversals	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Hypergraphs	(DL) Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition (DCM) Interactive Particle Systems and Random Walks on Hypergraphs
Hypersequent Calculi	(IJCAR) Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
hypersequents	(GSB) A proof theoretic approach to standard completeness (GSB) Comparing Sequent Calculi via Hilbert-style Axioms (LATD) Cut-free calculus for second-order {G\"odel} logic
Hyprgraphs	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
I
ic3	(CAV) Interpolating Property Directed Reachability (CAV) SMT-based Model Checking for Recursive Programs
IC3/PDR	(CAV) Property-Directed Shape Analysis
IDE	(Coq) Coqoon: towards a modern IDE for Coq (DTP) Tool Demonstration: An IDE for Programming and Proving in Idris
Ideal	(LC) Ideals without minimal numberings in the Rogers semilattice
ideals	(LC) Co-analytic ideals on $\omega$
Idempotent Semiring	(LATD) Densification via polynomial extensions
identification constraints	(DL) Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
Identification of proofs	(GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress)
identity	(KR) Rough Set Semantics for Identity on the Web (LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras
IDP	(LaSh) Meta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine Development (ICLP) Model Revision Inference for Extensions of First Order Logic
IDP3	(CICLOPS-WLPE) Refining definitions with unknown opens using XSB for IDP3
IEEE standard	(NSV) SetBased Decorated Intervals
IF logic	(LC) Nash equilibrium semantics for Independence-Friendly Logic
Immunization strategy	(RCRA) Self Regulating Mechanisms for Network Immunization
Imperative Program	(PAS) Symbolic Problem Solving With Bidirectional Executable Representations
imperfect information	(CAV) Safraless Synthesis for Epistemic Temporal Specifications
Implementation	(ICLP) Tabling, Rational Terms, and Coinduction Finally Together! (ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling (ICLP) Logic and Constraint Logic Programming for Distributed Constraint Optimization (CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs (CICLOPS-WLPE) Extending the Finite Domain Solver of GNU Prolog (CICLOPS-WLPE) A Portable Prolog Predicate for Printing Rational Terms (NMR) Implementing Default and Autoepistemic Logics via the Logic of GK
Implementation and Optimisation Techniques	(IJCAR) Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures
Implementation of dialogical argumentation	(NMR) Analysis of Dialogical Argumentation via Finite State Machines
Implementation Techniques	(SAT) Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses
implicant minimization	(SAT) Fixed-parameter tractable reductions to SAT
implication fragments of substructural logics	(GSB) Link formulas in implication fragments of substructural logics
implicative fragment	(LC) An Intuitionistic Interpretation of Classical Implication
Implicature	(NLCS) Grice, Hoare and Nash: some comments on conversational implicature
implicit commitment	(LC) Reflection, Trust, Entitlement (LC) Justifying proof-theoretic reflection principles
Implicit Complexity	(RTA-TLCA) Unification and Logarithmic Space
implicit computational complexity	(CLC) Stratified Nested Linear Logic (FCS-FCC) Towards a Coinductive Characterization of Computational Indistinguishability (CSL-LICS) On Context Semantics for Interaction Nets (CSL-LICS) Beta Reduction is Invariant, Indeed (LCC) Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus (RTA-TLCA) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
Implicit Definition	(ITP) HOL Constant Definitions Done Right
implicit generalization	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving
implicitly definable	(LATD) Definability of truth predicates in abstract algebraic logic
important separators	(PCCR) Discovering Archipelagos of Tractability: Split-Backdoors to Constraint Satisfaction
improvements in theorem prover technology	(ITP) Asynchronous User Interaction and Tool Integration in Isabelle/PIDE
incomplete databases	(KR) Certain Answers as Objects and Knowledge
incomplete information	(SAT) Fast DQBF Refutation
Incompleteness	(LC) C. I. Lewis' Influence on the Early Work of Emil Post (LC) Justifying proof-theoretic reflection principles
inconsistency	(LATD) De Morgan logics with a notion of inconsistency
inconsistency handling	(DL) Towards Practical Deletion Repair of Inconsistent DL-programs
inconsistency in probabilistic knowledge bases	(KR) Linear Programs for Measuring Inconsistency in Probabilistic Logics
inconsistency measures	(KR) Linear Programs for Measuring Inconsistency in Probabilistic Logics
inconsistency-tolerant query answering	(DL) Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics
incremental evaluation	(CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
Incremental Preprocessing	(SAT) Ultimately Incremental SAT
Incremental reasoning	(ICLP) Clingo = ASP + Control (ORE) Incremental and Persistent Reasoning in FaCT++
Incremental SAT	(SAT) Ultimately Incremental SAT
Incremental SAT Solving	(POS) Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
incremental tabling	(ICLP) Joint Tabling of Logic Program Abductions and Updates
incremental verification	(VeriSure) Quantification of Verification Progress
independence	(LC) Dependence and independence - a logical approach
indexing	(LFMTP) Proof-Theoretic Foundations of Indexing in Logic Programming (CICLOPS-WLPE) Towards Pre-Indexed Terms
IndiGolog	(KR) SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning
indiscernibility	(PRUV) Towards a Logic of Dilation
indiscernible	(LATD) Definability of truth predicates in abstract algebraic logic
Indiscernibles	(LC) Indiscernible extraction and Morley sequences
Individual concepts	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
Indivisibility	(LC) On various strengthenings of the notion of indivisibility
Induction	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents (CSL-LICS) Equality and Fixpoints in the Calculus of Structures (IFIP-WG16) Decision Procedures for Proving Inductive Theorems without Induction
induction reasoning	(PAS) Building explicit induction schemas for cyclic induction reasoning
induction rule	(PC) Parameter-free induction in bounded arithmetic
Induction schemes	(LC) On local induction schemes
Inductive definition	(LC) Adding a Conditional to Kripke's Theory of Truth
inductive definitions	(RTA-TLCA) Ramsey Theorem as an intuitionistic property of well founded relations
inductive invariant	(CAV) Property-Directed Shape Analysis
inductive predicates	(CSL-LICS) A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates
Inductive Reasoning	(VSTTE) Formalizing Semantics with an Automatic Program Verifier
inductive synthesis	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks (SYNT) Are There Good Mistakes? A Theoretical Analysis of CEGIS
Industrial automation	(CAV) G4LTL-ST: Automatic Generation of PLC Programs
inference	(NMR) Inference in the FO(C) Modelling Language
inference search	(ARQNL) Computer-oriented inference search in first-order sequent logics
inferences	(ICLP) Simulating Dynamic Systems Using Linear Time Calculus Theories
Infiniband	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
Infinitary Formulas	(KR) The Semantics of Gringo and Infinitary Propositional Formulas
infinitary lambda-calculus	(LCC) Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus (RTA-TLCA) A Coinductive Confluence Proof for Infinitary Lambda-Calculus.
Infinitary Logic	(LC) Amalgamation, characterizing cardinals and locally finite Abstract Elementary Classes (INFINITY) Interactions of Set Theory, $L_{\omega_1,\omega}$, and AEC
infinitary proof theory	(LC) Proof-Theoretic Analysis of Brouwer's Argument of the Bar Induction
infinitary rewriting	(RTA-TLCA) Proof terms for infinitary rewriting (RTA-TLCA) A Coinductive Confluence Proof for Infinitary Lambda-Calculus.
Infinitary Trees	(CLC) Infinitary Classical Logic: Recursive Equations and Interactive Semantics
Infinite connected graph of bounded degree	(CSL-LICS) A quest for algorithmically random infinite structures
Infinite execution	(WST) Geometric Series as Nontermination Arguments for Linear Lasso Programs
Infinite graph rewriting	(TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion
infinite resumptions	(LOLA) Programming and Verifying with Effect Handling and Iteration
Infinite tree	(CSL-LICS) A quest for algorithmically random infinite structures
infinite-valued logics	(ICLP) Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
infinitely	(INFINITY) Infinitely deep languages and neighbors
infix probability	(PLP) Prefix and infix probability computation in PRISM
Informal semantics	(KR) The Well-Founded Semantics Is the Principle of Inductive Definition, revisited
information economy principle	(LC) A Defense of Information Economy Principle
information flow	(CSF) Stateful Declassification Policies for Event-Driven Programs (CSF) Declarative Policies for Capability Control (CSF) Compositional Information-flow Security for Interactive Systems
information flow control	(CSF) Information flow monitoring as abstract interpretation for relational logic
Information Flow Security	(CSF) Noninterference under Weak Memory Models
Information Hiding	(DL) Controlled Query Evaluation over Lightweight Ontologies
Information preservation	(Linearity) Superstructural Reversible Logic
information retrieval	(DL) Evaluation of Extraction Techniques for Ontology Excerpts
information system	(LATD) Semantic information and fuzziness
Information theory	(Coq) Formalization of Error-correcting Codes using SSReflect
information-flow security	(CAV) A Conference Management System with Verified Document Confidentiality
Inhabitation	(ITRS) Delegation-based Mixin Composition Synthesis (Linearity) The inhabitation problem for non-idempotent intersection
initial algebra	(IFIP-WG16) Decision Procedures for Proving Inductive Theorems without Induction
inner models	(LC) Unraveling $\Sigma^0_\alpha(\Pi^1_1)$-Determinacy
Innocent strategies	(LOLA) Tensorial logic with algebraic effects
Input Vectors	(PAS) Source code profiling and classification for automated detection of logical errors
Input/output logic	(KR) Aggregative Deontic Detachment for Normative Reasoning
insertion modeling	(PAS) New predicate transformer for symbolic modeling
insider threat	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat (STAST) The Social Engineering Personality Framework
Insider Threats	(STAST) Modeling Human Behaviour with Higher Order Logic: Insider Threats
Inspection Points	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect
instability	(CAV) Finding instability in biological models
Instance features	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Instance Queries	(DL) Mary, What's Like All Cats?
instance reducibility	(LC) Reductions in computability theory from a constructive point of view
instance-based theorem proving	(PAAR) SGGS Theorem Proving: an Exposition
instantiation	(UNIF) Constraint Manipulation in SGGS (POS) iDQ: Instantiation-Based DQBF Solving
Instrospection	(ICLP) Towards an Efficient Prolog System by Code Introspection
Int construction	(LOLA) Call-by-Value in a Basic Logic for Interaction
integer part	(INFINITY) Computing a floor function
integer programming	(SMT) Leveraging Linear and Mixed Integer Programming for SMT
integers	(INFINITY) Computing a floor function
Integrating CDCL and MP	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
Integration	(CICLOPS-WLPE) A System for Embedding Global Constraints into SAT
integrity of OS	(PAS) VTOS: A Finite State Machine Model of OS and Formalized Verification of Its Microkernel
intelligent visual surveillance	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
intensional Martin-Löf type theory	(DTP) Terminal semantics for codata types in intensional Martin-Löf type theory
Intensional transitive verbs	(NLCS) Proof-Theoretic Semantics for intensional transitive verbs
Intensionalization	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
Intention and Belief	(KR) Tracking Beliefs and Intentions in the Werewolf Game
intentional semantics	(LOLA) Abstract Self Modifying Machines
interacting particle systems	(DCM) Interactive Particle Systems and Random Walks on Hypergraphs
Interaction	(NLCS) Divergence in Dialogues (SD) Multiplicative Decomposition of Behaviours in Ludics
Interaction nets	(TermGraph) An Implementation Model for Interaction Nets (CSL-LICS) On Context Semantics for Interaction Nets (Linearity) Geometry of Resource Interaction – A Minimalist Approach (DCM) A Simple Parallel Implementation of Interaction Nets in Haskell (DCM) Some observations for the parallel implementation of interaction nets
interactive case simulation tools	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
interactive systems	(CSF) Compositional Information-flow Security for Interactive Systems
Interactive Theorem Provers	(UITP) How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers (ARW-DT) Towards Evaluating the Usability of Interactive Theorem Provers
interactive theorem proving	(LOLA) A Cross-Language Framework for Verifying Compiler Optimizations (STAST) Modeling Human Behaviour with Higher Order Logic: Insider Threats (Coq) Coqoon: towards a modern IDE for Coq (VSTTE) Using Promela in a Fully Verified Executable LTL Model Checker (SHORT) (ITP) A heuristic prover for real inequalities (HOL) HOL4 Hidden Features (Isabelle) A formally verified proof of the Central Limit Theorem (WPTE) Verifying Optimizations for Concurrent Programs
interactive verification	(VERIFY) Reasoning About Vote Counting Schemes Using Light-weight and Heavy-weight Methods
Interference Scenarios	(EC2) Concolic Testing of Concurrent Programs
intermediate	(INFINITY) Classes of structures with no intermediate isomorphism problems
Intermediate Logics	(LC) Characterising Logics through their Admissible Rules (LATD) Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences (LATD) The Admissible Rules of Subframe Logics
intermediate models	(LC) A generalization of Solovay's Sigma-construction with application to intermediate models
Intermediate Predicate logics	(LC) Some properties related to the existence property in intermediate predicate logics
intermediate verification language	(CAV) SMACK: Decoupling Source Language Details from Verifier Implementations
internalization of type classes	(Isabelle) From Types to Sets in Isabelle/HOL
interpolants	(VSTTE) What Gives? A Hybrid Algorithm for Error Explanation (iPRA) Practical CNF Interpolants Via BDDs (iPRA) Interpolants in Two-Player Games
Interpolation	(CAV) Termination Analysis by Learning Terminating Programs (CAV) Interpolating Property Directed Reachability (CSL-LICS) Effective Interpolation and Preservation in Guarded Logics (iPRA) Fault Localization using Interpolation (iPRA) Practical CNF Interpolants Via BDDs (iPRA) Interpolation from Clausal Proofs (iPRA) Interpolation and Domain Independence applied to Databases
interpolation property	(LC)
intersection	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
Intersection and union types	(CLC) A Translation of Intersection and Union Types for the lambda-mu Calculus (ITRS) On Isomorphism of "Functional'' Intersection and Union Types (RTA-TLCA) Preciseness of subtyping on intersection and union types
intersection type	(ITRS) Semantic Types for Classes and Mixins
intersection types	(ITRS) Uniform Proofs of Normalisation and Approximation for Intersection Types (ITRS) Indexed linear logic and higher-order model checking (ITRS) A Finite Model Property for Intersection Types (ITRS) Liquid Intersection Types (ITRS) Delegation-based Mixin Composition Synthesis (CSL-LICS) Compositional Higher-Order Model Checking via Omega-Regular Games over Boehm Trees (Linearity) The inhabitation problem for non-idempotent intersection
Interval analysis	(NSV) Computational complexity of iterated maps on points and sets
interval arithmetic	(NSV) SetBased Decorated Intervals (SMT) raSAT: SMT for Polynomial Inequality
Interval solvers	(ICLP) Numerical Properties of Min-closed CSPs
intervals	(DL) Temporalising EL Concepts with Time Intervals
intrinsic variety	(LATD) On logics of varieties and logics of semilattices
introspection	(ITRS) Lucretia — intersection type polymorphism for scripting languages
introspective reasoning	(ASPOCP) A Refinement of the Language of Epistemic Specifications
Intuitionism	(PSC) Effective Bounds on the Podelski-Rybalchenko Termination Theorem
intuitionistic	(IJCAR) A Focused Sequent Calculus for Higher-Order Logic
intuitionistic first-order theories	(LATD) A semantic approach to conservativity
intuitionistic hybrid logic	(GSB) An Intuitionisticaly based Description Logic
intuitionistic logic	(LC) An outline of intuitionistic epistemic logic (CSL-LICS) Symmetric Normalisation for Intuitionistic Logic (PSC) Computing with Gödel’s completeness theorem (PSC) Intuitionistic Ancestral Logic (PSC) A joint logic of problems and propositions, a modified BHK-interpretation and proof-relevant topological models of intuitionistic logic (LATD) Interpreting Lukasiewicz logic into Intuitionistic logic (LATD) Canonical formulas for k-potent residuated lattices (ARQNL) Problem Libraries for Non-Classical Logics (ARQNL) Computer-oriented inference search in first-order sequent logics (ARQNL) Dialogues for proof search (ARW-DT) Tableau Development for a Bi-Intuitionistic Tense Logic (ARW-DT) On Herbrand theorems for classical and non-classical logics
intuitionistic modal logic	(CLC) Negative Translations and Heyting Algebra Expansions (GSB) Modular Systems for Intuitionistic Modal Logics in Nested Sequents (PCCR) Intuitionistic modal logics: efficient fragments and parameterized complexity
intuitionistic propositional logic	(IJCAR) A History-Based Theorem Prover for Intuitionistic Propositional Logic using Global Caching: IntHistGC System Description (PSC) Proof-search in natural deduction calculi for IPL
intuitionistic set theory	(LC) Some properties of Intuitionistic Set Theory with the principle UP. (PSC) Constructive completeness and exploding models
intuitionistic-modal Kripke frames	(CLC) Negative Translations and Heyting Algebra Expansions
invariance proofs	(ITP) Showing invariance compositionally for a process algebra for network protocols
invariant computation	(FWFM) Chekofv: Crowd-sourced Formal Verification
invariant synthesis	(CAV) ICE: A Robust Learning Framework for Synthesizing Invariants
Invariants	(CAV) Invariant verification of nonlinear hybrid automata networks of cardiac cells (ITP) From Operational Models to Information Theory - Side-Channels in pGCL with Isabelle (PAS) Source code profiling and classification for automated detection of logical errors
inverse limit	(LC) Elementary epimorphisms between models of set theory
inverse properties	(ORE) Exploring Reasoning with the DMOP Ontology
inverse rewriting	(DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
inverse roles	(IJCAR) Implementing Tableaux Calculi Using BDDs: BDDTab System Description
Invited talk	(LC) On local induction schemes
involutive residuated lattice	(LATD) Recent advances in the structural description of involutive FL$_e$-chains
IPC API	(Isabelle) Using Isabelle/HOL to Develop and Maintain Separation Invariants for an Operating System (Extended Abstract)
irrationality proof	(ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
Irregularity	(ICLP) Properties of Stable Model Semantics Extensions
Isabelle	(ITP) From Operational Models to Information Theory - Side-Channels in pGCL with Isabelle (ITP) An Isabelle Proof Method Language (ITP) Unified Decision Procedures for Regular Expression Equivalence (UITP) System description: Isabelle/jEdit in 2014 (Isabelle) Towards abstract and executable multivariate polynomials in Isabelle (Isabelle) Pattern-based Subterm Selection In Isabelle (Isabelle) From Types to Sets in Isabelle/HOL (Isabelle) Proving Gödel’s Incompleteness Theorems (Isabelle) Programming TLS in Isabelle/HOL (Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work) (Isabelle) Isabelle/jEdit NEWS
Isabelle proof assistant	(Isabelle) A formally verified proof of the Central Limit Theorem
Isabelle/HOL	(FRIDA) Mechanical Verification of a Constructive Proof for FLP (VeriSure) Implicit Assumptions in a Model for Separation Kernels (VSTTE) Separation Kernel Verification: the XtratuM Case Study (VSTTE) Certification of Nontermination Proofs using Strategies and Nonlooping Derivations (ITP) Cardinals in Isabelle/HOL (ITP) Recursive Functions on Codatatypes via Domains and Topologies (ITP) A New and Formalized Proof of Abstract Completion (ITP) Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm (ITP) Showing invariance compositionally for a process algebra for network protocols (ITP) Truly Modular (Co)datatypes for Isabelle/HOL (Vampire) My Life with an Automatic Theorem Prover (Isabelle) A Simpl Shortest Path Checker Verification (Isabelle) Primitively (Co)recursive Definitions for Isabelle/HOL (VPT) Formal Replay of Translation Validation for Highly Optimised C (PAS) VTOS: A Finite State Machine Model of OS and Formalized Verification of Its Microkernel
Isabelle/PIDE and Isabelle/jEdit	(ITP) Asynchronous User Interaction and Tool Integration in Isabelle/PIDE
isar	(Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work)
Ising Model	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
isomorphism problem	(LC) The isomorphism problem for computable projective planes
IT support	(KR4HC) Process Information and Guidance Systems in the Hospital
iteration	(PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
iterative process	(KR) Simultaneous Learning and Prediction
J
Janin-Walukiewicz theorem	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
Java	(ICLP) Customisable Handling of Java References in Prolog Programs (IJCAR) Proving Termination of Programs Automatically with AProVE (VSTTE) The KeY Platform for Verification and Analysis of Java Programs
Java Virtual Machine (JVM)	(ITP) Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete
JavaCard API	(ASA) Nuances of the JavaCard API on the cryptographic smart cards - JCAlgTest project
JavaScript	(HOPA) Analyzing JavaScript: The Bad Parts
jEdit	(Coq) Asynchronous interaction for Coq (UITP) PIDE for Asynchronous Interaction with Coq (UITP) System description: Isabelle/jEdit in 2014 (Isabelle) Isabelle/jEdit NEWS
Jeffrey's rule of conditioning	(KR) Reasoning with Uncertain Inputs in Possibilistic Networks
Jonsson theories	(LC) On Jonsson sets and some their properties.
JSON Schema	(CHR) From XML Schema to JSON Schema: Translation with CHR
Judgment Aggregation	(KR) Interval Methods for Judgment Aggregation in Argumentation (LATD) Boolean-valued judgment aggregation
jump	(LC) Definability of 0' in the structure of $\omega$-enumeration degrees
jump inversion	(LC) A non-uniqueness theorem for jumps of principal ideals
Just-in-time Compilation	(WST) Real-world loops are easy to predict : a case study
justification	(DL) An ABox Revision Algorithm for the Description Logic EL_\bot
Justification Logic	(LC) Complexity bounds for Multiagent Justification Logic (PSC) Multi-agent justification logic
Justifications	(DL) Understandable Explanations in Description Logic (ASPOCP) Supported Semantics for Modular Systems (ORE) Just: a Tool for Computing Justifications w.r.t. ELH Ontologies
justified belief	(KR) Justified Beliefs by Justified Arguments
K
k-fold Tseitin formula	(PC) Lower bounds for splittings by linear combinations
k-liveness	(CAV) Verifying LTL properties of hybrid systems with K-liveness
k-SAT	(SAT) Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses
Kachinuki ordering	(WST) On the derivational complexity of Kachinuki orderings
Kechris-Woodin rank	(LC) A computability approach to three hierarchies
kernel verification	(VSTTE) Separation Kernel Verification: the XtratuM Case Study
key	(ASA) Caetus tool
Key Compromise Impersonation	(CSF) Actor Key Compromise: Consequences and Countermeasures
KLEE	(SMT) Multi-solver Support in Symbolic Execution
Kleene algebra	(CSL-LICS) KAT + B!
Kleene algebra with tests	(CSL-LICS) KAT + B!
Kleene logic	(LC) Non-monotonic extensions of the weak Kleene clone with constants
Klein four group	(LC) Truth theory for logic of self-reference statements as a quaternion structure
Knowability Paradox	(LC) An outline of intuitionistic epistemic logic
Knowledge	(LC) An outline of intuitionistic epistemic logic (PAS) Symbolic Problem Solving With Bidirectional Executable Representations
Knowledge Acquisition and Forgetting	(KR) Forgetting in Action
knowledge base	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
knowledge base revision	(DL) An ABox Revision Algorithm for the Description Logic EL_\bot
knowledge base system	(ICLP) Simulating Dynamic Systems Using Linear Time Calculus Theories
knowledge compilation	(KR) On OBDDs for CNFs of Bounded Treewidth (KR) Probabilistic Sentential Decision Diagrams (PLP) Compiling Probabilistic Logic Programs into Sentential Decision Diagrams (PLP) Lifted Inference for Probabilistic Logic Programs
knowledge obfuscation	(DL) Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
Knowledge Representation	(ICLP) Causal Graph Justifications of Logic Programs (ICLP) C-Log: A Knowledge Representation Language of Causality (ICLP) ESmodels: An Epistemic Specification Solver (KR) Answering Instance Queries Relaxed by Concept Similarity (KR) ASP Encodings of Acyclicity Properties (KR) Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation (PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics (ASPOCP) Epistemic Logic Programs with Sorts (ASPOCP) Supported Semantics for Modular Systems (ICLP) Model Revision Inference for Extensions of First Order Logic (NMR) FO(C) and Related Modelling Paradigms (KR4HC) Preliminary Result on Finding Treatments for Patients with Comorbidity (KR4HC) Semantic Representation of Evidence-based Clinical Guidelines
Knowledge representation and ontologies for health-care processes	(KR4HC) Real Rules, Real Data -- Addressing Challenges of Reasoning HIPAA Privacy Rule in Health Information Exchange (HIE)
Knowledge Representation and Reasoning	(LaSh) Logical Machinery of Heuristics (Preliminary Report) (NMR) Integrating Declarative Programming and Probabilistic Graphical Models for Knowledge Representation and Reasoning in Robotics
Knowledge-based training	(KR4HC) Training residents in the application of clinical guidelines for differential diagnosis of the most frequent causes of arterial hypertension with decision tables
Knuth-Bendix completion	(WST) A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion
Kripke frames	(LATD) Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
kripke model	(CLC) Dualized Type Theory
Kripke models	(LATD) Cut and completion? (LATD) A semantic approach to conservativity
Kripke Platek set theory	(INFINITY) Proof Theoretic Characterisations of Feasible Set Functions
Kripke semantics	(LC) On graph calculus approach to modalities (PSC) Constructive completeness and exploding models
Krohn-Rhodes Theory	(ICLP) On Cascade Products of Answer Set Programs
Kruskal-Katona Theorem	(PC) Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets
L
labelled Markov Chains	(CSL-LICS) On the Total Variation Distance of Labelled Markov Chains
labellings enumeration algorithm	(KR) An SCC Recursive Meta-Algorithm for Computing Preferred Labellings in Abstract Argumentation
Lagrange duality	(NSV) Policy iteration in finite templates domain
lambda calculus	(CLC) A type system for Continuation Calculus (UNIF) A Categorical Perspective on Pattern Unification (Extended Abstract) (ITRS) On Isomorphism of "Functional'' Intersection and Union Types (CSL-LICS) Beta Reduction is Invariant, Indeed (LFMTP) Gentle Formalisation of Stoughton’s Lambda Calculus Substitution (Linearity) Wave-Style Token Machines and Quantum Lambda Calculi (Linearity) The inhabitation problem for non-idempotent intersection (RTA-TLCA) Near semi-rings and lambda calculus (RTA-TLCA) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (RTA-TLCA) Preciseness of subtyping on intersection and union types
Lambda encodings	(RTA-TLCA) Self Types for Dependently Typed Lambda Encodings
lambda expressions	(SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism
lambda-calculus	(CSL-LICS) Transition systems over games (CSL-LICS) On Context Semantics for Interaction Nets (CSL-LICS) On the Discriminating Power of Passivation and Higher-Order Interaction (VPT) Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem (DCM) Probabilistic Types and Function Overloading
lambda-mu calculus	(CLC) A Translation of Intersection and Union Types for the lambda-mu Calculus (CLC) Extensional Models of Typed Lambda-mu Calculus (RTA-TLCA) Reduction System for Extensional Lambda-mu Calculus
Lambek grammars	(NLCS) On Translating Context-Free Grammars into Lambek Categorial Grammars
language classes	(AISS) Of stacks (of stacks (...) with blind counters) with blind counters
Language Design	(ICLP) A Linear Logic Programming Language for Concurrent Programming over Graph Structures
Language Interoperability	(ICLP) Customisable Handling of Java References in Prolog Programs
language of mathematics	(NLCS) Modelling implicit dynamic introduction of function symbols in mathematical texts
Language Translator	(CHR) From XML Schema to JSON Schema: Translation with CHR
Languages	(INFINITY) Infinitely deep languages and neighbors (WWV) Static Enforcement of Role-Based Access Control
Large cardinals	(LC) Large cardinals, forcing axioms, and the theory of subsets of \omega_1
Large Neighbourhood Search	(ParSearchOpt) Towards a complete constraint solver on GPU
large theories	(PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5
large-scale ontologies	(DL) Brave and Cautious Reasoning in EL
large-theory automated reasoning	(PAAR) BliStr: The Blind Strategymaker
Lasserre	(PC) Narrow Proofs May Be Maximally Long
Latin square	(RCRA) Latin Squares with Graph Properties
lattice of truth values	(LC) Two Formalisms for a Logic of Generalized Truth Values
Lawvere theories	(RTA-TLCA) Local stores in string diagrams
Lazy Annotation	(CAV) Lazy Annotation Revisited (iPRA) Interpolation Strategies
lazy data structures	(IJCAR) Unified Classical Logic Completeness: A Coinductive Pearl
Lazy Languages	(ICLP) Guarding Corecursion in Logic Programming
lazy lists	(ITP) Recursive Functions on Codatatypes via Domains and Topologies
learning	(CAV) ICE: A Robust Learning Framework for Synthesizing Invariants (NMR) Preliminary Report on WASP 2
Learning preferences	(PRUV) Learning Preferences for Collaboration
Lebesgue orbit equivalence	(LC) Regular cross-sections of Borel flows
left-c.e. real	(LC) Limitwise monotonic sets of reals
leftmost outermost	(IFIP-WG16) Basic Normalization
Leibniz congruence	(LATD) Definability of truth predicates in abstract algebraic logic
Leibniz hierarchy	(LATD) Definability of truth predicates in abstract algebraic logic
Leibniz operator	(LATD) Generalizing the Leibniz and Suszko operators
length	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) Narrow Proofs May Be Maximally Long (PC) Size-Space Bounds and Trade-offs for CDCL Proofs
lessons learned	(NMR) Some thoughts about benchmarks for NMR
lexicographic product	(LC) On various strengthenings of the notion of indivisibility
Lexicographic Ranking Function	(CAV) A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis
LF	(LFMTP) A Framework for Implementing Logical Frameworks
Liar	(LC) Towards a Conditional for The Liar and the Sorites.
Liar Paradox	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
Librationism	(LATD) Truth degrees in the interval [-1,1] for the librationist system $\pounds$.
lie groups	(LC) Definable topological dynamics and real Lie groups
Lifted inference	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming (KR) Skolemization for Weighted First-Order Model Counting (PLP) Lifted Inference for Probabilistic Logic Programs
Lifting	(Isabelle) From Types to Sets in Isabelle/HOL
light logics	(CLC) Stratified Nested Linear Logic
limit laws	(INFINITY) Analytic combinatorics of the transfinite
limitative results	(GSB) Comparing Sequent Calculi via Hilbert-style Axioms
limitative theorems	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
limited nondeterminism	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
limited recursion	(INFINITY) Cobham Recursive Set Functions
limitwise monotonic degree	(LC) On limitwise monotonic reducibility of Σ^0_2-sets.
Limitwise monotonic function	(LC) Limitwise monotonic sets of reals
limitwise monotonic functions	(LC) On limitwise monotonic reducibility of Σ^0_2-sets.
limitwise monotonic reducibility	(LC) On limitwise monotonic reducibility of Σ^0_2-sets.
limitwise monotonic set	(LC) Limitwise monotonic sets of reals
Lindon interpolation	(GSB) Lyndon Interpolation for the Modal Mu-Calculus
linear	(HOR) Feebly not weakly
linear algebra	(CAV) A Nonlinear Real Arithmetic Fragment (DTP) Domain Specific Languages of Mathematics
linear arithmetic	(SMT) Leveraging Linear and Mixed Integer Programming for SMT
linear constraints	(CAV) An SMT-Based Approach to Coverability Analysis
linear differential systems	(HSB) Exploiting the eigenstructures of linear systems to speed up reachability computation
Linear lasso program	(WST) Geometric Series as Nontermination Arguments for Linear Lasso Programs
linear logic	(LOLA) Call-by-Value in a Basic Logic for Interaction (ICLP) A Linear Logic Programming Language for Concurrent Programming over Graph Structures (ICLP) A Proof Theoretic Study of Soft Concurrent Constraint Programming (CLC) Stratified Nested Linear Logic (CLC) A proof-theoretic view on scheduling in concurrency (TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (LC) Natural deduction for intuitionistic differential linear logic (LC) An intuitive semantics for {Full Intuitionistic Linear Logic} (ITRS) Indexed linear logic and higher-order model checking (CSL-LICS) The Geometry of Synchronization (CSL-LICS) A new correctness criterion for MLL proof nets (CSL-LICS) A functional functional interpretation (CSL-LICS) On Context Semantics for Interaction Nets (CSL-LICS) Non-Elementary Complexities for Branching VASS, MELL, and Extensions (CSL-LICS) Equality and Fixpoints in the Calculus of Structures (LCC) Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus (SD) A Correctness Criterion Free from Switchings (SD) Weak topologies for Linear Logic (SD) Multiplicative Decomposition of Behaviours in Ludics (HOPA) The modal nature of colors in higher-order model-checking (CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs (Linearity) Cut Elimination in Multifocused Linear Logic (Linearity) Wave-Style Token Machines and Quantum Lambda Calculi (RTA-TLCA) Construction of retractile proof structures (HOR) Distilling Abstract Machines
linear logic programming	(CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs
linear pi-calculus	(CSL-LICS) Deadlock and lock freedom in the linear pi-calculus
linear real problems	(SMT) Towards Conflict-Driven Learning for Virtual Substitution
linear rewriting and generalized gröbner basis	(IWC) Confluence of linear rewriting and homology of algebras
linear spaces	(DCM) Probabilistic Types and Function Overloading
Linear Temporal Logic	(ICLP) Abstract Diagnosis for tccp using a Linear Temporal Logic (CAV) G4LTL-ST: Automatic Generation of PLC Programs (CAV) From LTL to Deterministic Automata: A Safraless Compositional Approach (LC) A universal diagonal schema by fixed-points and Yablo’s paradox (CSL-LICS) Anchored LTL Separation (CSL-LICS) Asymptotic behaviour in temporal logic (SYNT) How to Handle Assumptions in Synthesis
linear time complexity	(GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress) (SD) First-order Proofs Without Syntax: Summary of Work in Progress
linear transformation	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
Linear Types	(Linearity) Type Classes for Lightweight Substructural Types
linear-time temporal logic	(ASPOCP) Temporal Stable Models are LTL-representable
Linearity	(Linearity) Geometry of Resource Interaction – A Minimalist Approach
Linearizability	(FRIDA) A Fast, Correct Time-Stamped Stack (CAV) Automatic Atomicity Verification for Clients of Concurrent Data Structures
link formulas	(GSB) Link formulas in implication fragments of substructural logics
Linked Data	(KR) Rough Set Semantics for Identity on the Web (KR4HC) Real Rules, Real Data -- Addressing Challenges of Reasoning HIPAA Privacy Rule in Health Information Exchange (HIE)
Linking	(VSTTE) A logical analysis of framing for specifications with pure method calls
LIO	(CSF) On Dynamic Flow-sensitive Floating-Label Systems
Liquid types	(ITRS) Liquid Intersection Types
list homomorphisms	(ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
List-chromatic number	(LC) Reflection principle of list-chromatic number of graphs
Lists	(UNIF) Unification Modulo Common List Functions
livelock	(WST) Reducing Deadlock and Livelock Freedom to Termination
Liveness	(CSL-LICS) Anchored LTL Separation (CSL-LICS) Probably Safe or Live (WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ
LLVM	(ACL2) Development of a Translator from LLVM to ACL2
local consistency	(RCRA) Neighbourhood SAC for Preprocessing and Search
local finiteness	(INFINITY) When excellence and local finiteness collide
local optimum	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
Local reasoning	(VSTTE) A logical analysis of framing for specifications with pure method calls
Local Search	(ParSearchOpt) A Constraint-based Parallel Local Search for Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem (ParSearchOpt) Towards a complete constraint solver on GPU
Local state monad	(LOLA) Tensorial logic with algebraic effects
local temporal logic	(WWV) A Local Logic for Realizability in Web Service Choreographies
local theories	(IJCAR) Locality Transfer: From Constrained Axiomatizations to Reachability Predicates
local theory extensions	(IJCAR) Locality Transfer: From Constrained Axiomatizations to Reachability Predicates
local typedef	(Isabelle) From Types to Sets in Isabelle/HOL
local-first	(iPRA) Tree-based Modular SMT Solving
locality	(CSL-LICS) Pattern Logics and Auxiliary Relations
locally finite variety	(UNIF) From Admissibility to a New Hierarchy of Unification Types
lock-free data structures	(DL) Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
Lock-freedom	(ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling (CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
Logarithmic Space	(RTA-TLCA) Unification and Logarithmic Space
logic	(ICLP) C-Log: A Knowledge Representation Language of Causality (KR) Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation (CAV) Program Verification through String Rewriting (VeriSure) Balancing the Formal and Informal in Safety Case Arguments (IJCAR) Introducing quantified cuts in logic with equality (LC) On the compactness theorem in many valued logics (LC) The DNA of logic and games. (LC) The place of logic in computer science education (UITP) A Logic-Independent IDE (ICLP) The Impact of Disjunction on Reasoning under Existential Rules (LATD) Truth degrees in the interval [-1,1] for the librationist system $\pounds$.
logic education	(LC) The place of logic in computer science education
logic of common knowledge	(GSB) On cuts and cut-elimination in modal fixed point logics
logic of GK	(NMR) Implementing Default and Autoepistemic Logics via the Logic of GK
logic of here-and-there	(ASPOCP) Infinitary Equilibrium Logic
logic of infinite sequences	(CSL-LICS) On Periodically Iterated Morphisms
Logic of Paradox	(LG) Game Semantics for Some Non-Classical Logics
Logic of Proofs	(LC) On Explicit-Implicit Reflection Principles.
Logic of Scientific Discovery	(PAS) An Attempt to Formalize Popper's Logic of Scientific Discovery
Logic over graphs	(CSL-LICS) Logical Characterization of Weighted Pebble Walking Automata
Logic Progarms	(ICLP) A Well-Founded Semantics for FOL-Programs
logic program updates	(ICLP) Joint Tabling of Logic Program Abductions and Updates
logic programming	(ICLP) Customisable Handling of Java References in Prolog Programs (ICLP) A Measure of Arbitrariness in Abductive Explanations (ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs (ICLP) Contextual Abductive Reasoning with Side-Effects (ICLP) ESmodels: An Epistemic Specification Solver (KR) An Abductive Reasoning Approach to the Belief-Bias Effect (KR) The Well-Founded Semantics Is the Principle of Inductive Definition, revisited (NLCS) Analyzing and Modelling the Structure of Argument Compounds in Logic: the case of technical texts (PLP) Approximated Probabilistic Answer Set Programming (LFMTP) Proof-Theoretic Foundations of Indexing in Logic Programming (ASPOCP) A Refinement of the Language of Epistemic Specifications (ASPOCP) Epistemic Logic Programs with Sorts (ICLP) Logic Programming as Scripting Language for Bots in Computer Games (CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs (CICLOPS-WLPE) A Lambda Prolog Based Animation of Twelf Specifications (NMR) A Family of Descriptive Approaches To Preferred Answer Sets (NMR) On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical Frameworks (NMR) Abduction in Argumentation: Dialogical Proof Procedures and Instantiation (iPRA) Application Patterns of Projection/Forgetting
Logic solvers	(IJCAR) StarExec: a Cross-Community Infrastructure for Logic Solving
logic translation	(ARQNL) Proof Support for Common Logic
logic variables	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
Logic-based Knowledge Representation	(KR4HC) A Logic-Based Framework for Medical Assessment Questionnaires
logic-based modeling	(ASPOCP) Declarative Encodings of Acyclicity Properties
Logical abduction	(iPRA) Specification Synthesis via Generalized Abduction
logical analysis of algorithms	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
Logical annotations	(ITRS) Liquid Intersection Types
Logical aspects of computational complexity	(CSL-LICS) On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase
logical difference	(KR) Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference (DL) Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs (DL) Evaluation of Extraction Techniques for Ontology Excerpts
Logical Errors	(PAS) Source code profiling and classification for automated detection of logical errors
Logical Framework	(LFMTP) Hybrid Extensions in a Logical Framework (LFMTP) A Framework for Implementing Logical Frameworks
Logical Frameworks	(LFMTP) Internal Adequacy of Bookkeeping in Coq
logical semantics	(ITRS) Semantic Types for Classes and Mixins
Logics	(NLCS) Divergence in Dialogues (PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics
Logics for AI	(CSL-LICS) On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase
logics for graphs	(CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics
Logics for partial functions	(ARQNL) Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic
Logistic Liar	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
logistic regression	(KR) Relational Logistic Regression
Long-distance resolution	(QBF) Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs
loop	(WST) A Solution to Endrullis-08 and Similar Problems
Loop Analysis	(WST) Real-world loops are easy to predict : a case study
Loop Detection	(ICLP) Guarding Corecursion in Logic Programming
loop invariant	(WING) ALICe: A Framework to Improve Affine Loop Invariant Computation
loop invariants	(CAV) From Invariant Checking to Invariant Inference Using Randomized Search (WING) Loop Invariants by Mutation, Dynamic Validation, and Static Checking
Loop Pipelining Transformation	(ACL2) Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis
Lorentzian manifolds	(LC) A completeness theorem for general relativity
Los-Tarski	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
low and high degrees	(LC) $\Delta_2^0$-spectra of linear orderings
low-level code	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
low-level programming languages	(ITP) Verified Abstract Interpretation Techniques for Disassembling Low-level Self-modifying Code
Lowenheim-Skolem theorems	(LATD) Advances on elementary equivalence in model theory of fuzzy logics
lower bound	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (PC) Lower bounds for splittings by linear combinations
lower bounds	(IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (SAT) Conditional Lower Bounds for Failed Literals and Related Techniques (LC) Complexity bounds for Multiagent Justification Logic (LCC) Small Dynamic Descriptive Complexity Classes
LP design and implementation	(ICLP) A Module System for Domain-Specific Languages
Ltac	(Coq) Presentation of Three Neat Tricks in Coq 8.5
LTL	(FRIDA) Model Checking Distributed Consensus Algorithms (CAV) Verifying LTL properties of hybrid systems with K-liveness (VSTTE) Using Promela in a Fully Verified Executable LTL Model Checker (SHORT) (CSL-LICS) The Complexity of Admissibility in Omega-Regular Games (CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability (PAS) Automatic App Testing of LTL Properties
LTL Model Checking	(Isabelle) The CAVA Automata Library
LTL Separation	(CSL-LICS) Anchored LTL Separation
LTL synthesis	(SYNT) Parameterized Synthesis Case Study: AMBA AHB (SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Ludics	(CLC) Infinitary Classical Logic: Recursive Equations and Interactive Semantics (SD) Multiplicative Decomposition of Behaviours in Ludics (Linearity) Ludics without Designs I: Triads
Lukasiewicz formulas	(LATD) Constructing many-valued logical functions with small influence of their variables
Lukasiewicz logic	(KR) How to Argue for Anything: Enforcing Arbitrary Sets of Labellings Using AFs (GSB) On Affine Logic and Łukasiewicz Logic (LATD) Connecting Fuzzy Sets and Pavelka's Fuzzy Logic (LATD) On tensor product in Lukasiewicz logic (LATD) The space of directions of a polyhedron (LATD) Coupling games for Lukasiewicz logic (LATD) Ordinal foundation for Lukasiewicz semantics (LATD) Interpreting Lukasiewicz logic into Intuitionistic logic
Lyapunov exponents	(NSV) Computational complexity of iterated maps on points and sets
M
m-Health	(KR4HC) Exploiting the Relation between Environmental Factors and Diseases: A Case Study on COPD
machine learning	(ICLP) SUNNY: a Lazy Portfolio Approach for Constraint Solving (KR) Predicting Performance of OWL Reasoners: Locally or Globally? (DL) Predicting OWL Reasoners: Locally or Globally? (PRUV) Learning Preferences for Collaboration (PAAR) Machine Learner for Automated Reasoning 0.4 and 0.5 (POS) New CNF Features and Formula Classification (NMR) Probabilistic Inductive Logic Programming based on Answer Set Programming
Machine-Learning	(ACL2) ACL2(ml): Machine-Learning for ACL2
Magic Sets	(ICLP) Grounding Bound Founded Answer Set Programs
main-memory RDF store	(DL) Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
majority operators	(LC) Complexity of generalized grading with inverse relations and intersection of relations
majority polymorphism	(LCC) Descriptive Complexity and CSP
make-easy" teaching approach	(FWFM) Using Esoteric Language for Teaching Formal Semantics
malleable signatures	(CSF) Malleable Signatures: New Definitions and Delegatable Anonymous Credentials
Many core	(CAV) Engineering a Static Verification Tool for GPU Kernels
Many Valued Logics	(LATD) Poof Search and Co-NP completeness for Many-Valued Logics
many-valued	(LC) On the compactness theorem in many valued logics
many-valued logic	(LATD) Boolean-valued judgment aggregation
Many-valued logics	(LC) A Routley-Meyer semantics for Göodel 3-valued logic G3 (LATD) Decidability of order-based modal logics (LATD) Trakhtenbrot theorem and first-order axiomatic extensions of MTL
Many-valued modal logic	(LC) Fuzzy Bsimulation for Standard Godel Modal Logic (LATD) Many-valued modal logic over residuated lattices via duality
Manycore	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
Mapping Analysis	(DL) Visualization and management of mappings in ontology-based data access (progress report)
mapping probabilistic logic languages	(PLP) PageRank, ProPPR and Stochastic Logic Programs
Mapping Visualization	(DL) Visualization and management of mappings in ontology-based data access (progress report)
MapReduce	(ASPOCP) Computing Answer Sets for Monadic Logic Programs via MapReduce
MapReduce Framework	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data (RCRA) Efficient Computation of the Well-Founded Semantics over Big Data
Maps of graphs	(KR) Knowledge Maps of Web Graphs
marked regular expressions	(ITP) Unified Decision Procedures for Regular Expression Equivalence
Marker's extensions	(LC) Degree spectra of sequences of structures
Markov Chain	(VeriSure) Assurance of some system reliability characteristics in formal design verification (CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Markov Chain Monte Carlo Techniques	(ICLP) Adaptive MCMC-Based Inference in Probabilistic Logic Programs
Markov chains	(CSL-LICS) Zero-Reachability in Probabilistic Multi-Counter Automata
Markov Principle M	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Markov Rule	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Markov's normal algorithms	(VPT) On Unfolding for Programs Using Strings as a Data Type
Markov's Principle	(CLC) A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle
Martin Lof randomness	(CSL-LICS) A quest for algorithmically random infinite structures
Martin Lof test	(CSL-LICS) A quest for algorithmically random infinite structures
Mass Parallelization	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data
massive open online courses	(IFIP-WG16) Impacts of the Digital Revolution on two Main Activities of Scientists: Teaching and Publishing
Matching	(CHR) Constraint Handling Rules with Multiset Comprehension Patterns (UNIF) Hierarchical Combination of Matching Algorithms (Extended Abstract) (UNIF) Matching with respect to general concept inclusions in the Description Logic EL (DL) Matching with respect to general concept inclusions in the Description Logic EL
matching logic	(PAS) Programming Language Aggregation with Applications in Equivalence Checking
Matchmaking	(ORE) Mini-ME 2.0: powering the Semantic Web of Things
Materialisation	(DL) SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
Materialization	(DL) Abstraction Refinement for Ontology Materialization
mathematical components	(ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
mathematical fuzzy logic	(LATD) Connecting Fuzzy Sets and Pavelka's Fuzzy Logic (LATD) Introducing an exotic MTL-chain (LATD) Advances on elementary equivalence in model theory of fuzzy logics
mathematical knowledge	(LC) Reflection, Trust, Entitlement
mathematical logic	(LC) Completeness of second-order separation logic for program verification
Mathematical Morphology	(KR) Concept Dissimilarity with Triangle Inequality
Mathematical progress	(LC) Frege on mathematical progress
mathematics education	(DTP) Domain Specific Languages of Mathematics
Mathias model	(LC) A descriptive set theoretical axiomatization of the Mathias model.
Matrix iterations	(LC) Matrix iterations and Cichoń's diagram
matrix multiplication	(CSL-LICS) Faster decision of first-order graph properties
max-2-sat	(SAT) Approximating highly satisfiable random 2-SAT
Max-SMT	(CAV) Proving Non-termination Using Max-SMT (SAT) Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
maximal completion	(WST) A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion
maximal contraction	(PAS) RCK: A Software Toolkit for R-calculus
Maximal Falsifiability	(RCRA) Maximal Falsifiability: Definitions, Algorithms, and Applications
Maximal interpolants	(iPRA) Specification Synthesis via Generalized Abduction
Maximal Satisfiable Subsets	(SAT) On Computing Preferred MUSes and MCSes
maximum entropy model	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
Maximum Falsifiability	(SAT) On Reducing Maximum Independent Set to Minimum Satisfiability (RCRA) Maximal Falsifiability: Definitions, Algorithms, and Applications
Maximum Independent Set	(SAT) On Reducing Maximum Independent Set to Minimum Satisfiability
Maximum satisfiability	(SAT) Open-WBO: a Modular MaxSAT Solver (SAT) Approximating highly satisfiable random 2-SAT (LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability (RCRA) Optimal Neighborhood Preserving Visualization by Maximum Satisfiability
Maximum satisfiability modulo theories	(ADDCT) Finding Minimum Type Error Sources
MaxSAT	(SAT) Cores in Core based MaxSat Algorithms: an Analysis (SAT) Solving MaxSAT and #SAT on structured CNF formulas (LaSh) Modeling High School Timetabling as PartialWeighted maxSAT (ASPOCP) On the Implementation of Weak Constraints in WASP
MCMC	(CAV) From Invariant Checking to Invariant Inference Using Randomized Search
MDP	(CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
mean payoff	(CAV) Minimizing Running Costs in Consumption Systems
mean-payoff and discounted sum	(CSL-LICS) Secure Equilibria in Weighted Games
mean-payoff games	(CSL-LICS) Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
meaning explanations	(DTP) On a style of presentation of type systems
measurable cardinals	(LC) Unraveling $\Sigma^0_\alpha(\Pi^1_1)$-Determinacy
Measure	(CSL-LICS) A quest for algorithmically random infinite structures
mechanism design	(ARW-DT) Reasoning about Auctions
Mechanization of Mathematics	(ITP) A Formal Library for Elliptic Curves in the Coq Proof Assistant
mechanized proof	(ACL2) Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4
Medical Knowledge Representation	(KR4HC) Towards a Conceptual Model for Enhancing Reasoning about Clinical Guidelines: A case-study on Comorbidity (KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
medical treatment processes	(KR4HC) Process Information and Guidance Systems in the Hospital
MELL	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (Linearity) Undecidability of Multiplicative Subexponential Logic
memory fence synthesis	(CAV) Don't sit on the fence: A static analysis approach to automatic fence insertion
Memory Logics	(LC) On graph calculus approach to modalities
Memory Safety	(CAV) Optimal Guard Synthesis for Memory Safety (CSF) Portable Software Fault Isolation
mereology	(NLCS) Mereological Comparatives in Delineation Semantics (LC) Finite Inseparability of Elementary Theories Based on Connection (DTP) A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
mereotopology	(LC) Finite Inseparability of Elementary Theories Based on Connection
Message Formats	(CSF) A Sound Abstraction of the Parsing Problem
Message Passing	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
message passing systems	(EC2) A new reduction for event-driven distributed programs
message sequence charts	(AISS) Model Checking Communicating Finite-State Machines using Local Temporal Logics (CSL-LICS) Logic for Communicating Automata with Parameterized Topology
Meta	(LaSh) Meta-level Representations in the IDP Knowledge Base System: Bootstrapping Inference Engine Development
Meta CIG system	(KR4HC) META-GLARE: a meta-system for defining your own CIG system: Architecture and Acquisition
meta modelling	(DL) Typed Higher-Order Variant of SROIQ - Why Not?
meta programming	(ASPOCP) ``Are Preferences Giving You a Headache?'' - ``Take asprin!''
meta-heuristic search	(PAS) A hybrid path constraint solver combined with meta-heuristic search
meta-logic	(LATD) A meta-Logic of multiple-conclusion rules
metabolic regulation	(HSB) Bayesian Design for Whole Cell Synthetic Biology Models
metadata	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
metamathematics	(LC) On a theorem of McAloon
metric abstract elementary classes	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types
metric structures	(LC) Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures
metric temporal logic	(ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems
micro-kernel OS	(PAS) VTOS: A Finite State Machine Model of OS and Formalized Verification of Its Microkernel
Midsequent theorem	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
MILS	(VSTTE) Separation Kernel Verification: the XtratuM Case Study
MILS (multiple independent levels of security)	(Isabelle) Using Isabelle/HOL to Develop and Maintain Separation Invariants for an Operating System (Extended Abstract)
Min-closed constraints	(ICLP) Numerical Properties of Min-closed CSPs
MinAs	(DL) Towards Parallel Repair: An Ontology Decomposition-based Approach (ORE) Just: a Tool for Computing Justifications w.r.t. ELH Ontologies
minimal change	(KR) On the Revision of Argumentation Systems: Minimal Change of Arguments Statuses
Minimal Correction Subsets	(SAT) On Computing Preferred MUSes and MCSes
minimal entailment	(NMR) Tableau vs. Sequent Calculi for Minimal Entailment
Minimal hitting set dualization	(RCRA) Maximal Falsifiability: Definitions, Algorithms, and Applications
Minimal model generation	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics (ARW-DT) Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
minimal model semantics	(DL) Rational closure in SHIQ
Minimal modules	(DL) Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
minimal network	(KR) On Redundant Topological Constraints (Extended Abstract)
Minimal numbering	(LC) Ideals without minimal numberings in the Rogers semilattice
minimal numberings	(LC) Computable numberings in Analytical Hierarchy
minimal truth	(LATD) Definability of truth predicates in abstract algebraic logic
Minimal Unsatisfiable Core	(SAT) MUS Extraction using Clausal Proofs (VSTTE) What Gives? A Hybrid Algorithm for Error Explanation
Minimal Unsatisfiable Subsets	(SAT) On Computing Preferred MUSes and MCSes
Minimum Satisfiability	(SAT) On Reducing Maximum Independent Set to Minimum Satisfiability (RCRA) Maximal Falsifiability: Definitions, Algorithms, and Applications
Minisat	(SAT) Ultimately Incremental SAT
Minkowski sum	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
Minlog	(PSC) Extracting Monadic Parsers from Proofs
missing information	(KR) Simultaneous Learning and Prediction
Mixin	(ITRS) Delegation-based Mixin Composition Synthesis
mixin inheritance	(ITRS) Semantic Types for Classes and Mixins
MLL	(SD) A Correctness Criterion Free from Switchings
MMT	(UITP) A Logic-Independent IDE (LFMTP) A Framework for Implementing Logical Frameworks
MMU	(VSTTE) Store Buffer Reduction with MMUs
Mnemoids	(LOLA) Tensorial logic with algebraic effects
mobile computing	(PAS) Automatic App Testing of LTL Properties
mobile devices	(ORE) Android Went Semantic: Time for Evaluation
Mobile Robots	(FRIDA) On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering
Modal and temporal logics	(CSL-LICS) Equilibria of Concurrent Games on Event Structures
modal consequence operations	(LC) Almost structurally complete consequence operations extending S4.3
modal logic	(KR) Axioms .2 and .4 as Interaction Axioms (GSB) Display-type calculi and their cut elimination metatheorem (IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description) (LC) On the almost sure validities in the finite in some fragments of monadic second-order logic (FCS-FCC) Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model (CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus (LCC) Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic (PSC) Multi-agent justification logic (LG) Multi-Agent Dialogical Games for Modal Logic (ARQNL) Problem Libraries for Non-Classical Logics (ARQNL) Computer-oriented inference search in first-order sequent logics (ARQNL) Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R) (ARW-DT) Tableau Development for a Bi-Intuitionistic Tense Logic (ARW-DT) On Herbrand theorems for classical and non-classical logics
Modal logics	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics (IJCAR) Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (LC) On graph calculus approach to modalities (LFMTP) Hybrid Extensions in a Logical Framework (LATD) Decidability of order-based modal logics
Modal Logics of Confluence	(IJCAR) Clausal Resolution for Modal Logics of Confluence
modal mu-calculus	(GSB) Lyndon Interpolation for the Modal Mu-Calculus
modal tableaux	(IJCAR) Implementing Tableaux Calculi Using BDDs: BDDTab System Description
Modal Temporal Logics	(KR) Strong Equivalence of Non-monotonic Temporal Theories
modal µ-calculus	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
Mode checking	(CAV) Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
model	(LC) The Birth of Semantic Entailment (Isabelle) From Types to Sets in Isabelle/HOL (PAS) A Model Theory for R-calculus without Cut
model analysis	(HSB) RKappa: Statistical sampling suite for Kappa models.
Model Checker	(VSTTE) Using Promela in a Fully Verified Executable LTL Model Checker (SHORT)
model checking	(EC2) A new reduction for event-driven distributed programs (CHR) Automated Test Case Generation and Model Checking with CHR (KR) Model Checking Unbounded Artifact-Centric Systems (KR) An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications (FRIDA) Model Checking Distributed Consensus Algorithms (FRIDA) Models and techniques for verification of Software Defined Networks (FRIDA) Monotonic Abstraction Techniques: from Parametric to Software Model Checking (CAV) Software Verification in the Google App-Engine Cloud (CAV) MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications (CAV) Interpolating Property Directed Reachability (CAV) Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (CAV) SMT-based Model Checking for Recursive Programs (IJCAR) QBF Encoding of Temporal Properties and QBF-Based Verification (AISS) Model Checking Communicating Finite-State Machines using Local Temporal Logics (CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability (CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (WING) ALICe: A Framework to Improve Affine Loop Invariant Computation (WST) Fairness for Infinite-State Systems (FWFM) An Example Demonstrating the Requirement of Fully Formal Verification Method (RTA-TLCA) Predicate Abstraction of Rewrite Theories
model composition	(HSB) RKappa: Statistical sampling suite for Kappa models.
Model construction	(IJCAR) Approximations for Model Construction
model counting	(KR) Skolemization for Weighted First-Order Model Counting (SAT) Solving MaxSAT and #SAT on structured CNF formulas (CSL-LICS) Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties (SMT) Speeding Up SMT-Based Quantitative Program Analysis
model existence	(LC) Explosiveness, Model Existence, and Incompatible Paraconsistencies
model expansion	(NMR) Three Semantics for Modular Systems
model finding	(PAAR) A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories
model generation	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics (ARW-DT) Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
model revision	(ICLP) Model Revision Inference for Extensions of First Order Logic
Model Synthesis	(CAV) Analyzing and Synthesizing Genomic Logic Functions
model theory	(LC) Computing the number of types of infinite tuples (LC) Quasiminimal structures and excellence (LC) Differential Galois theory in the class of formally real fields. (LC) Around n-dependent fields (LC) Definable topological dynamics and real Lie groups (LCC) Infinite AC0 Circuits for Parity (LATD) Advances on elementary equivalence in model theory of fuzzy logics
model theory of incompleteness	(KR) Certain Answers as Objects and Knowledge
model validation	(VSTTE) Formal Modeling and Verification of CloudProxy
model-based reasoning	(IFIP-WG16) Semantically-Guided Goal-Sensitive Theorem Proving
Model-Based System Development	(VeriSure) Human-Computer Interaction and the Formal Certification and Assurance of Medical Devices: The CHI+MED Project
model-based theorem proving	(PAAR) SGGS Theorem Proving: an Exposition
Model-checking	(IJCAR) Visibly Linear Temporal Logic
model-finding	(IJCAR) Finite Quantification in Hierarchic Theorem Proving (PAAR) Razor: Provenance and Exploration in Model-Finding
modeling	(VSTTE) Formal Modeling and Verification of CloudProxy (VEMDP) Modeling and Analysis of Genetic Boolean Gates Using the Infobiotics Workbench (CSF) Differential Privacy: An Economic Method for Choosing Epsilon
modelling	(QUANTIFY) Encoding Reachability with Quantification (LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability
modelling and analysis of qualitative behaviour of biological systems	(HSB) Modeling and analysis of qualitative behavior of gene regulatory networks
models	(FRIDA) Towards binary circuit models that faithfully reflect physical (un)solvability (SMT) Better Answers to Real Questions
models of incompleteness	(KR) Certain Answers as Objects and Knowledge
modern proof theory	(LC) Aristotle’s conception of demonstration and modern proof theory
modes of operation	(CSF) Automated Analysis and Synthesis of Block-Cipher Modes of Operation
Modular Logic Programming	(NMR) Generalising Modular Logic Programs
modular reasoning	(DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs (DL) An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
Modular Solver	(SAT) Open-WBO: a Modular MaxSAT Solver
modular systems	(ASPOCP) Supported Semantics for Modular Systems
modular verification	(ARW-DT) Modular Verification of Interconnected Families of Uniform Linear Hybrid Automata
modulare SMT solving	(iPRA) Tree-based Modular SMT Solving
Modularisation	(DL) Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition
modularity	(DL) DeaLing with Ontologies using CODs (RTA-TLCA) Confluence by Critical Pair Analysis (NMR) Three Semantics for Modular Systems
modularization	(ORE) Exploring Reasoning with the DMOP Ontology
Module systems	(ICLP) A Module System for Domain-Specific Languages
modules	(DL) An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies
modulo counting quantifiers	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
Molecular computing	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach (VEMDP) A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures
Molecular programming	(VEMDP) Verifying CRN Implementations: A Pathway Decomposition Approach (VEMDP) A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures
Monad	(PSC) Extracting Monadic Parsers from Proofs (Isabelle) Programming TLS in Isabelle/HOL
Monadic	(NLCS) Program Extraction Applied to Monadic Parsing
monadic ASP	(ASPOCP) Computing Answer Sets for Monadic Logic Programs via MapReduce
monadic language	(CLC) Confluence for classical logic through the distinction between values and computations
monadic logic	(LATD) Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
Monadic metalanguages	(CSL-LICS) Substitution, jumps, and algebraic effects
monadic program schemes	(CSL-LICS) On the Hoare Theory of Monadic Recursion Schemes
monadic recursion schemes	(CSL-LICS) On the Hoare Theory of Monadic Recursion Schemes
monadic second order logic	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
monadic second-order	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
monadic second-order logic	(CSL-LICS) Logic for Communicating Automata with Parameterized Topology
Monads	(CSL-LICS) Substitution, jumps, and algebraic effects
Monads with arities	(RTA-TLCA) Local stores in string diagrams
monitor	(CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
monitoring	(DL) A Stream-Temporal Query Language for Ontology Based Data Access
Monoid	(CSL-LICS) A quest for algorithmically random infinite structures
monomorphization	(SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism
Monotone induction and coinduction	(PSC) Program extraction in Church's simple theory of types (invited talk)
monotone modal logic	(LC) Display-type calculi for non classical logics
Monotone operator	(LC) Adding a Conditional to Kripke's Theory of Truth
Monotone proofs	(PC) n^O(log log n) size monotone proofs of the weak pigeonhole principle (CSL-LICS) On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
monotonic abstraction	(FRIDA) Monotonic Abstraction Techniques: from Parametric to Software Model Checking
monotonic logic	(DL) WApproximation: computing approximate answers for ontological queries
Monotonic Markov decision processes	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Montague semantics	(NLCS) On Translating Context-Free Grammars into Lambek Categorial Grammars
Monte-Carlo Tree Search	(RCRA) Concept Learning by a Monte-Carlo Tree Search of Argumentations
Morley sequences	(LC) Indiscernible extraction and Morley sequences
morphic words	(CSL-LICS) On Periodically Iterated Morphisms
MSO	(CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
MSO definable graphs of bounded clique-width	(AISS) Parameterized Model Checking of Rendezvous Systems
MSO-automata	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
MTL	(LATD) Introducing an exotic MTL-chain
mu-calculus	(GSB) On cuts and cut-elimination in modal fixed point logics (LC) Algorithmic-algebraic canonicity for mu-calculi (CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus
Muller games	(CSL-LICS) The Complexity of Admissibility in Omega-Regular Games
multi agent	(ARW-DT) The Leo-III Project
multi agent games	(LG) Multi-Agent Dialogical Games for Modal Logic
Multi Context Systems	(KR) Generalized Multi-Context Systems
multi type calculus	(LC) Display-type calculi for non classical logics
Multi-agent systems	(KR) An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications (KR) Reasoning about Equilibria in Game-like Concurrent Systems (CAV) MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
Multi-Attribute Decision Making	(PRUV) Multi-Attribute Decision Making using Weighted Description Logics
multi-context system	(NMR) Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based Argumentation
multi-context systems	(DL) Contextualized Knowledge Repositories with Justifiable Exceptions (ASPOCP) Supported Semantics for Modular Systems
Multi-counter automata	(CSL-LICS) Zero-Reachability in Probabilistic Multi-Counter Automata
Multi-Criteria Decision Making	(PRUV) Multi-Attribute Decision Making using Weighted Description Logics
Multi-Paradigm Programming	(ICLP) Customisable Handling of Java References in Prolog Programs
Multi-Stack Pushdown Systems	(CSL-LICS) Senescent Ground Tree Rewrite Systems
multi-type sequent calculi	(GSB) Display-type calculi and their cut elimination metatheorem
Multi-valued logic	(PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas
Multi-valued Logic Programming	(ICLP) Causal Graph Justifications of Logic Programs
multiagent dynamic systems	(KR) On the Progression of Knowledge in Multiagent Systems
Multicore	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
Multicore shared-memory system	(FRIDA) A Fast, Correct Time-Stamped Stack
multidimensional quantitative games	(CSL-LICS) Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
multimedia learning modules	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
multiple-conclusion rule	(LATD) A meta-Logic of multiple-conclusion rules
multiplicative linear logic	(CSL-LICS) No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
multiplicative-exponential linear logic	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
multiprocessor	(ACL2) An ACL2 Mechanization of an Axiomatic Framework for Weak Memory
multiscale simulation	(HSB) Integration of rule-based models and compartmental models of neurons
multiscale simulations	(HSB) Integration of rule-based models and compartmental models of neurons
multiset comprehension	(CHR) Constraint Handling Rules with Multiset Comprehension Patterns
Multiset Rewriting	(CHR) Constraint Handling Rules with Multiset Comprehension Patterns (FCS-FCC) Towards Timed Models for Cyber-Physical Security Protocols
Music	(PLP) Exploring probabilistic grammars of symbolic music using PRISM
Mutability	(ICLP) Towards an Efficient Prolog System by Code Introspection
mutable state	(FCS-FCC) A Hybrid Analysis for Security Protocols with State (CSL-LICS) KAT + B!
mutual exclusion protocol	(WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ
MV-algebra	(LATD) Connecting Fuzzy Sets and Pavelka's Fuzzy Logic (LATD) The space of directions of a polyhedron (LATD) On the Logic of Perfect MV-algebras (LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras (LATD) Quasivarieties of MV-algebras and structurally complete Lukasiewicz logics (LATD) MV-algebras with product and the Pierce-Birkhoff conjecture (LATD) Interpreting Lukasiewicz logic into Intuitionistic logic
MV-algebras	(LATD) Classification of germinal MV-algebras
N
n-dependent theories	(LC) Around n-dependent fields
n-interpolation	(iPRA) Tree-based Modular SMT Solving
naive set theory	(LC) Prospects for a Naive Theory of Classes (LC) Blocking the routes to triviality with depth relevance
naive truth	(LC) Prospects for a Naive Theory of Classes
naive types	(LC) Type equations and second order logic
Narrative	(KR) Representing and Reasoning About Time Travel Narratives: Foundational Concepts
Nash bargaining	(NLCS) Grice, Hoare and Nash: some comments on conversational implicature
Nash equilibria	(LC) Nash equilibrium semantics for Independence-Friendly Logic (CSL-LICS) Equilibria of Concurrent Games on Event Structures
Nash equilibrium	(KR) Reasoning about Equilibria in Game-like Concurrent Systems (CSL-LICS) Infinite sequential games with real-valued payoffs
natural deduction	(LC) Argumentation Logic (LC) Natural deduction for intuitionistic differential linear logic (LC) Natural Deduction in Renaissance Geometry (PSC) Proof-search in natural deduction calculi for IPL (ARW-DT) Socratic Proofs for Propositional Linear-Time Logic (DCM) Propositional Logics Complexity and the sub-formula Property
Natural duality	(LATD) Many-valued modal logic over residuated lattices via duality
natural language	(NLCS) Computing Italian clitic and relative clauses with tupled pregroups (NLSR) Natural Language Access to Data
natural language arguments	(NMR) Towards a Benchmark of Natural Language Arguments
natural language processing	(NLSR) Exposing Predictive Analytics through Natural Language Dialog
natural logic	(NLCS) Toward a Logic of Cumulative Quantification
near semi-rings	(RTA-TLCA) Near semi-rings and lambda calculus
Need for Cognition	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
Needed step	(TermGraph) Needed Computations Shortcutting Needed Steps
negation	(LATD) De Morgan logics with a notion of inconsistency
negation as failure	(KR) Constructive Negation in Extensional Higher-Order Logic Programming
negation-as-failure	(ICLP) Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Negative translation	(CLC) A Translation of Intersection and Union Types for the lambda-mu Calculus (GSB) On Affine Logic and Łukasiewicz Logic
negative translations	(CLC) Negative Translations and Heyting Algebra Expansions (LC) Predicate Glivenko theorems and substructural aspects of negative translations
neighborhood embedding	(RCRA) Optimal Neighborhood Preserving Visualization by Maximum Satisfiability
Neighborhood Semantics	(GSB) Sequent Systems for Classical Modal Logics
nested Petri nets	(VPT) Branching Processes of Conservative Nested Petri Nets
nested sequent calculi	(IJCAR) NESCOND: an Implementation of Nested Sequent Calculi for Conditional Logics
nested sequents	(GSB) On cuts and cut-elimination in modal fixed point logics (GSB) Modular Systems for Intuitionistic Modal Logics in Nested Sequents
Nested words	(CAV) Symbolic Visibly Pushdown Automata (CSL-LICS) Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
network protocol	(Isabelle) Programming TLS in Isabelle/HOL
network protocols	(ITP) Showing invariance compositionally for a process algebra for network protocols
network rewriting	(IWC) Critical Pairs in Network Rewriting (WST) Ordering Networks
Network security	(CSF) Mignis: A semantic based tool for firewall configuration
network update	(FRIDA) Models and techniques for verification of Software Defined Networks
networks	(CSF) The Complexity of Estimating Systematic Risk in Networks
neurobiology	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
new features	(ACL2) Enhancements to ACL2 in Versions 6.2, 6.3, and 6.4
NEXPTIME	(POS) iDQ: Instantiation-Based DQBF Solving
Nice enumerations	(LC) Extreme amenability of precompact expansions of countably categorical structures
Noetherian induction	(PAS) Building explicit induction schemas for cyclic induction reasoning
Noetherian spaces	(LC) Reverse mathematics of WQOs and Noetherian spaces
nominal	(Isabelle) Proving Gödel’s Incompleteness Theorems
Nominal Anti-Unification	(UNIF) Nominal Anti-Unification
nominal automata	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
Nominal Equivariance Algorithm	(UNIF) Nominal Anti-Unification
Nominal Logic	(ARQNL) Embedding of Quantified Higher-Order Nominal Modal Logic into Classical Higher-Order Logic
nominal schemas	(KR) Nominal Schemas in Description Logics: Complexities Clarified (DL) Complexities of Nominal Schemas
nominals	(IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description) (DL) Fuzzy DLs over Finite Lattices with Nominals
Non monotonic reasoning	(DL) DIP: A Defeasible-Inference Platform for OWL Ontologies
Non-characterizability	(LG) Non-characterizability in belief revision: an application of finite model theory
Non-circular Justifications	(KR) Generalized Multi-Context Systems
Non-classical Logic	(LC) Modelling Inference in Fiction (LC) Prospects for a Naive Theory of Classes (LG) Game Semantics for Some Non-Classical Logics
non-classical logics	(KR) Minimal Change in AGM Revision for Non-classical Logics (GSB) Display-type calculi and their cut elimination metatheorem (GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi (ARQNL) Problem Libraries for Non-Classical Logics
non-convex aggregates	(NMR) Semantics and Compilation of Answer Set Programming with Generalized Atoms
non-determinism	(CLC) A proof-theoretic view on scheduling in concurrency (DL) Bridging the Gap between Tableau and Consequence-Based Reasoning (Linearity) Geometry of Resource Interaction – A Minimalist Approach
non-deterministic semantics	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi
Non-disjoint union of theories	(IJCAR) A Gentle Non-Disjoint Combination of Satisfiability Procedures
non-elementary classes	(LC) Quasiminimal structures and excellence
non-extensional computation	(CLC) Relative Computability and Uniform Continuity of Non-Extensional (aka Multivalued) 'Functions'
non-interference	(CAV) The Spirit of Ghost Code (CSF) On Dynamic Flow-sensitive Floating-Label Systems
Non-linear	(IWC) Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
non-linear optimization	(DTP) Domain Specific Languages of Mathematics
non-linear real arithmetic	(SMT) Better Answers to Real Questions
non-monotonic consequence	(LG) Game Semantics for Conditional Logic
non-monotonic fixed point theory	(ICLP) Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Non-monotonic Logic Programming	(ICLP) Vicious Circle Principle and Logic Programs with Aggregates
non-monotonic logics	(IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment
Non-monotonic reasoning	(ICLP) C-Log: A Knowledge Representation Language of Causality (KR) Generalized Multi-Context Systems (KR) How to Argue for Anything: Enforcing Arbitrary Sets of Labellings Using AFs (ASPOCP) Epistemic Logic Programs with Sorts (NMR) Inference in the FO(C) Modelling Language
Non-orthogonality	(RTA-TLCA) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
non-standard analysis	(ACL2) Equivalence of the Traditional and Non-Standard Definitions of Concepts from Real Analysis (CSF) Modeling Diffie-Hellman Derivability for Automated Analysis
Non-standard inferences	(ORE) Mini-ME 2.0: powering the Semantic Web of Things
non-standard models	(LC) On a theorem of McAloon
non-standard reasoning	(DL) Brave and Cautious Reasoning in EL
non-termination	(ICLP) On Termination, Confluence and Consistent CHR-based Type Inference (WST) Non-termination of Dalvik bytecode via compilation to CLP (WST) Non-termination using Regular Languages
non-uniform computation	(LCC) Non-uniform Polytime Computation in the Infinitary Affine Lambda-calculus
Non-uniform inductive types	(ITP) Balancing lists: a proof pearl
nonconvex subexpression	(IWC) Critical Pairs in Network Rewriting
nondeterminism	(RTA-TLCA) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB
nonexpansive iterations	(LC) Effective results on the asymptotic behavior of nonexpansive iterations
noninterference	(VeriSure) Implicit Assumptions in a Model for Separation Kernels
Noninterleaving semantics	(CSL-LICS) Equilibria of Concurrent Games on Event Structures
Nonlinear Real Arithmetic	(CAV) A Nonlinear Real Arithmetic Fragment (PAS) A note on real quantifier elimination by virtual term substitution of unbounded degree
nonmonotonic logic	(DL) WApproximation: computing approximate answers for ontological queries
nonmonotonic reasoning	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data (KR) First-Order Default Logic Revisited (DL) Rational closure in SHIQ (LATD) Qualified Syllogisms with Fuzzy Predicates (RCRA) Efficient Computation of the Well-Founded Semantics over Big Data (NMR) FO(C) and Related Modelling Paradigms (NMR) Nonmonotonic Reasoning as a Temporal Activity (NMR) Semantics and Compilation of Answer Set Programming with Generalized Atoms
Nonstandard Analysis	(LC) An axiomatic approach to modelling of orders of magnitude (LC) Reverse Mathematics, more explicitly (LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
Nontermination	(CAV) Proving Non-termination Using Max-SMT (VSTTE) Certification of Nontermination Proofs using Strategies and Nonlooping Derivations (WST) Geometric Series as Nontermination Arguments for Linear Lasso Programs
normal forms	(DL) Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
Normal modal logic	(UNIF) Unification in the normal modal logic Alt1
normal modal logics	(LC) On Hallden complete modal logics determined by homogeneous frames (ARW-DT) A Resolution-Based Prover for Normal Modal Logics
Normal multi-modal logics	(LC) On graph calculus approach to modalities
Normalisation	(CSL-LICS) Symmetric Normalisation for Intuitionistic Logic
Normalisation paths	(SD) Multiplicative Decomposition of Behaviours in Ludics
Normalization	(TermGraph) Needed Computations Shortcutting Needed Steps (IFIP-WG16) Basic Normalization
normalization equivalence	(IWC) Normalization Equivalence of Rewrite Systems
Normative reasoning	(KR) Aggregative Deontic Detachment for Normative Reasoning
notations	(Coq) Presentation of Three Neat Tricks in Coq 8.5
NP-completeness	(UNIF) Two-sided unification is NP-complete (SAT) Automatic Evaluation of Reductions between NP-complete Problems
Number Restrictions	(IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies
Numbers	(LC) Frege on mathematical progress
Numerical Accuracy	(NSV) Transformation of a PID Controller for Numerical Accuracy
numerical existence property	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Numerical representations	(ITP) Balancing lists: a proof pearl
Nuprl	(ITP) Towards a Formally Verified Proof Assistant
O
o-minimality	(LC) Definable topological dynamics and real Lie groups
OBDA	(DL) Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract (DL) A Stream-Temporal Query Language for Ontology Based Data Access
OBDA design tools	(DL) Visualization and management of mappings in ontology-based data access (progress report)
OBDD	(KR) On OBDDs for CNFs of Bounded Treewidth
Object Creation	(NMR) FO(C) and Related Modelling Paradigms
Object Oriented Design	(Isabelle) The CAVA Automata Library
object-oriented logic programming	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
Object-Oriented Programming	(ICLP) Customisable Handling of Java References in Prolog Programs
Observational Equivalence	(PSC) Observational Equivalence for Behavioural Differential Equations
Observational Semantics	(WPTE) Attractor Equivalence: An Observational Semantics for Reaction Networks
Observational Type Theory	(PSC) Observational Equivalence for Behavioural Differential Equations
OCaml	(ITP) Balancing lists: a proof pearl (PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
omega enumeration degrees	(LC) Embedding the omega-enumeration degrees into the Muchnik degrees generated by spectra of structures
Omega-automata	(CSL-LICS) Anchored LTL Separation
omega-stable structure	(LC) Reducts of simple (non-collapsed) Fraisse-Hrushovski constructions
one counter automata	(AISS) Simulation for infinite state systems.
one counter nets	(AISS) Simulation for infinite state systems.
One-Counter automata	(AISS) Simulation Over One-Counter Nets is PSPACE-Complete
online banking	(STAST) What You Enter Is What You Sign: input integrity in an online banking environment
ontological queries	(DL) WApproximation: computing approximate answers for ontological queries
Ontologies	(IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (DL) Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner (DL) An Empirical Investigation of Difficulty of Subsets of Description Logic Ontologies (DL) Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure? (DL) Controlled Query Evaluation over Lightweight Ontologies (DL) Datalog Rewriting Techniques for Non-Horn Ontologies (DL) Axiom Dependency Hypergraphs for Fast Modularisation and Atomic Decomposition (PRUV) Answering Ontological Ranking Queries Based on Subjective Reports (KR4HC) Real Rules, Real Data -- Addressing Challenges of Reasoning HIPAA Privacy Rule in Health Information Exchange (HIE) (iPRA) Resolution Based Uniform Interpolation for Expressive Description Logics
ontologies and linked data	(KR4HC) Towards Linked Vital Registration Data for Reconstituting Families and Creating Longitudinal Health Histories
ontology	(KR) Predicting Performance of OWL Reasoners: Locally or Globally? (IJCAR) Knowledge Engineering for Large Ontologies with Sigma KEE 3.0 (DL) Predicting OWL Reasoners: Locally or Globally? (PRUV) Multi-Attribute Decision Making using Weighted Description Logics (ICLP) The Impact of Disjunction on Reasoning under Existential Rules (ORE) A Family History Knowledge Base in OWL 2 (ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development
Ontology Based Data Access	(DL) Abstraction Refinement for Ontology Materialization (DL) XPath for DL-Lite Ontologies (DL) Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract (DL) Visualization and management of mappings in ontology-based data access (progress report)
ontology based query answering	(ORE) Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners
Ontology Change	(DL) Instance-driven TBox Revision in DL-Lite
Ontology Decomposition	(DL) DeaLing with Ontologies using CODs
ontology engineering	(DL) A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
ontology languages	(KR) Stable Model Semantics for Guarded Existential Rules and Description Logics (PRUV) Computing k-Rank Answers with Ontological CP-Nets
Ontology modularisation	(DL) Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies
ontology modularity	(DL) Query Inseparability by Games
Ontology Reasoning	(IJCAR) Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures
Ontology Repair	(DL) Towards Parallel Repair: An Ontology Decomposition-based Approach
Ontology-based data access	(CSL-LICS) On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Bounded Chase (DL) Hybrid Query Answering Over DL Ontologies (DL) Temporal OBDA with LTL and DL-Lite (DL) OBDA Using RL Reasoners and Repairing (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries (ORE) A Scalable Benchmark for OBDA Systems: Preliminary Report
Opaqueness	(NLCS) Proof-Theoretic Semantics for intensional transitive verbs
open street map	(ORE) Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners
Open-Source	(SAT) Open-WBO: a Modular MaxSAT Solver
open/closed world semantics	(KR) Certain Answers as Objects and Knowledge
OpenCL	(PLP) An OpenCL implementation of a forward sampling algorithm for CP-logic
operational semantics	(CHR) Constraint Handling Rules with Multiset Comprehension Patterns (CSL-LICS) Transition systems over games (FWFM) Using Esoteric Language for Teaching Formal Semantics (RTA-TLCA) All-Path Reachability Logic
Optimal Networks	(ParSearchOpt) A Constraint-based Parallel Local Search for Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem
Optimal strategy synthesis	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
optimisation	(LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain (DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
optimization	(ICLP) A Framework for Bottom-Up Simulation of SLD-Resolution (IJCAR) EL-ifying Ontologies (ASPOCP) ``Are Preferences Giving You a Headache?'' - ``Take asprin!'' (CICLOPS-WLPE) Towards Pre-Indexed Terms
optimizing compilers	(LOLA) A Cross-Language Framework for Verifying Compiler Optimizations (WPTE) Verifying Optimizations for Concurrent Programs
Orbits for functions in finite domains	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
order dimension	(LC) The order dimensions of degree structures
Ordered	(HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
Ordered Disjunction	(KR) Logic Programs with Ordered Disjunction: First-order Semantics and Expressiveness
Orderings	(WST) Another Proof for the Recursive Path Ordering
Orders of Magnitude	(LC) An axiomatic approach to modelling of orders of magnitude
ordinal analysis	(INFINITY) Systems of Strength H(1) (INFINITY) Power Kripke-Platek set theory, ordinal analysis and global choice
ordinal foundation	(LATD) Ordinal foundation for Lukasiewicz semantics
ordinal notation system	(LC) Provability logics and proof-theoretic ordinals
Ordinal notations	(LC) Ordinal Notations and Fundamental Sequences in Caucal Hierarchy
ordinal number	(ITP) Cardinals in Isabelle/HOL
Ordinals	(INFINITY) Analytic combinatorics of the transfinite (WST) To Infinity... and Beyond! (LATD) Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic sentences
ornament	(DTP) Relational ornaments
orthogonalisation	(HOR) Feebly not weakly
Orthogonality	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types (Linearity) Ludics without Designs I: Triads
OS FSM model	(PAS) VTOS: A Finite State Machine Model of OS and Formalized Verification of Its Microkernel
Otter	(IJCAR) Otter proofs of theorems in Tarskian geometry
overlay journals	(IFIP-WG16) Impacts of the Digital Revolution on two Main Activities of Scientists: Teaching and Publishing
OWA and CWA	(DL) WApproximation: computing approximate answers for ontological queries
OWL	(DL) OptiqueVQS: Visual Query Formulation for OBDA (DL) On Faceted Search over Knowledge Bases (DL) DIP: A Defeasible-Inference Platform for OWL Ontologies (DL) Controlled Query Evaluation over Lightweight Ontologies (ORE) Using OpenStreetMap Data to Create Benchmarks for Description Logic Reasoners (ORE) An update on Genomic CDS, a complex ontology for pharmacogenomics and clinical decision support
OWL 2 EL	(IJCAR) EL-ifying Ontologies
OWL 2 profiles	(DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
OWL 2 QL	(DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
OWL 2 reasoners	(ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development
OWL 2 RL	(DL) Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
OWL Reasoner	(ORE) TROvE: a Graphical Tool to Evaluate OWL Reasoners
OWLlink	(ORE) Mini-ME 2.0: powering the Semantic Web of Things
P
P-compatible identity	(LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras
p-simulation	(QBF) On the Relation between Resolution Calculi for QBFs and First-order Formulas
padlock	(STAST) Decision justifications for wireless network selection
pairwise rendezvous	(AISS) Parameterized Model Checking of Rendezvous Systems
Paracomplete	(LC) Towards a Conditional for The Liar and the Sorites.
paraconsistency	(LC) Explosiveness, Model Existence, and Incompatible Paraconsistencies
Paraconsistent Logic	(LATD) De Morgan logics with a notion of inconsistency (LG) Game Semantics for Some Non-Classical Logics
paraconsistent logics	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (LATD) A Semi-relevant, Paraconsistent Dual of {\L}ukasiewicz Logic
paraconsistent negation	(LATD) De Morgan logics with a notion of inconsistency
Paradox	(LC) Towards a Conditional for The Liar and the Sorites. (LC) On Bernays' Generalization of Cantor's Theorem
Paradoxes	(LATD) Truth degrees in the interval [-1,1] for the librationist system $\pounds$.
Parallel	(SAT) MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (SAT) Lazy clause exchange policy for parallel SAT solvers
Parallel Closedness Theorem	(IWC) Confluence and Critical-Pair-Closing Systems
parallel composition	(DTP) Relational ornaments
Parallel computation	(Coq) Asynchronous interaction for Coq
parallel computing	(CAV) GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
parallel deduction	(ARW-DT) The Leo-III Project
parallel evaluation	(DCM) Some observations for the parallel implementation of interaction nets
Parallel Local Search	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
parallel materialisation	(DL) Parallel OWL 2 RL Materialisation in Centralised, Main-Memory RDF Systems
parallel portfolio solver	(SMT) Multi-solver Support in Symbolic Execution
parallel programming	(CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs
Parallel Reasoning	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data (RCRA) Efficient Computation of the Well-Founded Semantics over Big Data
Parallel SAT solver	(SAT) Community Branching for Parallel Portfolio SAT Solvers
parallel satisfiability solver	(POS) Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
Parallel Solving	(ParSearchOpt) A Portfolio Based Parallel SAT Solver with Multiple Deletion Strategies
parallel substitutions	(Coq) Autosubst: Automation for de Bruijn Substitutions
Parallelism	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types (ParSearchOpt) A Constraint-based Parallel Local Search for Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem (ParSearchOpt) On the Parallelization of Randomized Propagation-based Constraint Solving
parallelization	(ASPOCP) Computing Answer Sets for Monadic Logic Programs via MapReduce
parameter estimation	(KR) Probabilistic Sentential Decision Diagrams
parameter synthesis	(ARW-DT) Modular Verification of Interconnected Families of Uniform Linear Hybrid Automata (HSB) Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
parameter-free induction	(PC) Parameter-free induction in bounded arithmetic
parameterised verification	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
parameterized communication topology	(CSL-LICS) Logic for Communicating Automata with Parameterized Topology
parameterized complexity	(SAT) Fixed-parameter tractable reductions to SAT (CSL-LICS) One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries (CSL-LICS) The Tractability Frontier of Graph-Like First-Order Query Sets (CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets (PCCR) Structural Decomposition Methods: How They Matter (PCCR) Backdoors to Planning (PCCR) Fixed-Parameter Algorithms for Reasoning Problems in NP and Beyond (PCCR) A Parameterized Complexity Analysis of Generalized CP-Nets (PCCR) Backdoors into Heterogeneous Classes of SAT and CSP
parameterized model checking	(FRIDA) Model-Checking of Parameterized Timed-Systems (FRIDA) Parameterized Synthesis (VSTTE) Model Checking Parameterized Timed Systems (AISS) Parameterized Model Checking of Rendezvous Systems
parameterized synthesis	(SYNT) Parameterized Synthesis Case Study: AMBA AHB
parametric comonads	(HOPA) The modal nature of colors in higher-order model-checking
parametric uniformity	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
Parametrized systems	(CAV) LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes
Parikh's theorem	(AISS) Of stacks (of stacks (...) with blind counters) with blind counters
parity games	(PC) Parity games and propositional proofs (CSL-LICS) Decomposition Theorems and Model-Checking for the Modal mu-calculus
Parser	(PSC) Extracting Monadic Parsers from Proofs
part-whole	(DTP) A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
Partial conservativity (of the theory T over the	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
partial correctness	(PAS) Programming Language Aggregation with Applications in Equivalence Checking
partial deduction	(ICLP) Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
partial derivatives	(ITP) Unified Decision Procedures for Regular Expression Equivalence
partial equivalence checking problem	(SAT) Fast DQBF Refutation
Partial Equivalence Relations	(ITP) Towards a Formally Verified Proof Assistant
partial evaluation	(ICLP) A Framework for Bottom-Up Simulation of SLD-Resolution
partial order reduction	(EC2) A new reduction for event-driven distributed programs (CAV) Diamonds are a Girl's Best Friend: Partial Order Reduction for Timed Automata With Abstractions
Partially Observable Markov Decision Processes	(NMR) Integrating Declarative Programming and Probabilistic Graphical Models for Knowledge Representation and Reasoning in Robotics
partially ordered set	(LATD) Embedding partially ordered sets into distributive lattices
Partially Ordered Sets	(CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets
passivation	(CSL-LICS) On the Discriminating Power of Passivation and Higher-Order Interaction
Passivization	(NLCS) Proof-Theoretic Semantics for intensional transitive verbs
Pastry	(FRIDA) Having SPASS with Pastry and TLA+
Path	(Linearity) Geometry of Resource Interaction – A Minimalist Approach
Path Based SCC Algorithms	(ITP) Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm
pattern	(HOR) Feebly not weakly
Pattern calculus	(PAS) Confluence of Pattern-Based Calculi with Finitary Matching
Pattern matching	(RTA-TLCA) Unnesting of Copatterns
patterns	(CSL-LICS) Pattern Logics and Auxiliary Relations
PCA	(KR) Predicting Performance of OWL Reasoners: Locally or Globally? (DL) Predicting OWL Reasoners: Locally or Globally?
PCFG	(PLP) Prefix and infix probability computation in PRISM
PCR	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) From Small Space to Small Width in Resolution (PC) Narrow Proofs May Be Maximally Long (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
PCTL	(CSL-LICS) Probably Safe or Live
PDL	(LC) On graph calculus approach to modalities
pdr	(CAV) SMT-based Model Checking for Recursive Programs
peak decreasingness	(ITP) A New and Formalized Proof of Abstract Completion
Pearl's virtual evidence method	(KR) Reasoning with Uncertain Inputs in Possibilistic Networks
Pebble walking automata	(CSL-LICS) Logical Characterization of Weighted Pebble Walking Automata
pedagogy	(ACL2) Data Definitions in ACL2 Sedan
peer-to-peer protocols	(FRIDA) Having SPASS with Pastry and TLA+
perfect Jonsson theory	(LC) On Jonsson sets and some their properties.
perfect masking	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks
Perfect MV-algebra	(LATD) On the Logic of Perfect MV-algebras
performance	(ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling (ITP) Experience Implementing a Performant Category-Theory Library in Coq
performance evaluation	(SMT) Multi-solver Support in Symbolic Execution
performance prediction	(KR) Predicting Performance of OWL Reasoners: Locally or Globally? (DL) Predicting OWL Reasoners: Locally or Globally?
Performance-Analysis	(FRIDA) Correctness and Performance Analysis of Distributed High Performance Programs in Scala
periodically iterated morphisms	(CSL-LICS) On Periodically Iterated Morphisms
Permissive-upgrade	(FCS-FCC) Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
Permutation Constraints	(POS) Incremental SAT-based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
permutation equivalence	(RTA-TLCA) Proof terms for infinitary rewriting
Permutation Flowshop Scheduling Problem	(RCRA) A Discrete Differential Evolution Algorithm for the Total Flowtime Flowshop Scheduling Problem
Permutation lemmas	(IJCAR) Quati: An Automated Tool for Proving Permutation Lemmas
Persistency	(RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
Personality Traits	(STAST) The Social Engineering Personality Framework
personalized PageRank	(PLP) PageRank, ProPPR and Stochastic Logic Programs
Petri nets	(KR) State-Boundedness for Decidability of Verification in Data-Aware Dynamic Systems (CAV) An SMT-Based Approach to Coverability Analysis (VPT) Branching Processes of Conservative Nested Petri Nets
PGAS	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
pGCL	(ITP) From Operational Models to Information Theory - Side-Channels in pGCL with Isabelle
pharmacogenomics	(ORE) An update on Genomic CDS, a complex ontology for pharmacogenomics and clinical decision support
Phase Conjugating Mirror	(ITP) Formal Verification of Optical Quantum Flip Gate
phase transitions	(INFINITY) Analytic combinatorics of the transfinite
Phase-bounded	(HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
Philosophy	(LC) C. I. Lewis' Influence on the Early Work of Emil Post
philosophy of mathematics	(LC) Computational reverse mathematics and foundational analysis (LC) Justifying proof-theoretic reflection principles
Physical systems verification	(HOL) Using HOL4 to Formalize Physical Systems
PIDE	(UITP) PIDE for Asynchronous Interaction with Coq
piecewise polynomial functions	(LATD) MV-algebras with product and the Pierce-Birkhoff conjecture
Pierce-Birkhoff conjecture	(LATD) MV-algebras with product and the Pierce-Birkhoff conjecture
pigeonhole principle	(PC) Quasipolynomial Size Frege Proofs of Frankl's Theorem on the Trace of Finite Sets (PC) Lower bounds for splittings by linear combinations (CSL-LICS) On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems
ping-pong protocols	(VPT) Verification of Multi-Party Ping-Pong Protocols via Program Transformation
PKCS#11	(ASA) Caetus tool
planning	(ICLP) Using Tabled Logic Programming to Solve the Petrobras Planning Problem (QUANTIFY) Encoding Reachability with Quantification (KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals (DL) Planning Problems for Graph Structured Data in Description Logics (PCCR) Backdoors to Planning (ARW-DT) (AI) Planning to Reconfigure your Robot? (ARW-DT) Using CSP Meta Variables in AI Planning
Planning and Pseudo-boolean Optimization	(KR) Heuristic Guided Optimization for Propositional Planning
Planning as Satisfiability	(KR) Heuristic Guided Optimization for Propositional Planning
planted distribution	(SAT) Approximating highly satisfiable random 2-SAT
Plausibility Rankings	(KR) Belief Change and Semiorders
pocrims	(LATD) On Pocrims and Hoops
pointer arithmetic	(IJCAR) Proving Termination and Memory Safety for Programs with Pointer Arithmetic
Pointer Machines	(RTA-TLCA) Unification and Logarithmic Space
polarisation	(CSL-LICS) Formulae-as-Types for an Involutive Negation
policy composition	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
policy iteration	(NSV) Policy iteration in finite templates domain
Polish groups	(LC) Consequences of the existence of ample generics and automorphism groups of homogeneous metric structures
Polish structure	(LC) Topologies on Polish structures
Polya	(ITP) A heuristic prover for real inequalities
polyhedral geometry	(LATD) The space of directions of a polyhedron (LATD) Interpreting Lukasiewicz logic into Intuitionistic logic
Polymer Reaction Network	(VEMDP) Verifying Polymer Reaction Networks using Bisimulation
polymorphic typing	(WPTE) Contextual Equivalences in Call-by-Need and Call-By-Name Polymorphically Typed Calculi (Preliminary Report)
polymorphism	(CSL-LICS) System F with Coercion Constraints (CSL-LICS) Deadlock and lock freedom in the linear pi-calculus (ACL2) Data Definitions in ACL2 Sedan (ACL2) Polymorphic Types In ACL2 (SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism (LFMTP) A Framework for Implementing Logical Frameworks (PAAR) Polymorphic+Typeclass Superposition
polynomial	(Isabelle) Towards abstract and executable multivariate polynomials in Isabelle
polynomial approximations	(ACL2) Formal Verification of Medina's Sequence of Polynomials for Approximating Arctangent
polynomial calculus	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) From Small Space to Small Width in Resolution (PC) Narrow Proofs May Be Maximally Long (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
polynomial constraints	(SMT) raSAT: SMT for Polynomial Inequality
Polynomial Contraints	(SAT) Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
Polynomial extension	(LATD) Densification via polynomial extensions
Polynomial Hierarchy	(KR) The Parameterized Complexity of Reasoning Problems Beyond NP (SAT) Fixed-parameter tractable reductions to SAT
polynomial interpretations	(RTA-TLCA) Amortised Resource Analysis and Typed Polynomial Interpretations
Polynomial runtime complexity	(TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion
polynomial space	(SAT) Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
polynomial systems	(HSB) Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
polynomial time	(CLC) Stratified Nested Linear Logic (INFINITY) Set functions with small circuits (INFINITY) Cobham Recursive Set Functions
polynomial time algorithm	(SAT) Solving MaxSAT and #SAT on structured CNF formulas
poplmark	(LFMTP) Variable Arity for LF
population size in relational models	(KR) Relational Logistic Regression
Porfolio	(POS) Instance-based Selection of CSP Solvers using Short Training
Portability	(CICLOPS-WLPE) A Portable Prolog Predicate for Printing Rational Terms
Portfolio	(SAT) Community Branching for Parallel Portfolio SAT Solvers
Portfolio Solving	(ICLP) claspfolio 2: Advances in Algorithm Selection for Answer Set Programming
Posets	(LC) Canonical extensions and prime filter completions of poset expansions.
Possibilistic networks	(KR) Reasoning with Uncertain Inputs in Possibilistic Networks
PosSLP	(CSL-LICS) On the Computing Power of +, −, and ×
power analysis	(ASA) Nuances of the JavaCard API on the cryptographic smart cards - JCAlgTest project
Power Kripke-Platek set theory	(INFINITY) Power Kripke-Platek set theory, ordinal analysis and global choice
Power managment designs	(SAT) Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
PP	(LCC) Towards recursion schemata for the probablistic class PP
predicate abstraction	(CAV) Property-Directed Shape Analysis (RTA-TLCA) Predicate Abstraction of Rewrite Theories
predicate discovery	(FWFM) Chekofv: Crowd-sourced Formal Verification
predicate transformer	(PAS) New predicate transformer for symbolic modeling
Predicative mathematics	(LC) Predicative Mathematics via Safety Relations
predicativity	(RTA-TLCA) The Structural Theory of Pure Type Systems
predictive analytics	(NLSR) Exposing Predictive Analytics through Natural Language Dialog
Preference	(KR) Logic Programs with Ordered Disjunction: First-order Semantics and Expressiveness
Preference based Argumentation	(NMR) Non-Monotonic Reasoning and Story Comprehension
preference handling	(ASPOCP) ``Are Preferences Giving You a Headache?'' - ``Take asprin!''
preferences	(SAT) On Computing Preferred MUSes and MCSes (PRUV) Answering Ontological Ranking Queries Based on Subjective Reports
preferences on rules	(NMR) A Family of Descriptive Approaches To Preferred Answer Sets
Preferential	(DL) DIP: A Defeasible-Inference Platform for OWL Ontologies
preferred answer sets	(NMR) A Family of Descriptive Approaches To Preferred Answer Sets
prefix grammar	(VPT) Verification of Multi-Party Ping-Pong Protocols via Program Transformation
prefix probability	(PLP) Prefix and infix probability computation in PRISM
pregeometries	(LC) Pregeometries and definable groups
Pregeometry	(LC) Reducts of simple (non-collapsed) Fraisse-Hrushovski constructions
Pregroups	(NLCS) Computing Italian clitic and relative clauses with tupled pregroups
premature convergence	(RCRA) An Enhanced Genetic Algorithm of the BLF2G Guillotine Placement Heuristic for the Orthogonal Cutting-Stock Problem
Preorders	(KR) Belief Change and Semiorders
preprocessing	(IJCAR) A Unified Proof System for QBF Preprocessing (SAT) Conditional Lower Bounds for Failed Literals and Related Techniques (SAT) Detecting cardinality constraints in CNF
Presburger arithmetic	(CSL-LICS) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
preservation	(CSL-LICS) Effective Interpolation and Preservation in Guarded Logics
preservation theorems	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
preserving soundness	(KR) Simultaneous Learning and Prediction
presheaf	(CSL-LICS) Transition systems over games
Presheaf semantics	(RTA-TLCA) Local stores in string diagrams
primal infon logic	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi
prime critical pairs	(ITP) A New and Formalized Proof of Abstract Completion
prime implicates	(IJCAR) A Rewriting Strategy to Generate Prime Implicates in Equational Logic (PAAR) A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses
prime impliquates	(PAAR) A Deductive-Complete Constrained Superposition Calculus for Ground Flat Equational Clauses
prime network	(KR) On Redundant Topological Constraints (Extended Abstract)
Primitive Conditional Connective	(LC) Adding a Conditional to Kripke's Theory of Truth
PRISM	(PLP) Exploring probabilistic grammars of symbolic music using PRISM
Privacy	(DL) Controlled Query Evaluation over Lightweight Ontologies (CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
Privacy & Information Flow	(CSL-LICS) Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties
privacy foundation	(CSF) Malleable Signatures: New Definitions and Delegatable Anonymous Credentials
Privacy policy compliance	(CAV) Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
Probabilistic Abstract Interpretation	(SYNT) Program Synthesis and Linear Operator Semantics
Probabilistic BMC	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
probabilistic classes of computational complexity	(LCC) Towards recursion schemata for the probablistic class PP
probabilistic conditional	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
Probabilistic Description Logic	(DL) Bayesian Description Logics
Probabilistic grammar	(PLP) Exploring probabilistic grammars of symbolic music using PRISM
Probabilistic hybrid automaton	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
Probabilistic Inductive Logic Programming Statistical Relational Learning	(NMR) Probabilistic Inductive Logic Programming based on Answer Set Programming
probabilistic logic	(KR) Linear Programs for Measuring Inconsistency in Probabilistic Logics (LC) Models for the probabilistic sequent calculus (PLP) Approximated Probabilistic Answer Set Programming
Probabilistic Logic Programming	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming (ICLP) Adaptive MCMC-Based Inference in Probabilistic Logic Programs (PLP) Lifted Inference for Probabilistic Logic Programs (PLP) cProbLog: Restricting the Possible Worlds of Probabilistic Logic Programs
Probabilistic Logic Programs	(PLP) Compiling Probabilistic Logic Programs into Sentential Decision Diagrams
probabilistic logics	(KR) Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation
Probabilistic Model Checking	(VeriSure) Assurance of some system reliability characteristics in formal design verification (RCRA) Evaluating Probabilistic Model Checking Tools for Verification of Robot Control Policies
Probabilistic Model Checking Case Studies	(RCRA) Evaluating Probabilistic Model Checking Tools for Verification of Robot Control Policies
probabilistic models	(KR) Probabilistic Sentential Decision Diagrams (FCS-FCC) Adversary Gain vs. Defender Loss in Quantified Information Flow
Probabilistic Program Semantics	(SYNT) Program Synthesis and Linear Operator Semantics
probabilistic programming	(DCM) Differential privacy at work: Verification of approximate probabilistic programs and models for choosing epsilon
probabilistic reasoning	(DL) Reasoning about Belief Uncertainty in DL-Lite N bool (PRUV) A New DL‐Lite N Bool Probabilistic Extension Using Belief (ICLP) Reasoning with Probabilistic Logics
probabilistic satisfiability (PSAT)	(PLP) Approximated Probabilistic Answer Set Programming
probabilistic systems	(CAV) CEGAR for Qualitative Analysis of Probabilistic Systems (CSL-LICS) On the Total Variation Distance of Labelled Markov Chains
probability	(CSL-LICS) Probably Safe or Live (DCM) Probabilistic Types and Function Overloading
probability box	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
Proble-specific Solver	(LaSh) Logical Machinery of Heuristics (Preliminary Report)
problem libraries	(ARQNL) Problem Libraries for Non-Classical Logics
ProbLog	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming (PLP) cProbLog: Restricting the Possible Worlds of Probabilistic Logic Programs
procedural attachment	(NLSR) Natural Language Access to Data
Procedural knowledge Representation	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
procedural program	(WST) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants
procedural semantics	(ASPOCP) Query Answering in Resource-Based Answer Set Semantics
Process Adaptation	(KR) SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning
process algebra	(ITP) Showing invariance compositionally for a process algebra for network protocols
Process Calculi	(CSF) Automated Generation of Attack Trees (WPTE) Structural Rewriting in the Pi-Calculus
process calculus	(CLC) A proof-theoretic view on scheduling in concurrency
Process Engineering	(FWFM) Towards the Application of Formal Methods in Process Engineering
Process Modelling	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
process visualization	(KR4HC) Process Information and Guidance Systems in the Hospital
producer/consumer model	(Linearity) A Linear/Producer/Consumer model of Classical Linear Logic
Product logic	(LATD) Axiomatising a fuzzy modal logic over the standard product algebra
Product Modal Logics	(KR) Lightweight Description Logics and Branching Time: a Troublesome Marriage
Product Programs	(CSF) Proving differential privacy in Hoare logic
Product Update	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
production rule systems	(ICLP) Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R
PROforma	(KR4HC) An Algorithm for Guideline Transformation: from BPMN to PROforma
program analysis	(IJCAR) Proving Termination and Memory Safety for Programs with Pointer Arithmetic (IJCAR) Proving Termination of Programs Automatically with AProVE (WING) ALICe: A Framework to Improve Affine Loop Invariant Computation (WST) Fairness for Infinite-State Systems (WPTE) A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (VPT) A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? (VPT) On Unfolding for Programs Using Strings as a Data Type
program debugging	(NMR) Interactive Debugging of ASP Programs
program equivalence	(RTA-TLCA) A Model of Countable Nondeterminism in Guarded Type Theory (ARW-DT) Automating Regression Verification
Program extraction	(PSC) Program extraction in Church's simple theory of types (invited talk)
Program Logic	(CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs
program logics	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
program refactoring	(UNIF) Two-sided unification is NP-complete
Program repair	(CAV) Regression-free Synthesis for Concurrency
program schematology	(CSL-LICS) KAT + B!
program semantics	(KR) A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations
program specialization	(VPT) A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? (VPT) On Unfolding for Programs Using Strings as a Data Type
program synthesis	(CAV) Optimal Guard Synthesis for Memory Safety (CAV) A Conference Management System with Verified Document Confidentiality (CAV) Regression-free Synthesis for Concurrency (SYNT) Program Synthesis and Linear Operator Semantics
program transformation	(NSV) Certifying Square Root and Division Elimination (IWC) On Proving Confluence of Conditional Term Rewriting Systems via the Computationally Equivalent Transformation (CAV) Don't sit on the fence: A static analysis approach to automatic fence insertion (CSL-LICS) KAT + B! (WST) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (WPTE) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting (WPTE) Inverse Unfold Problem and Its Heuristic Solving (VPT) A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? (VPT) On Unfolding for Programs Using Strings as a Data Type (VPT) Program Verification using Constraint Handling Rules and Array Constraint Generalizations (VERIFY) Introducing a Sound Deductive Compilation Approach
program transformations	(LOLA) A Cross-Language Framework for Verifying Compiler Optimizations (FWFM) Algebraic description of restricted programming and elements of its logics (WPTE) Verifying Optimizations for Concurrent Programs
program verification	(ICLP) Abstract Diagnosis for tccp using a Linear Temporal Logic (KR) A Formalization of Programs in First-Order Logic with a Discrete Linear Order (CAV) ICE: A Robust Learning Framework for Synthesizing Invariants (CAV) Shape Analysis via Second-Order Bi-Abduction (UNIF) Unification Modulo Common List Functions (VeriSure) Human-Computer Interaction and the Formal Certification and Assurance of Medical Devices: The CHI+MED Project (LC) Completeness of second-order separation logic for program verification (Coq) Automating Abstract Logics (WING) A Theorem Prover Backed Approach to Array Abstraction (Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work) (VPT) Program Verification using Constraint Handling Rules and Array Constraint Generalizations (RTA-TLCA) All-Path Reachability Logic (ARW-DT) Combined Reasoning with Sets and Aggregation Functions (VERIFY) Typed First-Order Logic
program verification in Coq	(VSTTE) A certifying frontend for (sub)polyhedral abstract domains
programmable gates	(DCM) Quantum Circuits for the Unitary Permutation Problem
Programmable logic controllers	(CAV) G4LTL-ST: Automatic Generation of PLC Programs
programming	(ICLP) Incremental Tabling for Knowledge Representation and Reasoning (DTP) Tool Demonstration: An IDE for Programming and Proving in Idris
programming framework	(EC2) Group Communication Patterns for High Performance Computing in Scala
Progression	(ICLP) Simulating Dynamic Systems Using Linear Time Calculus Theories (KR) Action Theories over Generalized Databases with Equality Constraints (Extended Abstract)
progression of basic action theories	(KR) On the Progression of Knowledge in Multiagent Systems (KR) How To Progress Beliefs in Continuous Domains
Projection	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving (KR) Transforming Situation Calculus Action Theories for Optimised Reasoning (iPRA) Application Patterns of Projection/Forgetting
projective determinacy	(LC) Co-analytic ideals on $\omega$
projective plane	(LC) The isomorphism problem for computable projective planes
projective unification	(LC) Almost structurally complete consequence operations extending S4.3
Prolog	(ICLP) Customisable Handling of Java References in Prolog Programs (IJCAR) Proving Termination of Programs Automatically with AProVE (ICLP) Reasoning with Probabilistic Logics (CICLOPS-WLPE) Extending the Finite Domain Solver of GNU Prolog (CICLOPS-WLPE) Towards Pre-Indexed Terms (CICLOPS-WLPE) SWI-Prolog version 7 extensions (CICLOPS-WLPE) A Portable Prolog Predicate for Printing Rational Terms
Prolog implementation	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
Prolog System	(ICLP) Towards an Efficient Prolog System by Code Introspection
Prolog to Java translation	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
proof	(NLCS) Program Extraction Applied to Monadic Parsing (HOL) New Styles of Proof (PAS) Synthesis of Algorithms on Sets Represented as Monotone Lists
proof assistants	(Vampire) My Life with an Automatic Theorem Prover (LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
proof automation	(Coq) Towards a better-behaved unification algorithm for Coq (ITP) An Isabelle Proof Method Language (HOL) Writing proof automation for HOL4
proof calculus	(ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems
proof checker	(FWFM) An Example Demonstrating the Requirement of Fully Formal Verification Method
proof checking	(IJCAR) A Unified Proof System for QBF Preprocessing (SAT) DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
proof complexity	(IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (SAT) QBF Resolution Systems and their Proof Complexities (SAT) Unified characterisations of resolution hardness measures (LC) The relation between the graphs structures and proof complexity of corresponding Tseitin graph tautologies (PC) From Small Space to Small Width in Resolution (PC) Narrow Proofs May Be Maximally Long (PC) Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (PC) Size-Space Bounds and Trade-offs for CDCL Proofs (CSL-LICS) On the Pigeonhole and Related Principles in Deep Inference and Monotone Systems (NMR) Tableau vs. Sequent Calculi for Minimal Entailment (ARW-DT) Extended Resolution in Modern SAT Solving
proof complexity of strong equal tautologies	(LC) On proof complexities of strong equal modal tautologies.
proof compression	(IJCAR) Introducing quantified cuts in logic with equality (IJCAR) Skeptik [System Description]
proof construction	(RTA-TLCA) Construction of retractile proof structures
proof equivalence problem	(CSL-LICS) No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
proof mining	(LC) Effective results on the asymptotic behavior of nonexpansive iterations
proof net	(SD) First-order Proofs Without Syntax: Summary of Work in Progress
proof nets	(GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress) (CSL-LICS) A new correctness criterion for MLL proof nets (CSL-LICS) No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete (SD) A Correctness Criterion Free from Switchings (RTA-TLCA) Construction of retractile proof structures
proof nets retraction	(RTA-TLCA) Construction of retractile proof structures
Proof Obligations	(VSTTE) A Model for Capturing and Replaying Proof Strategies
Proof of topological properties	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
Proof of total correctness	(ITP) Hypermap Specification and Certified Linked Implementation using Orbits
Proof Patterns	(VSTTE) A Model for Capturing and Replaying Proof Strategies
Proof pearl	(ITP) Balancing lists: a proof pearl
proof procedure	(KR) Constructive Negation in Extensional Higher-Order Logic Programming
proof procedure language	(ITP) An Isabelle Proof Method Language
proof search	(IJCAR) A Focused Sequent Calculus for Higher-Order Logic (LATD) Poof Search and Co-NP completeness for Many-Valued Logics (ARQNL) Dialogues for proof search (RTA-TLCA) Construction of retractile proof structures (ARW-DT) Socratic Proofs for Propositional Linear-Time Logic
Proof strategy language	(UITP) Tinker, tailor, solver, proof
proof systems of modal propositional logic	(LC) On proof complexities of strong equal modal tautologies.
proof terms	(RTA-TLCA) Proof terms for infinitary rewriting
proof theory	(ICLP) A Proof Theoretic Study of Soft Concurrent Constraint Programming (CLC) A proof-theoretic view on scheduling in concurrency (GSB) Sequent Systems for Classical Modal Logics (IJCAR) Quati: An Automated Tool for Proving Permutation Lemmas (LC) Provability logics and proof-theoretic ordinals (LC) Display-type calculi for non classical logics (CSL-LICS) Formulae-as-Types for an Involutive Negation (UITP) Advanced Proof Viewing in PROOFTOOL (LATD) Poof Search and Co-NP completeness for Many-Valued Logics (LATD) Undecidability of consequence relation in Full Non-associative Lambek Calculus (RTA-TLCA) Unification and Logarithmic Space
proof-net	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
proof-nets	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (CSL-LICS) The Geometry of Synchronization (Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
Proof-Patterns	(Coq) Proof-Pattern Search in Coq/SSReflect
proof-search	(PSC) Proof-search in natural deduction calculi for IPL
proof-structure	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
Proof-theoretic methods	(LC) Predicate Glivenko theorems and substructural aspects of negative translations
Proof-Theoretic Semantics	(NLCS) Proof-Theoretic Semantics for intensional transitive verbs
proof-theory	(LFMTP) Proof-Theoretic Foundations of Indexing in Logic Programming (Linearity) Ludics without Designs I: Triads
Proofs	(Vampire) Proofs in Vampire (POS) Post Mortem Analysis of SAT Solver Proofs
proofs without syntax	(SD) First-order Proofs Without Syntax: Summary of Work in Progress
PROP	(WST) Ordering Networks
PROP quasi-order	(WST) Ordering Networks
properties of graph structures	(LC) The relation between the graphs structures and proof complexity of corresponding Tseitin graph tautologies
property based testing	(Coq) QuickChick: Property-Based Testing for Coq
Property Directed Reachability	(CAV) Interpolating Property Directed Reachability
property-driven	(CAV) SMT-based Model Checking for Recursive Programs
Property-Driven Reachability	(CAV) Lazy Annotation Revisited (iPRA) Interpolation Strategies
propositional assignments	(KR) Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments
propositional closure	(KR) Belief Revision in the Propositional Closure of a Qualitative Algebra
Propositional dynamic logic	(ADDCT) Decidability of Iteration-free PDL with Parallel Composition
propositional logic	(LATD) A method for generalizing finite automata arising from Stone-like dualities
propositional logics	(IJCAR) QBF Encoding of Temporal Properties and QBF-Based Verification (DCM) Propositional Logics Complexity and the sub-formula Property
Propositional model counting	(SAT) Hypergraph Acyclicity and Propositional Model Counting
Propositional Normal Modal logics	(IJCAR) Clausal Resolution for Modal Logics of Confluence
Propositional proof system	(ARW-DT) Extended Resolution in Modern SAT Solving
Propositional Resolution	(IJCAR) Skeptik [System Description]
Propositional Satisfiability	(ParSearchOpt) A Portfolio Based Parallel SAT Solver with Multiple Deletion Strategies
ProPPR	(PLP) PageRank, ProPPR and Stochastic Logic Programs
Protege	(DL) DIP: A Defeasible-Inference Platform for OWL Ontologies
proto-differential nets	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
proto-net	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
proto-Taylor expansion	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
Protoalgebraic logics	(LATD) Generalizing the Leibniz and Suszko operators
protocol analysis	(CSF) Modeling Diffie-Hellman Derivability for Automated Analysis
Protocol Security	(FCS-FCC) Towards Timed Models for Cyber-Physical Security Protocols
Protocol Suite	(CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
protodisjunction	(LATD) Definability of truth predicates in abstract algebraic logic
Provability Logic	(LC) On Explicit-Implicit Reflection Principles.
provenance	(PAAR) Razor: Provenance and Exploration in Model-Finding
Prover IDE	(UITP) System description: Isabelle/jEdit in 2014 (Isabelle) Isabelle/jEdit NEWS
proving	(DTP) Tool Demonstration: An IDE for Programming and Proving in Idris
Pseudo-algebraically non-separable closed fields	(LC) Around n-dependent fields
pseudo-antichain	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
pseudo-Boolean Constraints	(SAT) Simplifying Pseudo-Boolean Constraints in Residual Number Systems
pseudofinite	(LCC) Infinite AC0 Circuits for Parity
pseudorandom constructions	(PC) Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
PSPACE-complete	(DCM) Propositional Logics Complexity and the sub-formula Property
psychological validation	(KR) A Psychology-Inspired Approach to Automated Narrative Text Comprehension
PTIME dialects	(DL) Pushing the CFDnc Envelope
PTQ-fragment	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
Public key crypto	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
Pudlak rules	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
pure lambda-calculus	(CSL-LICS) On the characterization of models of H*
Pure method calls	(VSTTE) A logical analysis of framing for specifications with pure method calls
Pure Nash Equilibria	(KR) Using Answer Set Programming for Solving Boolean Games
Pure Type Systems	(RTA-TLCA) The Structural Theory of Pure Type Systems
pushdown automata	(AISS) Unary Pushdown Automata and Straight-Line Programs (AISS) Of stacks (of stacks (...) with blind counters) with blind counters (CSL-LICS) Infinite-State Energy Games
Pushdown Systems	(AISS) Quantitative Automatic Structures (CSL-LICS) Senescent Ground Tree Rewrite Systems (HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
Q
Q-resolution	(SAT) Variable Dependencies and Q-Resolution (PC) Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction (QBF) Resolution Paths and Term Resolution
QBF	(QUANTIFY) Encoding Reachability with Quantification (CAV) Solving Games without Controllable Predecessor (IJCAR) A Unified Proof System for QBF Preprocessing (SAT) MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (QBF) Efficient Extraction of QBF (Counter)models from Long-Distance Resolution Proofs (SYNT) Synthesis of a simple self stabilizing system (DL) Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies (POS) iDQ: Instantiation-Based DQBF Solving
QBF of bounded treewidth	(SAT) Fixed-parameter tractable reductions to SAT
QBF-solver	(SAT) Dominant Controllability Check Using QBF-Solver and Netlist Optimizer
Qualified syllogisms	(LATD) Qualified Syllogisms with Fuzzy Predicates
qualitative algebras	(KR) Belief Revision in the Propositional Closure of a Qualitative Algebra
qualitative constraint networks	(KR) On Redundant Topological Constraints (Extended Abstract)
Qualitative reasoning	(ADDCT) On dual tableau-based decision procedures for relational fragments
qualitative spatial reasoning	(KR) Qualitative Spatial Representation and Reasoning in Angry Birds: the Extended Rectangle Algebra (KR) On Redundant Topological Constraints (Extended Abstract)
quantified Boolean formula	(QUANTIFY) Encoding Reachability with Quantification (SAT) QBF Resolution Systems and their Proof Complexities
Quantified Boolean Formulas	(SAT) Variable Dependencies and Q-Resolution
quantified constraint satisfaction	(PC) Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
quantified dynamic logic	(ARQNL) A Logic for Verifying Metric Temporal Properties in Distributed Hybrid Systems
Quantified Formulas	(QUANTIFY) Finding Conflicting Instances of Quantified Formulas in SMT
quantifier elimination	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving (CAV) SMT-based Model Checking for Recursive Programs (LC) On various strengthenings of the notion of indivisibility (SMT) Towards Conflict-Driven Learning for Virtual Substitution (PAS) A note on real quantifier elimination by virtual term substitution of unbounded degree
quantifier instantiation	(PAAR) A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories
quantifier-free	(SMT) Weakly Equivalent Arrays
Quantifiers	(GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress) (SMT) Decision Procedures for Flat Array Properties
quantifiers and theories	(CAV) AVATAR: The New Architecture for First-Order Theorem Provers
Quantitative analysis	(CSL-LICS) Regular Combinators for String Transformations
quantitative information flow	(FCS-FCC) Adversary Gain vs. Defender Loss in Quantified Information Flow (SMT) Speeding Up SMT-Based Quantitative Program Analysis (CSF) Additive and multiplicative notions of leakage, and their capacities
Quantitative Model-Checking	(CSL-LICS) Asymptotic behaviour in temporal logic
quantitative objectives	(CSL-LICS) Secure Equilibria in Weighted Games
Quantitative security	(CSF) Automated Generation of Attack Trees
Quantitative semantics	(ITRS) Indexed linear logic and higher-order model checking (SD) Weak topologies for Linear Logic
quantitative synthesis	(CSL-LICS) Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
quantitative systems	(AISS) Quantitative Automatic Structures
quantum circuits	(DCM) Quantum Circuits for the Unitary Permutation Problem
quantum computation	(CSL-LICS) The Geometry of Synchronization
Quantum Computing	(Linearity) Wave-Style Token Machines and Quantum Lambda Calculi (DCM) Quantum Circuits for the Unitary Permutation Problem
Quantum Flip Gate	(ITP) Formal Verification of Optical Quantum Flip Gate
Quantum Optics	(ITP) Formal Verification of Optical Quantum Flip Gate
Quasi-Invariants	(CAV) Proving Non-termination Using Max-SMT
quasi-varieties	(LC) Almost structurally complete consequence operations extending S4.3
quasiminimal structures	(LC) Quasiminimal structures and excellence
quasivarieties	(LATD) Relatively filtral quasivarieties
Quasivariety	(LATD) Quasivarieties of MV-algebras and structurally complete Lukasiewicz logics
quaternion	(LC) Truth theory for logic of self-reference statements as a quaternion structure
query answering	(ICLP) Anytime Computation of Cautious Consequences in Answer Set Programming (KR) Polynomial Combined Rewritings for Existential Rules (KR) Finite Model Reasoning in Horn Description Logics (KR) Query Inseparability for Description Logic Knowledge Bases (DL) Hybrid Query Answering Over DL Ontologies (DL) Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner (DL) Practical query answering over Hi (DL-LiteR) knowledge bases (DL) Query Inseparability by Games (DL) OBDA Using RL Reasoners and Repairing (DL) XPath for DL-Lite Ontologies (DL) Certain Answers in a Rough World (DL) Controlled Query Evaluation over Lightweight Ontologies (DL) Datalog Rewriting Techniques for Non-Horn Ontologies (ICLP) The Impact of Disjunction on Reasoning under Existential Rules (ORE) A Scalable Benchmark for OBDA Systems: Preliminary Report
query entailment	(KR) Nested Regular Path Queries in Description Logics
Query Evaluation	(ICLP) Adaptive MCMC-Based Inference in Probabilistic Logic Programs (KR) Certain Answers as Objects and Knowledge
query generation	(ASPOCP) Interactive Query-based Debugging of ASP Programs
query languages	(ICLP) Pengines: Web Logic Programming Made Easy (DL) How to Best Nest Regular Path Queries
query optimization	(iPRA) On Enumerating Query Plans via Interpolants from Tableau Proofs (abstract)
query plan generation	(iPRA) On Enumerating Query Plans via Interpolants from Tableau Proofs (abstract)
query rewriting	(KR) Polynomial Combined Rewritings for Existential Rules (DL) Temporal OBDA with LTL and DL-Lite (DL) OBDA Using RL Reasoners and Repairing (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries (DL) Query Rewriting under EL TBoxes: Efficient Algorithms (ARW-DT) Second-Order Characterizations of Definientia in Formula Classes (iPRA) Application Patterns of Projection/Forgetting
question answering	(NLSR) Natural Language Access to Data
quickcheck	(Coq) QuickChick: Property-Based Testing for Coq (ASA) Well-typed generic smart-fuzzing for APIs
R
R-calculus	(PAS) RCK: A Software Toolkit for R-calculus
R-Mingle	(LATD) Bases for admissible rules for fragments of RMt
r.e. degrees	(LC) A non-uniqueness theorem for jumps of principal ideals
Ramsey null	(LC) A descriptive set theoretical axiomatization of the Mathias model.
Ramsey Theorem	(PSC) Effective Bounds on the Podelski-Rybalchenko Termination Theorem
Ramsey theory	(LC) Budding Trees (LC) Generalized Ellentuck spaces and initial Tukey chains of non-p-points
Random CNFs	(PC) Total Space in Resolution
random satisfiability	(SAT) Approximating highly satisfiable random 2-SAT
random testing	(Coq) QuickChick: Property-Based Testing for Coq
random walks	(DCM) Interactive Particle Systems and Random Walks on Hypergraphs
Randomized Bubble Sort	(RCRA) A Discrete Differential Evolution Algorithm for the Total Flowtime Flowshop Scheduling Problem
Randomized Search	(ParSearchOpt) On the Parallelization of Randomized Propagation-based Constraint Solving
Randomness	(LC) A sheaf model of randomness (LC) Randomness in the Weihrauch degrees
rank	(PC) Narrow Proofs May Be Maximally Long
Ranking Function	(WST) To Infinity... and Beyond!
ranking queries	(PRUV) Answering Ontological Ranking Queries Based on Subjective Reports
ranking semantics	(NMR) A Plausibility Semantics for Abstract Argumentation Frameworks
rational closure	(DL) Rational closure in SHIQ
rational relations	(CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics
Rational Terms	(ICLP) Tabling, Rational Terms, and Coinduction Finally Together! (CICLOPS-WLPE) A Portable Prolog Predicate for Printing Rational Terms
rationality	(KR) Axiomatizing Rationality
RDF	(DL) OptiqueVQS: Visual Query Formulation for OBDA (DL) On Faceted Search over Knowledge Bases
RDFS	(DL) SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
RDMA	(ParSearchOpt) Towards a Parallel Hierarchical Adaptive Solver Tool
reachability	(QUANTIFY) Encoding Reachability with Quantification (DTP) Sequential decision problems and a computational theory of avoidability (CSL-LICS) Zero-Reachability in Probabilistic Multi-Counter Automata (CSL-LICS) Senescent Ground Tree Rewrite Systems (IFIP-WG16) Rewriting, Proofs and Transition Systems
reachability analysis	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections (HSB) Exploiting the eigenstructures of linear systems to speed up reachability computation
Reachability assertions	(DL) Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
reachability games	(iPRA) Interpolants in Two-Player Games
Reachability problem	(RTA-TLCA) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
Reaction enumerator	(VEMDP) A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures
Reaction Networks	(WPTE) Attractor Equivalence: An Observational Semantics for Reaction Networks
Reactive reasoning	(ICLP) Clingo = ASP + Control
reactive synthesis	(FRIDA) Parameterized Synthesis (CAV) Solving Games without Controllable Predecessor (SYNT) Low-effort Specification Debugging and Analysis (SYNT) Parameterized Synthesis Case Study: AMBA AHB (SYNT) How to Handle Assumptions in Synthesis
reactive systems	(ICLP) Transaction Logic with (Complex) Events (ITP) Showing invariance compositionally for a process algebra for network protocols (CSF) Provably Sound Browser-Based Enforcement of Web Session Integrity
real algebra	(PAS) A note on real quantifier elimination by virtual term substitution of unbounded degree
real analyis	(DTP) Domain Specific Languages of Mathematics
real analysis	(ACL2) Equivalence of the Traditional and Non-Standard Definitions of Concepts from Real Analysis
real closed exponential field	(INFINITY) Computing a floor function
real closed field	(INFINITY) Computing a floor function
Real fields	(LC) Differential Galois theory in the class of formally real fields.
real inequalities	(ITP) A heuristic prover for real inequalities
Real number computation	(NSV) Certifying Square Root and Division Elimination
Real Turing Machine	(CSL-LICS) On the Computing Power of +, −, and ×
real-time	(VSTTE) Model Checking Parameterized Timed Systems
real-time systems	(FRIDA) Model-Checking of Parameterized Timed-Systems
real-time verification	(VSTTE) Timed Refinements for Verification of Real-Time Object Code Programs
realizability	(CLC) A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle (CAV) Safraless Synthesis for Epistemic Temporal Specifications (LC) Reductions in computability theory from a constructive point of view (PSC) Program extraction in Church's simple theory of types (invited talk) (WWV) A Local Logic for Realizability in Web Service Choreographies (NMR) Compact Argumentation Frameworks
Realizability semantics	(PSC) Intuitionistic Ancestral Logic
realization	(PSC) Multi-agent justification logic
reals	(LC) Synthesis for monadic logic over the reals (LC) Cardinal invariants and template iterations (INFINITY) Computing a floor function
reasoner	(KR) Predicting Performance of OWL Reasoners: Locally or Globally? (DL) Predicting OWL Reasoners: Locally or Globally?
reasoner performance	(ORE) Exploring Reasoning with the DMOP Ontology
reasoners	(ORE) Android Went Semantic: Time for Evaluation
Reasoning	(DL) A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB (DL) OptiqueVQS: Visual Query Formulation for OBDA (DL) On Faceted Search over Knowledge Bases
reasoning about action and change	(KR) Diagnostic Problem Solving via Planning with Ontic and Epistemic Goals
reasoning about actions	(KR) A Formalization of Programs in First-Order Logic with a Discrete Linear Order (ASPOCP) Action Language BC+: Preliminary Report
Reasoning about Actions and Change	(KR) Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (NMR) Non-Monotonic Reasoning and Story Comprehension (NMR) An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report
reasoning about contexts	(LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
reasoning about knowledge and action	(KR) On the Progression of Knowledge in Multiagent Systems
reasoning about knowledge and belief	(KR) Decidable Reasoning in a Fragment of the Epistemic Situation Calculus
Reasoning in Fiction	(LC) Modelling Inference in Fiction
Reasoning under uncertain inputs	(KR) Reasoning with Uncertain Inputs in Possibilistic Networks
Reconfiguration	(ARW-DT) (AI) Planning to Reconfigure your Robot?
reconfiguration problem	(CSL-LICS) No proof nets for MLL with units: Proof equivalence in MLL is PSPACE-complete
Recurrence relation	(FWFM) Explaining the decompositionality of MSO using applications to combinatorics
Recurrent Clustering	(Coq) Proof-Pattern Search in Coq/SSReflect
recursion	(CAV) SMT-based Model Checking for Recursive Programs (Coq) Presentation of Three Neat Tricks in Coq 8.5 (ITP) Recursive Functions on Codatatypes via Domains and Topologies
recursion schemata	(LCC) Towards recursion schemata for the probablistic class PP
Recursion Schemes	(HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
recursion theory	(LC) Coding graphs into fields (INFINITY) Functors in Computable Model Theory
Recursive path ordering	(WST) Another Proof for the Recursive Path Ordering
recursive tactics	(Coq) Presentation of Three Neat Tricks in Coq 8.5
Recursive Types	(CLC) Infinitary Classical Logic: Recursive Equations and Interactive Semantics
reducibility	(LC) Definable cardinals just beyond R / Q (LC) On the existential interpretability of structures
Reduct	(LC) Reducts of simple (non-collapsed) Fraisse-Hrushovski constructions
reductio ad contradictionem	(LATD) De Morgan logics with a notion of inconsistency
reduction to SAT	(IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi
Reductions	(SAT) Automatic Evaluation of Reductions between NP-complete Problems
Reductions to SAT	(KR) The Parameterized Complexity of Reasoning Problems Beyond NP
redundancy	(KR) On Redundant Topological Constraints (Extended Abstract)
Reference	(LC) Frege on mathematical progress
refinement	(VeriSure) Witnessing an SSA Transformation (FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper) (ITP) Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm (CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs (Isabelle) Towards abstract and executable multivariate polynomials in Isabelle
Refinement Modal Logic	(LCC) Closing a Gap in the Complexity of Refinement Modal Logic
refinement relation	(VeriSure) Introducing Semi-Formal Specifications into a Distributed Development Process
Refinement types	(ITRS) Liquid Intersection Types
refinement-based verification	(VSTTE) Timed Refinements for Verification of Real-Time Object Code Programs
Refining partial structures	(CICLOPS-WLPE) Refining definitions with unknown opens using XSB for IDP3
reflection	(ITP) The reflective Milawa theorem prover is sound (down to the machine code that runs it) (LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
Reflection principle	(LC) Reflection principle of list-chromatic number of graphs
reflection principles	(LC) Reflection, Trust, Entitlement (LC) On Explicit-Implicit Reflection Principles. (LC) Justifying proof-theoretic reflection principles
Refutation	(LATD) A meta-Logic of multiple-conclusion rules (PAS) An Attempt to Formalize Popper's Logic of Scientific Discovery
region connection calculus	(KR) On Redundant Topological Constraints (Extended Abstract)
Region logic	(VSTTE) A logical analysis of framing for specifications with pure method calls
Regional Energy Planning	(ICLP) Multi-criteria optimal planning for Energy policies in CLP
regression test selection	(CAV) Regression Test Selection for Distributed Software Histories
regression verification	(ARW-DT) Automating Regression Verification
Regular cost functions	(CSL-LICS) Regular Combinators for String Transformations
regular expression equivalence	(ITP) Unified Decision Procedures for Regular Expression Equivalence
regular expressions	(CSL-LICS) Regular Combinators for String Transformations (DL) How to Best Nest Regular Path Queries
Regular formulas	(PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas
regular languages	(WST) Non-termination using Regular Languages
Regular Languages of Infinite Words	(CSL-LICS) Separating Regular Languages with First-Order Logic
Regular Languages of Words	(CSL-LICS) Separating Regular Languages with First-Order Logic
regular path queries	(KR) Nested Regular Path Queries in Description Logics (CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics
relational	(CAV) QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers
relational conditional	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
Relational dual tableau system	(ADDCT) On dual tableau-based decision procedures for relational fragments
relational logic	(CSF) Information flow monitoring as abstract interpretation for relational logic
relational logistic regression	(KR) Relational Logistic Regression
relational probabilistic models	(KR) Relational Logistic Regression
relational semantics	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (ITRS) Indexed linear logic and higher-order model checking
Relationship between deduction methods	(ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R)
relative clauses	(NLCS) Computing Italian clitic and relative clauses with tupled pregroups
relative error	(CAV) Verifying Relative Error Bounds using Symbolic Simulation
relative termination	(IWC) Confluence and Critical-Pair-Closing Systems
relativity theory	(LC) Modal logic of clocks: Modalizing a first-order theory of time to get a better understanding of relativity theories (LC) A completeness theorem for general relativity
relaxation	(FRIDA) Concurrent Data Structures: Semantics and (Quantitative) Relaxation
relaxed instance queries	(PRUV) Similarity-based Relaxed Instance Queries in EL++
relaxed memory models	(LOLA) A Cross-Language Framework for Verifying Compiler Optimizations (WPTE) Verifying Optimizations for Concurrent Programs
Relaxed Queries	(DL) Mary, What's Like All Cats?
Relevance	(ICLP) Properties of Stable Model Semantics Extensions (KR) Belief Change and Base Dependence
relevance logic	(LG) Game Semantics for Some Non-Classical Logics (RTA-TLCA) Implicational Relevance Logic is 2-ExpTime-Complete
relevance logics	(LATD) A Semi-relevant, Paraconsistent Dual of {\L}ukasiewicz Logic
Relevance Theory	(KR) Tackling Winograd Schemas by Formalizing Relevance Theory in Knowledge Graphs
relevant logic	(LATD) Semantic information and fuzziness
reliable constraint reasoning	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
remote code execution	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
renaissance geometry	(LC) Natural Deduction in Renaissance Geometry
Reordering	(KR) Transforming Situation Calculus Action Theories for Optimised Reasoning
Repair Decomposition	(DL) Towards Parallel Repair: An Ontology Decomposition-based Approach
Repairing	(DL) OBDA Using RL Reasoners and Repairing
representative agent	(LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
requirement traceability	(DL) A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
residual number system	(SAT) Simplifying Pseudo-Boolean Constraints in Residual Number Systems
residuated frames	(LATD) Embeddings into BiFL-algebras and conservativity
Residuated lattice	(LATD) Densification via polynomial extensions
Residuated lattices	(LATD) The lattice of varieties generated by small residuated lattices (LATD) Many-valued modal logic over residuated lattices via duality (LATD) Embeddings into BiFL-algebras and conservativity (LATD) Canonical formulas for k-potent residuated lattices
resolution	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents (IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (SAT) QBF Resolution Systems and their Proof Complexities (SAT) Long Proofs of (Seemingly) Simple Formulas (SAT) Unified characterisations of resolution hardness measures (PC) From Small Space to Small Width in Resolution (PC) Narrow Proofs May Be Maximally Long (PC) Size-Space Bounds and Trade-offs for CDCL Proofs (PC) Parity games and propositional proofs (PC) Lower bounds for splittings by linear combinations (PC) Total Space in Resolution (QBF) On the Relation between Resolution Calculi for QBFs and First-order Formulas (DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes (PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas (ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge (iPRA) Resolution Based Uniform Interpolation for Expressive Description Logics
resolution and superposition	(RTA-TLCA) Cut Admissibility by Saturation
resolution complexity	(SAT) Proof complexity and the Lovasz-Kneser Theorem
Resolution Method	(IJCAR) Clausal Resolution for Modal Logics of Confluence (ARW-DT) A Resolution-Based Prover for Normal Modal Logics
Resolution rules	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
resolution space	(SAT) Unified characterisations of resolution hardness measures
resolution width	(SAT) Unified characterisations of resolution hardness measures
Resource lambda-calculus	(LC) Natural deduction for intuitionistic differential linear logic
resource sensitive logics	(LC) Weak Beth definability property for finite variable fragments.
Resource Usage Analysis	(ICLP) Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
Resource λ-calculus	(Linearity) Geometry of Resource Interaction – A Minimalist Approach
resource-bounded search	(ICLP) Using Tabled Logic Programming to Solve the Petrobras Planning Problem
Restrictiveness	(LC) Restrictiveness relative to notions of interpretation
Retyping functions	(CSL-LICS) System F with Coercion Constraints
reverse mathematics	(LC) Reverse mathematics of WQOs and Noetherian spaces (LC) Computational reverse mathematics and foundational analysis (LC) Reverse Mathematics, more explicitly
Reversible computing	(Linearity) Superstructural Reversible Logic
revision	(KR) Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments
revision calculus	(PAS) An Attempt to Formalize Popper's Logic of Scientific Discovery (PAS) A Model Theory for R-calculus without Cut
rewards	(CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Rewrite Systems	(CSL-LICS) Senescent Ground Tree Rewrite Systems
Rewriting	(CAV) Bit-Vector Rewriting with Automatic Rule Generation (IJCAR) EL-ifying Ontologies (Coq) Proof-relevant rewriting strategies in Coq (ITP) Rough Diamond: An Extension of Equivalence-based Rewriting (ITP) Implicational Rewriting Tactics in HOL (CSL-LICS) Beta Reduction is Invariant, Indeed (LFMTP) A Framework for Implementing Logical Frameworks (Isabelle) Pattern-based Subterm Selection In Isabelle (WPTE) Structural Rewriting in the Pi-Calculus (RTA-TLCA) Confluence by Critical Pair Analysis (HOR) Distilling Abstract Machines (DCM) Some observations for the parallel implementation of interaction nets
Rewriting in action logic	(TermGraph) Fixed Point Theory for Consistent Rewriting in Logic of Action with Reverse
rewriting logic	(RTA-TLCA) Predicate Abstraction of Rewrite Theories
Rewriting system	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
rewriting techniques	(ITRS) A Finite Model Property for Intersection Types
rhythm representation	(IFIP-WG16) Rhythm Tree Rewriting
rich	(ORE) A Family History Knowledge Base in OWL 2
risk	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
Risk Awareness	(CSF) Who’s Afraid of Which Bad Wolf? A Survey of IT Security Risk Awareness
risk communication	(STAST) Using Statistical Information to Communicate Android Permission Risks to Users
risk mitigation	(CSF) The Complexity of Estimating Systematic Risk in Networks
Risk Propensity	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
RL systems	(DL) Hybrid Query Answering Over DL Ontologies
robot protocols	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
Robotics	(ASPOCP) Applying Action Language BC with Hierarchical Domain Abstraction to Mobile Robots (NMR) Integrating Declarative Programming and Probabilistic Graphical Models for Knowledge Representation and Reasoning in Robotics
Robots	(ARW-DT) (AI) Planning to Reconfigure your Robot?
robust quantitative objectives	(CSL-LICS) Finite-Memory Strategy Synthesis for Robust Multidimensional Mean-Payoff Objectives
Roger semilattice	(LC) Computable numberings in Ershov hierarchy
Rogers semilattice	(LC) Ideals without minimal numberings in the Rogers semilattice
Rough DL	(DL) Certain Answers in a Rough World
rough sets	(KR) Rough Set Semantics for Identity on the Web (PRUV) Towards a Logic of Dilation
round model	(FRIDA) Round model for distributed algorithms: from verification to implementation.
Routley-Meyer semantics	(LC) A Routley-Meyer semantics for Göodel 3-valued logic G3
RTL	(ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview
rule safety	(ASPOCP) Epistemic Logic Programs with Sorts
Rule transposition	(CLC) Separable Sequent Calculus for First-order Classical Logic (Work in Progress)
rule-based modeling	(HSB) RKappa: Statistical sampling suite for Kappa models.
rule-based models	(HSB) Integration of rule-based models and compartmental models of neurons (HSB) RKappa: Statistical sampling suite for Kappa models.
Rule-Labelling	(RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
rules	(KR) First-Order Default Logic Revisited
runtime analysis	(EC2) Group Communication Patterns for High Performance Computing in Scala
Runtime Complexity	(WPTE) A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems
Runtime Complexity Analysis	(WST) Type Introduction for Runtime Complexity Analysis
Runtime monitoring	(CAV) Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
runtime verification	(LATD) Five-valued LTL for Runtime Verification
Russell's Paradox	(LC) A characterization for diagonalized--out objects
S
s	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
safe recursive set functions	(INFINITY) Proof Theoretic Characterisations of Feasible Set Functions
Safety	(CSL-LICS) Anchored LTL Separation (CSL-LICS) Probably Safe or Live (CSL-LICS) The Complexity of Admissibility in Omega-Regular Games (DL) A Stream-Temporal Query Language for Ontology Based Data Access
Safety relation	(LC) Predicative Mathematics via Safety Relations
safety-critical real-time systems	(PAS) Successfully Coping with Scalability of Symbolic Analysis in Timing Analysis
Safety-critical systems	(VERIFY) Verifying safety properties of Artificial General Intelligence: The ultimate safety-critical system?
SAT	(CAV) Solving Games without Controllable Predecessor (CAV) AVATAR: The New Architecture for First-Order Theorem Provers (IJCAR) The Fractal Dimension of SAT Formulas (SAT) Unified characterisations of resolution hardness measures (SAT) Lazy clause exchange policy for parallel SAT solvers (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (Vampire) SAT solving experiments in Vampire (CSPSAT) SAT Compilation for Constraints over Finite Structured Domains (CSPSAT) BreakIDGlucose: on the importance of row symmetry (WST) Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (CICLOPS-WLPE) A System for Embedding Global Constraints into SAT (RTA-TLCA) Automatic Evaluation of Context-Free Grammars (System Description) (POS) iDQ: Instantiation-Based DQBF Solving (POS) Post Mortem Analysis of SAT Solver Proofs (iPRA) Interpolation from Clausal Proofs
SAT application	(SAT) Automatic Evaluation of Reductions between NP-complete Problems
SAT competitions	(POS) Typical-case complexity and the SAT competitions
SAT encoding	(WST) A Satisfiability Encoding of Dependency Pair Techniques for Maximal Completion (POS) Instance-based Selection of CSP Solvers using Short Training
SAT encoding of combinatorial problems	(SAT) A SAT Attack on the Erdos Discrepancy Conjecture
sat encodings	(SAT) Detecting cardinality constraints in CNF (LaSh) Modeling High School Timetabling as PartialWeighted maxSAT
SAT Features	(IJCAR) The Fractal Dimension of SAT Formulas
SAT modulo theories	(CAV) Lazy Annotation Revisited (iPRA) Interpolation Strategies
SAT partitioning	(POS) Formula partitioning revisited
SAT platform	(POS) Dolius: A Distributed Parallel SAT Solving Framework
SAT proofs	(POS) Post Mortem Analysis of SAT Solver Proofs
SAT solver	(IJCAR) A Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
SAT solvers	(POS) Typical-case complexity and the SAT competitions
SAT solving	(CAV) A Nonlinear Real Arithmetic Fragment (Vampire) SAT solving experiments in Vampire (RCRA) Latin Squares with Graph Properties (POS) Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers (POS) New CNF Features and Formula Classification (POS) Post Mortem Analysis of SAT Solver Proofs (ARW-DT) Extended Resolution in Modern SAT Solving
SAT under Assumptions	(SAT) Ultimately Incremental SAT
SatELite	(SAT) Ultimately Incremental SAT
Satifiability Modulo Theory	(CAV) The nuXmv Symbolic Model Checker
satisfiability	(IJCAR) Optimal tableaux-based decision procedure for testing satisfiability in the Alternating-time temporal logic ATL+ (IJCAR) Skeptik [System Description] (SAT) Conditional Lower Bounds for Failed Literals and Related Techniques (SAT) Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) (LC) Complexity bounds for Multiagent Justification Logic (CSL-LICS) A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates (CSL-LICS) Logics with Counting and Equivalence (LCC) Closing a Gap in the Complexity of Refinement Modal Logic (PRUV) Resolution and Clause Learning for Multi-Valued CNF Formulas (ASPOCP) Declarative Encodings of Acyclicity Properties (LATD) On satisfiability of terms in FLew-algebras (PCCR) Backdoors into Heterogeneous Classes of SAT and CSP
Satisfiability in Alternating-time Temporal Logic	(KR) Satisfiability of Alternating-time Temporal Epistemic Logic through Tableaux
Satisfiability Modulo Theories	(FRIDA) Monotonic Abstraction Techniques: from Parametric to Software Model Checking (CAV) Automating Separation Logic with Trees and Data (CAV) Yices 2.2 (IJCAR) Computing All Implied Equalities via SMT-based Partition Refinement (IJCAR) Skeptik [System Description] (CSL-LICS) Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties (CSF) Automated Generation of Attack Trees (ARW-DT) Combined Reasoning with Sets and Aggregation Functions
Satisfiability problem	(AISS) Model Checking Communicating Finite-State Machines using Local Temporal Logics (ADDCT) Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions
Satisfiability procedure	(IJCAR) A Gentle Non-Disjoint Combination of Satisfiability Procedures
saturation	(IJCAR) Locality Transfer: From Constrained Axiomatizations to Reachability Predicates
saturation algorithm	(Vampire) Reasoning in First-Order Theories with Extensionality
Saturation Algorithms	(Vampire) Playing with AVATAR
Saturation Procedures	(IJCAR) Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures
Saucy	(CSPSAT) BreakIDGlucose: on the importance of row symmetry
Scala	(IJCAR) Skeptik [System Description]
Scalability	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data
Scalable Unbounded Verification	(CAV) Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction
scalar extension property	(LATD) On tensor product in Lukasiewicz logic
scalar implicature	(NLCS) Toward a Logic of Cumulative Quantification
scale-free networks	(CSF) The Complexity of Estimating Systematic Risk in Networks
scattered linear order	(LC) On categoricity of scattered linear orders
Sceptical reasoning	(KR) How to Argue for Anything: Enforcing Arbitrary Sets of Labellings Using AFs
scheduling	(CLC) A proof-theoretic view on scheduling in concurrency
Schematic Proof	(CLC) Cut-Elimination in Schematic Proofs and Herbrand Sequents
Science Popularization	(FWFM) Fun With Formal Methods 2014: Opening Remarks
Scope-bounded	(HOPA) Saturation of Concurrent Collapsible Pushdown Systems (Extended Abstract)
Scope-Bounding	(CSL-LICS) Senescent Ground Tree Rewrite Systems
Scott data types	(CLC) A type system for Continuation Calculus (PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
Scott-continuous function	(LATD) Semantic information and fuzziness
Scrap Your Boilerplate	(DTP) Scrapping Your Dependently-Typed Boilerplate is Hard
Scripting Language	(ICLP) Logic Programming as Scripting Language for Bots in Computer Games
scripting languages	(ITRS) Lucretia — intersection type polymorphism for scripting languages
Sea Urchin Development	(CAV) Analyzing and Synthesizing Genomic Logic Functions
search	(ARW-DT) Using CSP Meta Variables in AI Planning
search problems	(PC) Provably Total Search Problems in Fragments of Bounded Arithmetic Below Polynomial-time
second order logic	(LC) Type equations and second order logic (LC) Completeness of second-order separation logic for program verification
second-order arithmetic	(LC) Some applications of the Arithmetized Completeness Theorem to second-order arithmetic
second-order Godel logic	(LATD) Cut-free calculus for second-order {G\"odel} logic
second-order logic	(CSL-LICS) Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
Second-order quantifier elimination	(ARW-DT) Second-Order Characterizations of Definientia in Formula Classes
secrecy	(CSF) Actor Key Compromise: Consequences and Countermeasures
secret-sharing	(CSF) Attribute-based Encryption for Access Control Using Elementary Operations
Secure Electronic Voting	(CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
secure equilibria	(CSL-LICS) Secure Equilibria in Weighted Games
secure multi-execution	(CSF) Stateful Declassification Policies for Event-Driven Programs
Secure multiparty computation	(CSF) From input private to universally composable secure multiparty computation primitives
secure services	(PAS) Automated verification of security protocols and services
secure sets	(ASPOCP) Computing Secure Sets in Graphs using Answer Set Programming
Secure Web Bulletin Board	(CSF) A Peered Bulletin Board for Robust Use in Verifiable Voting Systems
Security	(CAV) VAC - Verifier of Administrative Role-based Access Control Policies (CAV) Synthesis of Masking Countermeasures against Side Channel Attacks (STAST) Modeling Human Behaviour with Higher Order Logic: Insider Threats (STAST) Decision justifications for wireless network selection (VeriSure) Assurance and Verification of Security Properties (VSTTE) Formal Modeling and Verification of CloudProxy (VSTTE) The KeY Platform for Verification and Analysis of Java Programs (FCS-FCC) A tool for automating the computationally complete symbolic attacker (ITP) From Operational Models to Information Theory - Side-Channels in pGCL with Isabelle (CSF) The Complexity of Estimating Systematic Risk in Networks (CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing (WWV) Static Enforcement of Role-Based Access Control
Security API	(ASA) Security APIs for Device Enrolment
security APIs	(ASA) Well-typed generic smart-fuzzing for APIs
Security Awareness	(STAST) The Social Engineering Personality Framework
Security Ceremonies	(STAST) Modelling User Devices in Security Ceremonies
security in graphs	(ASPOCP) Computing Secure Sets in Graphs using Answer Set Programming
Security lattice	(FCS-FCC) Generalizing Permissive-Upgrade in Dynamic Information Flow Analysis
Security models	(CSF) Mignis: A semantic based tool for firewall configuration
security policy	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
security properties	(CSF) Actor Key Compromise: Consequences and Countermeasures
security protocols	(STAST) Modelling User Devices in Security Ceremonies (FCS-FCC) On Well-Founded Security Protocols (FCS-FCC) Actual Causes of Security Violations (FCS-FCC) Fitting's Embedding of Classical Logic in S4 and Trace Properties in the Computational Model (CSF) Actor Key Compromise: Consequences and Countermeasures (CSF) A Sound Abstraction of the Parsing Problem (iPRA) Using Interpolation for the Verification of Security Protocols (Extended Abstract) (PAS) Automated verification of security protocols and services
Security Type Systems	(CSF) Noninterference under Weak Memory Models
security vulnerabilities	(CAV) Program Verification through String Rewriting
self organization	(RCRA) Self Regulating Mechanisms for Network Immunization
self regulation	(RCRA) Self Regulating Mechanisms for Network Immunization
Self-learning	(SAT) Automatic Evaluation of Reductions between NP-complete Problems
self-modifying programs	(LOLA) Abstract Self Modifying Machines
Self-reference	(LC) Truth theory for logic of self-reference statements as a quaternion structure (LC) A universal diagonal schema by fixed-points and Yablo’s paradox (VERIFY) Verifying safety properties of Artificial General Intelligence: The ultimate safety-critical system?
Self-similarity	(IJCAR) The Fractal Dimension of SAT Formulas
self-stabilization	(FRIDA) Synthesizing self-stabilizing fault-tolerant algorithms (extended abstract) (FRIDA) Synthesis for Resilient Distributed Systems (SYNT) Synthesis of a simple self stabilizing system
selfextensional logics	(LATD) On logics of varieties and logics of semilattices
semantic entailment	(LC) The Birth of Semantic Entailment
semantic guidance	(PAAR) SGGS Theorem Proving: an Exposition
semantic information	(LATD) Semantic information and fuzziness
semantic knowledge	(DL) Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
semantic labelling	(WST) Kurth's Criterion H Revisited (WST) Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling
semantic model	(LC) On Jonsson sets and some their properties.
semantic paradoxes	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
semantic rewriting	(NLCS) Transfer Semantics for the Clear Parser
Semantic tableaux	(DL) TBox abduction in ALC using a DL tableau
Semantic Web	(KR) Rough Set Semantics for Identity on the Web
Semantic Web and Natural Language Processing	(KR4HC) Semantic Representation of Evidence-based Clinical Guidelines
Semantic Web of Things	(ORE) Mini-ME 2.0: powering the Semantic Web of Things
semantics	(ICLP) A Linear Logic Programming Language for Concurrent Programming over Graph Structures (ICLP) A Well-Founded Semantics for FOL-Programs (ICLP) On Strong and Default Negation in Answer-Set Program Updates (CLC) A proof-theoretic view on scheduling in concurrency (LC) An intuitive semantics for {Full Intuitionistic Linear Logic} (DTP) Type-Directed Editing for Dependently-Typed Programs. (ITP) HOL with Definitions: Semantics, Soundness, and a Verified Implementation (ITP) Towards a Formally Verified Proof Assistant (ITP) The reflective Milawa theorem prover is sound (down to the machine code that runs it) (CSL-LICS) Symmetry in Concurrent Games (IFIP-WG16) Semantically-Guided Goal-Sensitive Theorem Proving (WPTE) Structural Rewriting in the Pi-Calculus (Linearity) Geometry of Resource Interaction – A Minimalist Approach (RTA-TLCA) Applicative May- and Should-Simulation in the Call-by-Value Lambda Calculus with AMB (NMR) Semantics and Compilation of Answer Set Programming with Generalized Atoms (NMR) On Strong and Default Negation in Logic Program Updates (PAS) Programming Language Aggregation with Applications in Equivalence Checking
Semantics and pragmatics	(KR) Rough Set Semantics for Identity on the Web
Semantics of Aggregates	(KR) The Semantics of Gringo and Infinitary Propositional Formulas
Semantics of Conditional Literals	(KR) The Semantics of Gringo and Infinitary Propositional Formulas
Semantics preservation	(NSV) Certifying Square Root and Division Elimination
Semantics-Based Program Transformation	(NSV) Transformation of a PID Controller for Numerical Accuracy
semi-formal specification	(VeriSure) Introducing Semi-Formal Specifications into a Distributed Development Process
semi-orders	(NLCS) Mereological Comparatives in Delineation Semantics
semi-ring computation	(ITP) A Verified Generate-Test-Aggregate Coq Library for Parallel Programs Extraction
semi-Thue system	(WST) Kurth's Criterion H Revisited (WST) A Solution to Endrullis-08 and Similar Problems
semialgebraic	(CSL-LICS) On the Computing Power of +, −, and ×
Semigroups	(CSL-LICS) Separating Regular Languages with First-Order Logic
semilattice	(LC) On the existential interpretability of structures
Semilattice Polymorphisms	(CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets
semilattices	(LATD) On logics of varieties and logics of semilattices
Semimodule	(LATD) Densification via polynomial extensions
semisimple MV-algebras	(LATD) On tensor product in Lukasiewicz logic
separation	(PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (CSL-LICS) Separating Regular Languages with First-Order Logic
Separation algebras	(VSTTE) Separation algebras for C verification in Coq
separation kernel	(Isabelle) Using Isabelle/HOL to Develop and Maintain Separation Invariants for an Operating System (Extended Abstract)
separation kernels	(VeriSure) Implicit Assumptions in a Model for Separation Kernels
separation logic	(CAV) Shape Analysis via Second-Order Bi-Abduction (LC) Completeness of second-order separation logic for program verification (CSL-LICS) A Decision Procedure for Satisfiability in Separation Logic with Inductive Predicates (CSL-LICS) Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction (DL) Shape and Content: Incorporating Domain Knowledge into Shape Analysis (ADDCT) Decidability of Iteration-free PDL with Parallel Composition
sequence of sat	(SAT) Cores in Core based MaxSat Algorithms: an Analysis
Sequences of small discrepancy	(SAT) A SAT Attack on the Erdos Discrepancy Conjecture
sequent calculi	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics (IJCAR) A History-Based Theorem Prover for Intuitionistic Propositional Logic using Global Caching: IntHistGC System Description (IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (IJCAR) SAT-based Decision Procedure for Analytic Pure Sequent Calculi (LATD) Cut and completion? (ARQNL) Computer-oriented inference search in first-order sequent logics (NMR) Tableau vs. Sequent Calculi for Minimal Entailment
sequent calculus	(CLC) Dualized Type Theory (CLC) Confluence for classical logic through the distinction between values and computations (GSB) An Intuitionisticaly based Description Logic (GSB) Comparing Sequent Calculi via Hilbert-style Axioms (IJCAR) A Focused Sequent Calculus for Higher-Order Logic (LC) Models for the probabilistic sequent calculus (ITRS) Uniform Proofs of Normalisation and Approximation for Intersection Types (UITP) Advanced Proof Viewing in PROOFTOOL (SD) First-order Proofs Without Syntax: Summary of Work in Progress (RTA-TLCA) Construction of retractile proof structures (RTA-TLCA) Cut Admissibility by Saturation (ARW-DT) On Herbrand theorems for classical and non-classical logics
sequent-based systems	(PAS) Building explicit induction schemas for cyclic induction reasoning
sequential consistency	(VSTTE) Store Buffer Reduction with MMUs
sequential decision problems	(DTP) Sequential decision problems and a computational theory of avoidability
sequential theories	(LC) On a theorem of McAloon
Sequentialization	(CAV) Bounded Model Checking of Multi-Threaded C Programs via Lazy Sequentialization
Sequents of Relations	(LATD) Poof Search and Co-NP completeness for Many-Valued Logics
Session integrity	(CSF) Provably Sound Browser-Based Enforcement of Web Session Integrity
session log	(PLP) Prefix and infix probability computation in PRISM
session types	(CSL-LICS) Deadlock and lock freedom in the linear pi-calculus
set arithmetic	(NSV) SetBased Decorated Intervals
Set Comprehension	(SMT) Reasoning About Set Comprehensions
set functions	(INFINITY) Cobham Recursive Set Functions
set theory	(LC) Forcing with finite conditions and preserving CH (LC) Computability in generic extensions (LC) Budding Trees (LC) Elementary epimorphisms between models of set theory (LC) Restrictiveness relative to notions of interpretation (LC) A sheaf model of randomness (SMT) Reasoning About Set Comprehensions
set-based theorems	(Isabelle) From Types to Sets in Isabelle/HOL
Set-theory	(PSC) Extracting Monadic Parsers from Proofs
sets	(CAV) QUICr: A Reusable Library for Parametric Abstraction of Sets and Numbers (LC) On Bernays' Generalization of Cantor's Theorem
Sets with atoms	(CSL-LICS) Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
shape analysis	(CAV) Automating Separation Logic with Trees and Data (CAV) Property-Directed Shape Analysis (CAV) Shape Analysis via Second-Order Bi-Abduction (DL) Shape and Content: Incorporating Domain Knowledge into Shape Analysis (DL) Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability
shared-memory	(WST) Reducing Deadlock and Livelock Freedom to Termination
Shatter	(CSPSAT) BreakIDGlucose: on the importance of row symmetry
sheaf	(PSC) A joint logic of problems and propositions, a modified BHK-interpretation and proof-relevant topological models of intuitionistic logic
sheaf model	(CLC) A sheaf model of the algebraic closure
Sheaf semantics	(LC) Constructive completeness and Joyal's theorem
Sherali-Adams	(PC) Narrow Proofs May Be Maximally Long
SHOIQ	(IJCAR) EL-ifying Ontologies (DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
SHOQ	(DL) Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs
Short Paper	(FCS-FCC) Actual Causes of Security Violations
Shortest Path	(Isabelle) A Simpl Shortest Path Checker Verification
SHQ	(IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies
shuffle	(CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics
side channel attacks	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks
Side-effects	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect
Sigma-definability	(LC) Uniformization in the hereditarily finite list superstructure over the real exponential field
Sigma-predicate	(LC) Uniformization in the hereditarily finite list superstructure over the real exponential field
Signal-Flow-Graphs	(FWFM) Towards the Application of Formal Methods in Process Engineering
silent transitions	(AISS) Of stacks (of stacks (...) with blind counters) with blind counters
similarity	(KR) Concept Dissimilarity with Triangle Inequality (LC) On Jonsson sets and some their properties. (CSL-LICS) Coinduction Up-To in a Fibrational Setting
similarity measures	(DL) Mary, What's Like All Cats? (PRUV) Similarity-based Relaxed Instance Queries in EL++
Simple theories	(LC) Indiscernible extraction and Morley sequences
Simple Theory of Types	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
simplex	(SMT) Leveraging Linear and Mixed Integer Programming for SMT
simply typed lambda calculus	(CICLOPS-WLPE) A Lambda Prolog Based Animation of Twelf Specifications
simply-typed lambda-calculus	(CLC) Confluence for classical logic through the distinction between values and computations
simulation	(ICLP) Simulating Dynamic Systems Using Linear Time Calculus Theories (AISS) Simulation for infinite state systems. (AISS) Simulation Over One-Counter Nets is PSPACE-Complete (CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs (DL) Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs (VEMDP) Modeling and Analysis of Genetic Boolean Gates Using the Infobiotics Workbench
Simulation and alternating simulation	(CAV) CEGAR for Qualitative Analysis of Probabilistic Systems
simulations	(IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (NMR) Tableau vs. Sequent Calculi for Minimal Entailment
singleton arc consistency	(SAT) Conditional Lower Bounds for Failed Literals and Related Techniques (RCRA) Neighbourhood SAC for Preprocessing and Search
situation calculus	(KR) On the Progression of Knowledge in Multiagent Systems (KR) SmartPM: An Adaptive Process Management System through Situation Calculus, IndiGolog, and Classical Planning (KR) Action Theories over Generalized Databases with Equality Constraints (Extended Abstract) (KR) Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (KR) Tracking Beliefs and Intentions in the Werewolf Game (KR) Forgetting in Action (KR) How To Progress Beliefs in Continuous Domains
size	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) Narrow Proofs May Be Maximally Long (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
Skolem/Herbrand function	(SAT) QBF Resolution Systems and their Proof Complexities
Skolemization	(KR) Skolemization for Weighted First-Order Model Counting (PLP) Lifted Inference for Probabilistic Logic Programs
SLD-resolution	(ICLP) A Framework for Bottom-Up Simulation of SLD-Resolution
SLS	(SAT) Efficient implementation of SLS solvers and new heuristics for k-SAT with long clauses
smart card	(ASA) Nuances of the JavaCard API on the cryptographic smart cards - JCAlgTest project
Smart Cities	(KR4HC) Exploiting the Relation between Environmental Factors and Diseases: A Case Study on COPD
Smart Health	(KR4HC) Exploiting the Relation between Environmental Factors and Diseases: A Case Study on COPD
SMT	(QUANTIFY) Finding Conflicting Instances of Quantified Formulas in SMT (FRIDA) Parameterized Synthesis (FRIDA) Synthesis for Resilient Distributed Systems (CAV) Bit-Vector Rewriting with Automatic Rule Generation (CAV) An SMT-Based Approach to Coverability Analysis (CAV) Analyzing and Synthesizing Genomic Logic Functions (CAV) Monadic Decomposition (CAV) Verifying LTL properties of hybrid systems with K-liveness (CAV) A Tale of Two Solvers: Eager and Lazy Approaches to Bit-vectors (CAV) SMT-based Model Checking for Recursive Programs (CAV) A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions (IJCAR) Approximations for Model Construction (SAT) Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions (LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (SMT) Leveraging Linear and Mixed Integer Programming for SMT (SMT) Weakly Equivalent Arrays (SMT) Reasoning About Set Comprehensions (SMT) raSAT: SMT for Polynomial Inequality (iPRA) Towards Craig Interpolation for String Constraints
SMT solvers	(CAV) Synthesis of Masking Countermeasures against Side Channel Attacks (VSTTE) Formalizing Semantics with an Automatic Program Verifier
SMT solving	(SMT) Multi-solver Support in Symbolic Execution (SMT) Towards Conflict-Driven Learning for Virtual Substitution
SMT-LIB	(SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism
SMT-solving	(IJCAR) Finite Quantification in Hierarchic Theorem Proving
SNOMED-CT	(DL) Measuring Conceptual Similarity in Ontologies: How Bad is a Cheap Measure?
Social Choice	(KR) Interval Methods for Judgment Aggregation in Argumentation (LC) Elections and knowledge (LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
social choice theory	(KR) On Egalitarian Belief Merging
Social Engineering	(STAST) The Social Engineering Personality Framework
Social Network Theory	(LG) Emulating Diffusion and Best Response Dynamics in Social Networks using Action Models
Socio-Technical Security	(STAST) The Social Engineering Personality Framework
socratic proofs	(ARW-DT) Socratic Proofs for Propositional Linear-Time Logic
Soft Constraints	(ICLP) A Proof Theoretic Study of Soft Concurrent Constraint Programming
software defined network	(FRIDA) Models and techniques for verification of Software Defined Networks
software description	(KR) Tweety: A Comprehensive Collection of Java Libraries for Logical Aspects of Artificial Intelligence and Knowledge Representation
software design patterns	(ICLP) Entanglement Patterns and Logic Programming Language Constructs
Software Fault Isolation	(CSF) Portable Software Fault Isolation
software model checking	(CAV) Termination Analysis by Learning Terminating Programs (CAV) Lazy Annotation Revisited (VSTTE) Model Checking Parameterized Timed Systems (iPRA) Interpolation Strategies
Software Science	(PAS) The Theorema Approach to Mathematics
Software synthesis	(CAV) G4LTL-ST: Automatic Generation of PLC Programs
software test	(CHR) Automated Test Case Generation and Model Checking with CHR
software testing	(PAS) Automatic App Testing of LTL Properties
software toolkit	(PAS) RCK: A Software Toolkit for R-calculus
Software Verification	(ICLP) Analysis and Transformation Tools for Constrained Horn Clause Verification (CAV) Software Verification in the Google App-Engine Cloud (CAV) SMACK: Decoupling Source Language Details from Verifier Implementations (CAV) Symbolic Resource Bound Inference for Functional Programs (VeriSure) Quantification of Verification Progress (IJCAR) Computing All Implied Equalities via SMT-based Partition Refinement (VERIFY) Reasoning About Vote Counting Schemes Using Light-weight and Heavy-weight Methods
solvability/unsolvability of problems	(FRIDA) Towards binary circuit models that faithfully reflect physical (un)solvability
Solver	(CAV) Yices 2.2 (SAT) Lazy clause exchange policy for parallel SAT solvers
Solver competitions	(IJCAR) StarExec: a Cross-Community Infrastructure for Logic Solving
Solver Construction	(LaSh) Logical Machinery of Heuristics (Preliminary Report)
Solver execution services	(IJCAR) StarExec: a Cross-Community Infrastructure for Logic Solving
Solvers	(LaSh) Logical Machinery of Heuristics (Preliminary Report)
solving	(SAT) MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing
Sorites	(LC) Towards a Conditional for The Liar and the Sorites.
sorted signature	(ASPOCP) Epistemic Logic Programs with Sorts
Sound	(HOPA) Analyzing JavaScript: The Bad Parts
Sound Abstraction	(CSF) A Sound Abstraction of the Parsing Problem
soundness	(LC) Models for the probabilistic sequent calculus (ITP) HOL with Definitions: Semantics, Soundness, and a Verified Implementation (ITP) The reflective Milawa theorem prover is sound (down to the machine code that runs it) (PAS) A Model Theory for R-calculus without Cut
Source code classification	(PAS) Source code profiling and classification for automated detection of logical errors
Source-to-Source Transformation	(ICLP) Visualization of Constraint Handling Rules
SPA	(ARW-DT) (AI) Planning to Reconfigure your Robot?
space	(PC) From Small Space to Small Width in Resolution (PC) Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (PC) Size-Space Bounds and Trade-offs for CDCL Proofs
SPARQL	(DL) OptiqueVQS: Visual Query Formulation for OBDA
SPARQL Update	(DL) SPARQL Update for Materialized Triple Stores under DL-Lite_RDFS Entailment
SPASS	(FRIDA) Having SPASS with Pastry and TLA+
Special cases of MP	(SAT) An Ising Model inspired Extension of the Product-based MP Framework for SAT
specification	(FRIDA) Models and techniques for verification of Software Defined Networks (VeriSure) A Graphical Notation for Probabilistic Specifications
specification debugging	(SYNT) Low-effort Specification Debugging and Analysis
specification patterns	(VeriSure) A Graphical Notation for Probabilistic Specifications
Specification Synthesis	(iPRA) Specification Synthesis via Generalized Abduction
Specification Testing	(FRIDA) Correctness and Performance Analysis of Distributed High Performance Programs in Scala
Specifications	(VSTTE) A logical analysis of framing for specifications with pure method calls
specificity	(KR) David Poole’s Specificity Revised
spectra	(LC) $\Delta_2^0$-spectra of linear orderings
spectra of structures	(LC) Embedding the omega-enumeration degrees into the Muchnik degrees generated by spectra of structures
spectral space	(LATD) The space of directions of a polyhedron
speech act theory	(NLCS) How to do things with types
splittiing	(CAV) AVATAR: The New Architecture for First-Order Theorem Provers
SROIQ	(DL) Typed Higher-Order Variant of SROIQ - Why Not?
SSA Form	(ACL2) Development of a Translator from LLVM to ACL2
SSH	(CSF) Actor Key Compromise: Consequences and Countermeasures
SSReflect	(Coq) Formalization of Error-correcting Codes using SSReflect (ITP) Completeness and Decidability Results for CTL in Coq (ITP) A Coq Formalization of Finitely Presented Modules (ITP) A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3) (Isabelle) Pattern-based Subterm Selection In Isabelle
stability	(KR) Appropriate Causal Models and Stability of Causation (CAV) Finding instability in biological models (LC) On Jonsson sets and some their properties.
stability analysis	(KR) Qualitative Spatial Representation and Reasoning in Angry Birds: the Extended Rectangle Algebra
stable model semantics	(ICLP) Properties of Stable Model Semantics Extensions (KR) Logic Programs with Ordered Disjunction: First-order Semantics and Expressiveness (KR) Stable Model Semantics for Guarded Existential Rules and Description Logics (KR) Stable Models of Multi-Valued Formulas: Partial vs. Total Functions (PRUV) Stable Models of Fuzzy Propositional Formulas
Stable Models	(NMR) Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
Staged Computation	(ITRS) Delegation-based Mixin Composition Synthesis
Standard completeness	(LATD) Densification via polynomial extensions
standard completness	(GSB) A proof theoretic approach to standard completeness
standard reasoning	(KR) Nominal Schemas in Description Logics: Complexities Clarified
Standards	(Vampire) Proofs in Vampire
state space analysis	(CAV) GPU-Based Graph Decomposition into Strongly Connected and Maximal End Components
State-boundedness	(KR) State-Boundedness for Decidability of Verification in Data-Aware Dynamic Systems
statecharts	(VeriSure) Introducing Semi-Formal Specifications into a Distributed Development Process
Static Analysis	(CAV) Termination Analysis by Learning Terminating Programs (CAV) Don't sit on the fence: A static analysis approach to automatic fence insertion (CAV) Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (CAV) A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (DL) Planning Problems for Graph Structured Data in Description Logics (CSF) Automated Generation of Attack Trees (HOPA) Environment Unrolling (HOPA) Strong Function Call (HOPA) Analyzing JavaScript: The Bad Parts (WWV) Static Enforcement of Role-Based Access Control (PAS) Source code profiling and classification for automated detection of logical errors
static checking	(WING) Loop Invariants by Mutation, Dynamic Validation, and Static Checking
statistical information	(STAST) Using Statistical Information to Communicate Android Permission Risks to Users
Statistical Relational Artificial Intelligence	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming
Statistical Relational Learning	(PLP) Lifted Inference for Probabilistic Logic Programs
STD	(KR4HC) Development of Digital Repositories of Multimedia Learning Modules and Guideline-Driven Interactive Case Simulation Tools for New York State HIV/HCV/STD Clinical Education Initiative
step-indexing	(RTA-TLCA) A Model of Countable Nondeterminism in Guarded Type Theory
step-wise refinement	(VSTTE) Efficient Refinement Checking in VCC
stochastic chemical kinetics	(HSB) Optimal Observation Time Points in Stochastic Chemical Kinetics
Stochastic Logic Programs	(PLP) PageRank, ProPPR and Stochastic Logic Programs
stochastic processes	(CSL-LICS) A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Stochastic satisfiability modulo theories	(iPRA) Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems
Stochastic shortest path	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Stone duality	(LATD) A method for generalizing finite automata arising from Stone-like dualities
Stone-Priestley duality	(LATD) The space of directions of a polyhedron
Store buffer reduction	(VSTTE) Store Buffer Reduction with MMUs
Story Comprehension	(NMR) Non-Monotonic Reasoning and Story Comprehension
Story Telling	(KR) Representing and Reasoning About Time Travel Narratives: Foundational Concepts
story understanding	(KR) A Psychology-Inspired Approach to Automated Narrative Text Comprehension
straight-line program	(AISS) Unary Pushdown Automata and Straight-Line Programs
strand spaces	(FCS-FCC) A Hybrid Analysis for Security Protocols with State (CSF) Decidability for Lightweight Diffie-Hellman Protocols
Strategic Environmental Assessment	(ICLP) Multi-criteria optimal planning for Energy policies in CLP
strategic interaction	(DL) Obfuscation of Semantic Data: Restricting the Spread of Sensitive Information
strategies	(KR) A Temporal Logic of Strategic Knowledge (Coq) Proof-relevant rewriting strategies in Coq (CSL-LICS) Symmetry in Concurrent Games
Strategies for dialogical argumentation	(NMR) Analysis of Dialogical Argumentation via Finite State Machines
strategy development	(PAAR) BliStr: The Blind Strategymaker
Strategy Logic	(CAV) MCMAS-SLK: A Model Checker for the Verification of Strategy Logic Specifications
stream transducer	(LOLA) Compiling Effectful Terms to Transducers: Prototype Implementation of Memoryful Geometry of Interaction
streams	(DL) A Stream-Temporal Query Language for Ontology Based Data Access
string	(CICLOPS-WLPE) SWI-Prolog version 7 extensions
string constraints	(iPRA) Towards Craig Interpolation for String Constraints
string processing	(IJCAR) Proving Termination and Memory Safety for Programs with Pointer Arithmetic
string rewriting	(WST) A Solution to Endrullis-08 and Similar Problems (WST) On the derivational complexity of Kachinuki orderings (RTA-TLCA) Termination of Cycle Rewriting
String solvers	(CAV) A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
String transducers	(CSL-LICS) Regular Combinators for String Transformations
strings	(CAV) Program Verification through String Rewriting
Strong Embedding	(CSL-LICS) Model Checking Existential Logic on Partially Ordered Sets
Strong Entailment	(LATD) Bitopological Duality and Three-valued Logic
strong equality of modal tautologies	(LC) On proof complexities of strong equal modal tautologies.
strong equivalence	(KR) Strong Equivalence of Non-monotonic Temporal Theories (ASPOCP) Infinitary Equilibrium Logic (NMR) An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence
strong negation	(ICLP) On Strong and Default Negation in Answer-Set Program Updates (NMR) On Strong and Default Negation in Logic Program Updates
Strong normalisation	(CLC) A Translation of Intersection and Union Types for the lambda-mu Calculus (ITRS) Uniform Proofs of Normalisation and Approximation for Intersection Types (RTA-TLCA) Unnesting of Copatterns
strong normalization	(PSC) A typed lambda-calculus with call-by-name and call-by-value iteration (RTA-TLCA) Reduction System for Extensional Lambda-mu Calculus
strong termination	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics
Strong Update	(Linearity) Type Classes for Lightweight Substructural Types
Strongest Necessary Conditions	(ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge
Strongly Connected Components	(ITP) Verified Efficient Implementation of Gabow's Strongly Connected Component Algorithm
structural completeness	(GSB) Link formulas in implication fragments of substructural logics (LC) Almost structurally complete consequence operations extending S4.3
structural decompositions	(PCCR) Structural Decomposition Methods: How They Matter
structural equations	(KR) Appropriate Causal Models and Stability of Causation
Structural tractability	(SAT) Hypergraph Acyclicity and Propositional Model Counting
Structurally completeness	(LATD) On the Logic of Perfect MV-algebras
structure	(LC) Computable structure theory and formulas of special forms (LC) Definability of 0' in the structure of $\omega$-enumeration degrees
structure learning	(LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability
Structure preserving	(WPTE) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
structured code generators	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
structured proof	(Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work)
structures of bounded degree	(CSL-LICS) Preservation and Decomposition Theorems for Bounded Degree Structures
stuttering bisimulations	(VSTTE) Timed Refinements for Verification of Real-Time Object Code Programs
sub-classical logics	(GSB) On the Construction of Analytic Sequent Calculi for Sub-classical Logics
Sub-formula Property	(DCM) Propositional Logics Complexity and the sub-formula Property
subdirectly irreducible algebras	(LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras
subexponential	(Linearity) Undecidability of Multiplicative Subexponential Logic
subgame perfect	(CSL-LICS) Infinite sequential games with real-valued payoffs
subrecursive degrees	(LC) Every non-zero honest elementary degree has the cupping property
subset-simulation	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics (ARW-DT) Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
substitutability	(RCRA) Dispensable Instantiations in Constraint Satisfaction Problems
substitution	(UNIF) Two-sided unification is NP-complete (CSL-LICS) Substitution, jumps, and algebraic effects (LFMTP) Gentle Formalisation of Stoughton’s Lambda Calculus Substitution (LFMTP) A Generic Approach to Proofs about Substitution (PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
substructural logic	(LC) Display-type calculi for non classical logics (SD) Substructural Cut Elimination
substructural logics	(LATD) Undecidability of consequence relation in Full Non-associative Lambek Calculus (LATD) Canonical formulas for k-potent residuated lattices
Substructural predicate logics	(LC) Predicate Glivenko theorems and substructural aspects of negative translations
Substructural Types	(Linearity) Type Classes for Lightweight Substructural Types
subsumption	(DTP) A Unifying Framework for Primitive Ontological Relations in Dependent Type Theory
Subterm selection	(Isabelle) Pattern-based Subterm Selection In Isabelle
subtyping	(ITP) Universe Polymorphism in Coq (CSL-LICS) System F with Coercion Constraints (RTA-TLCA) Preciseness of subtyping on intersection and union types
subvarieties	(LATD) Canonical formulas for k-potent residuated lattices
subword complexity	(CSL-LICS) On Periodically Iterated Morphisms
Succinctness	(KR) Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (DL) Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries
sudoku puzzle	(RCRA) Latin Squares with Graph Properties
Sunburst Tree	(UITP) Advanced Proof Viewing in PROOFTOOL
supercompilation	(VPT) A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? (VPT) Verification of Multi-Party Ping-Pong Protocols via Program Transformation (VPT) Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem (VPT) On Unfolding for Programs Using Strings as a Data Type
superposition	(Vampire) First Class Boolean Type in First-Order Theorem Proving and TPTP (PAAR) Polymorphic+Typeclass Superposition (ARW-DT) The Leo-III Project
superposition calculus	(CAV) AVATAR: The New Architecture for First-Order Theorem Provers (Vampire) Reasoning in First-Order Theories with Extensionality (PAAR) A Model Guided Instantiation Heuristic for the Superposition Calculus with Theories
superstability	(LC) Uniqueness of limit models in metric abstract elementary classes under categoricity and some consequences in domination and orthogonality of Galois types
support function	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
supported model semantics	(ASPOCP) Supported Semantics for Modular Systems
Surveillance	(CSF) Balancing Societal Security and Individual Privacy: Accountable Escrow System
Suszko operator	(LATD) Generalizing the Leibniz and Suszko operators
switch	(FRIDA) Models and techniques for verification of Software Defined Networks
symblicit approach	(SYNT) Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes
Symbolic analysis	(PAS) Successfully Coping with Scalability of Symbolic Analysis in Timing Analysis
Symbolic Automata	(CAV) Symbolic Visibly Pushdown Automata (CAV) Monadic Decomposition
symbolic computation	(HSB) Parameter Synthesis using Parallelotopic Enclosure and Applications to Epidemic Models
symbolic execution	(SMT) Multi-solver Support in Symbolic Execution (VERIFY) Introducing a Sound Deductive Compilation Approach (PAS) A hybrid path constraint solver combined with meta-heuristic search
Symbolic model	(CSF) Decidability for Lightweight Diffie-Hellman Protocols
Symbolic Model Checking	(CAV) The nuXmv Symbolic Model Checker
symbolic orthogonal projections	(CAV) Reachability Analysis of Hybrid Systems Using Symbolic Orthogonal Projections
symbolic simulation	(CAV) Verifying Relative Error Bounds using Symbolic Simulation
Symbolic Time bounds	(CAV) Symbolic Resource Bound Inference for Functional Programs
symbolic transducers	(CAV) Monadic Decomposition
symmetric encryption	(CSF) Automated Analysis and Synthesis of Block-Cipher Modes of Operation
symmetric indivisibility	(LC) On various strengthenings of the notion of indivisibility
Symmetric monoidal categories	(Linearity) Superstructural Reversible Logic
Symmetry	(CSL-LICS) Symmetry in Concurrent Games (CSPSAT) BreakIDGlucose: on the importance of row symmetry
synaptic vesicle cycle	(HSB) FM-Sim : A Hybrid Protocol Simulator of Fluorescence Microscopy Neuroscience Assays with Integrated Bayesian Inference
Syntactic cut-elimination	(GSB) On cuts and cut-elimination in modal fixed point logics
syntax-semantics interface	(NLCS) Transfer Semantics for the Clear Parser (NLCS) Algebraic Effects and Handlers in Natural Language Interpretation
synthesis	(FRIDA) On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering (FRIDA) Synthesizing self-stabilizing fault-tolerant algorithms (extended abstract) (FRIDA) Round model for distributed algorithms: from verification to implementation. (FRIDA) Synthesis for Resilient Distributed Systems (CAV) Safraless Synthesis for Epistemic Temporal Specifications (LC) Synthesis for monadic logic over the reals (CSL-LICS) The Complexity of Admissibility in Omega-Regular Games (SYNT) Synthesis of a simple self stabilizing system (CSF) Automated Analysis and Synthesis of Block-Cipher Modes of Operation (iPRA) Practical CNF Interpolants Via BDDs (PAS) Synthesis of Algorithms on Sets Represented as Monotone Lists
synthetic biology	(HSB) Bayesian Design for Whole Cell Synthetic Biology Models
System Architecture	(KR4HC) META-GLARE: a meta-system for defining your own CIG system: Architecture and Acquisition
System description	(IJCAR) Quati: An Automated Tool for Proving Permutation Lemmas (SAT) DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (VSTTE) The KeY Platform for Verification and Analysis of Java Programs (DL) DIP: A Defeasible-Inference Platform for OWL Ontologies (RTA-TLCA) Nagoya Termination Tool (System Description)
System F	(CSL-LICS) System F with Coercion Constraints
System T	(RTA-TLCA) Abstract datatypes for real numbers in type theory
Systematic Testing	(EC2) Concolic Testing of Concurrent Programs
SystemC	(ACL2) Modeling Algorithms in SystemC and ACL2
Systems Biology	(WPTE) Attractor Equivalence: An Observational Semantics for Reaction Networks
T
Tableau	(CAV) Causal Termination of Multi-threaded Programs (IJCAR) The Complexity of Theorem Proving in Circumscription and Minimal Entailment (LC) Complexity bounds for Multiagent Justification Logic (LCC) Closing a Gap in the Complexity of Refinement Modal Logic (ICLP) Reasoning with Probabilistic Logics (ADDCT) Axiomatic and Tableau-Based Reasoning for Kt(H,R) (ARW-DT) Tableau Development for a Bi-Intuitionistic Tense Logic (iPRA) On Enumerating Query Plans via Interpolants from Tableau Proofs (abstract)
Tableau Algorithm	(DL) Optimised Absorption for Expressive Description Logics
Tableau Algorithms	(IJCAR) Coupling Tableau Algorithms for Expressive Description Logics with Completion-Based Saturation Procedures
tableau reasoning	(DL) Bridging the Gap between Tableau and Consequence-Based Reasoning
tableau systems	(NMR) Tableau vs. Sequent Calculi for Minimal Entailment
Tableau-based Decision Methods	(KR) Satisfiability of Alternating-time Temporal Epistemic Logic through Tableaux
tableaux	(IJCAR) Optimal tableaux-based decision procedure for testing satisfiability in the Alternating-time temporal logic ATL+ (IJCAR) COOL -- A Generic Satisfiability Checker For Coalgebraic Logics with Global Assumptions (System Description) (ITP) Completeness and Decidability Results for CTL in Coq
Tableaux calculi	(ARW-DT) Models Minimal Modulo Subset-Simulation for Expressive Propositional Modal Logics
tableaux calculus	(IJCAR) Terminating Minimal Model Generation Procedures for Propositional Modal Logics
tabled abduction	(ICLP) Joint Tabling of Logic Program Abductions and Updates
Tabling	(ICLP) Tabling, Rational Terms, and Coinduction Finally Together! (ICLP) Incremental Tabling for Knowledge Representation and Reasoning (ICLP) Using Tabled Logic Programming to Solve the Petrobras Planning Problem (ICLP) A Simple and Efficient Lock-Free Hash Trie Design for Concurrent Tabling
tactics	(Coq) Presentation of Three Neat Tricks in Coq 8.5 (ITP) Implicational Rewriting Tactics in HOL
tactics and tacticals	(LFMTP) Automatically Deriving Schematic Theorems for Dynamic Contexts
tag systems	(LATD) Undecidability of consequence relation in Full Non-associative Lambek Calculus
tagged hardware	(FCS-FCC) Micro-Policies: Formally Verified Low-Level Tagging Schemes for Safety and Security (Short Paper)
tame structures	(LC) Pregeometries and definable groups
Tarski	(IJCAR) Otter proofs of theorems in Tarskian geometry
task planning	(RCRA) A Systematic Analysis of Levels of Integration between High-Level Task Planning and Low-Level Feasibility Checks
Taylor expansion	(TermGraph) Injectivity of Relational Semantics for (Connected) MELL Proof-Nets via Taylor Expansion (Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
taylor series	(ACL2) Formal Verification of Medina's Sequence of Polynomials for Approximating Arctangent
TBox Revision	(DL) Instance-driven TBox Revision in DL-Lite
TC_0	(CSL-LICS) Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic
teaching	(HOR) Experience with Higher Order Rewriting from the Compiler Teaching Trenches
technical vision	(CICLOPS-WLPE) Intelligent Visual Surveillance Logic Programming: Implementation Issues
Technology Adoption	(CSF) Who’s Afraid of Which Bad Wolf? A Survey of IT Security Risk Awareness
telecommunication protocol	(SMT) Protocol log analysis with constraint programming
Temperature puzzle	(NLCS) Solving Partee's Temperature Puzzle in an EFL-Ontology
template iterations	(LC) Cardinal invariants and template iterations
templates domain	(NSV) Policy iteration in finite templates domain
temporal attributes	(DL) Transition Constraints for Temporal Attributes
Temporal Description Logics	(KR) Lightweight Description Logics and Branching Time: a Troublesome Marriage (DL) Transition Constraints for Temporal Attributes
temporal logic	(LOLA) A Cross-Language Framework for Verifying Compiler Optimizations (KR) Model Checking Unbounded Artifact-Centric Systems (KR) Satisfiability of Alternating-time Temporal Epistemic Logic through Tableaux (KR) Reasoning about Equilibria in Game-like Concurrent Systems (IJCAR) dTL²: Differential Temporal Dynamic Logic with Nested Modalities for Hybrid Systems (IJCAR) A Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic (IJCAR) Visibly Linear Temporal Logic (LC) Modal logic of clocks: Modalizing a first-order theory of time to get a better understanding of relativity theories (CSL-LICS) Local Temporal Reasoning (DL) Temporalising EL Concepts with Time Intervals (DL) Temporal OBDA with LTL and DL-Lite (WST) Fairness for Infinite-State Systems (WPTE) Verifying Optimizations for Concurrent Programs (ARQNL) Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics (ARW-DT) Socratic Proofs for Propositional Linear-Time Logic
temporal logics	(IJCAR) QBF Encoding of Temporal Properties and QBF-Based Verification (AISS) Model Checking Communicating Finite-State Machines using Local Temporal Logics (ITP) Completeness and Decidability Results for CTL in Coq
Temporal projection	(KR) Action Theories over Generalized Databases with Equality Constraints (Extended Abstract)
temporal querying	(DL) Complexity of Temporal Query Abduction in DL-Lite
Temporal Reasoning	(KR) Strong Equivalence of Non-monotonic Temporal Theories
temporal stable models	(ASPOCP) Temporal Stable Models are LTL-representable
tensor algebra	(LATD) On tensor product in Lukasiewicz logic
tensor product	(LATD) On tensor product in Lukasiewicz logic
Tensorial logic	(LOLA) Tensorial logic with algebraic effects (HOPA) The modal nature of colors in higher-order model-checking
Term	(CSL-LICS) A quest for algorithmically random infinite structures (LATD) On satisfiability of terms in FLew-algebras
term algebra	(QUANTIFY) Projective Quantifier Elimination for Equational Constraint Solving
term indexing	(ARW-DT) The Leo-III Project
term ordering	(ARW-DT) The Leo-III Project
term representation	(PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation
Term Rewrite Systems	(WST) Type Introduction for Runtime Complexity Analysis
term rewriting	(IWC) Certification of Confluence Proofs using CeTA (IWC) Normalization Equivalence of Rewrite Systems (IJCAR) Proving Termination of Programs Automatically with AProVE (VSTTE) Certification of Nontermination Proofs using Strategies and Nonlooping Derivations (ITP) A New and Formalized Proof of Abstract Completion (UITP) The Certification Problem Format (WST) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (WST) Non-termination using Regular Languages (IFIP-WG16) Rhythm Tree Rewriting (IFIP-WG16) Basic Normalization (IFIP-WG16) Decision Procedures for Proving Inductive Theorems without Induction (WPTE) A Complexity Preserving Transformation from Jinja Bytecode to Rewrite Systems (WPTE) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (RTA-TLCA) Nagoya Termination Tool (System Description) (RTA-TLCA) Automated Complexity Analysis Based on Context-Sensitive Rewriting (RTA-TLCA) Amortised Resource Analysis and Typed Polynomial Interpretations
Term rewriting system	(RTA-TLCA) An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting
Term Rewriting Systems	(IWC) Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract) (RTA-TLCA) Proving Confluence of Term Rewriting Systems via Persistency and Decreasing Diagrams
Term Size Analysis	(ICLP) Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types
terminal semantics	(DTP) Terminal semantics for codata types in intensional Martin-Löf type theory
termination	(ICLP) Guarding Corecursion in Logic Programming (CAV) Causal Termination of Multi-threaded Programs (UNIF) Constraint Manipulation in SGGS (IJCAR) Proving Termination and Memory Safety for Programs with Pointer Arithmetic (IJCAR) Proving Termination of Programs Automatically with AProVE (CSL-LICS) Compositional Verification of Termination-Preserving Refinement of Concurrent Programs (PSC) Extracting Monadic Parsers from Proofs (WST) Automating Elementary Interpretations (WST) Kurth's Criterion H Revisited (WST) Automatic Termination Analysis for GPU Kernels (WST) Reducing Deadlock and Livelock Freedom to Termination (WST) A Solution to Endrullis-08 and Similar Problems (WST) To Infinity... and Beyond! (WST) Another Proof for the Recursive Path Ordering (WST) On the derivational complexity of Kachinuki orderings (WST) Automated SAT Encoding for Termination Proofs with Semantic Labelling and Unlabelling (WST) On Improving Termination Preservability of Transformations from Procedural Programs into Rewrite Systems by Using Loop Invariants (VPT) Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem (RTA-TLCA) Termination of Cycle Rewriting (RTA-TLCA) Nagoya Termination Tool (System Description) (RTA-TLCA) Formalizing monotone algebras for certification of termination- and complexity proofs (NMR) Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
termination analysis	(CAV) Termination Analysis by Learning Terminating Programs (CAV) A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (RTA-TLCA) First-Order Formative Rules
Termination proof	(TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion
Termination Theorem	(PSC) Effective Bounds on the Podelski-Rybalchenko Termination Theorem
terminologies	(DL) Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs
termspace forcing	(LC) Restricting Martin's axiom to a ccc ground model
test data generation	(CHR) Automated Test Case Generation and Model Checking with CHR (ACL2) Data Definitions in ACL2 Sedan
testing	(VSTTE) The KeY Platform for Verification and Analysis of Java Programs (SMT) Protocol log analysis with constraint programming (SMT) raSAT: SMT for Polynomial Inequality (ASA) Well-typed generic smart-fuzzing for APIs
textual entailment	(NMR) Towards a Benchmark of Natural Language Arguments
teyjus system	(CICLOPS-WLPE) A Lambda Prolog Based Animation of Twelf Specifications
tgds	(ICLP) The Impact of Disjunction on Reasoning under Existential Rules
the B I monoid	(RTA-TLCA) Near semi-rings and lambda calculus
the bar induction	(LC) Proof-Theoretic Analysis of Brouwer's Argument of the Bar Induction
The Correctnes Of Transformations	(WPTE) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting
The dependency pair framework	(RTA-TLCA) Nagoya Termination Tool (System Description)
the game of Alonzo	(RTA-TLCA) Near semi-rings and lambda calculus
the pcp theorem	(PC) Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
The theory of subsets of $\omega_1$	(LC) Large cardinals, forcing axioms, and the theory of subsets of \omega_1
theorem prover	(FRIDA) Mechanical Verification of a Constructive Proof for FLP
theorem prover technology	(ITP) Collaborative Interactive Theorem Proving with Clide
theorem provers	(UITP) UTP2: Higher-Order Equational Reasoning by Pointing
theorem proving	(NSV) Theorem-Proving Analysis of Digital Control Logic Interacting with Continuous Dynamics (IWC) Certification of Confluence Proofs using CeTA (CAV) A Conference Management System with Verified Document Confidentiality (IJCAR) Unified Classical Logic Completeness: A Coinductive Pearl (IJCAR) Knowledge Engineering for Large Ontologies with Sigma KEE 3.0 (IJCAR) NESCOND: an Implementation of Nested Sequent Calculi for Conditional Logics (VSTTE) The KeY Platform for Verification and Analysis of Java Programs (FCS-FCC) A Hybrid Analysis for Security Protocols with State (ITP) Formal Verification of Optical Quantum Flip Gate (ITP) Mechanical Certification of Loop Pipelining Transformations: A Preview (ACL2) Development of a Translator from LLVM to ACL2 (ACL2) Using ACL2 to Verify Loop Pipelining in Behavioral Synthesis (CSF) Certificates for Verifiable Forensics (Isabelle) Amortized Complexity Verified (FWFM) Towards the Application of Formal Methods in Process Engineering (NLSR) Natural Language Access to Data (ARQNL) Proof Support for Common Logic (ARQNL) Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic (RTA-TLCA) Formalizing monotone algebras for certification of termination- and complexity proofs (PAAR) Polymorphic+Typeclass Superposition (KR4HC) Using First-Order Logic to Represent Clinical Practice Guidelines and to Mitigate Adverse Interactions
theorem-prover implementation	(ITP) The reflective Milawa theorem prover is sound (down to the machine code that runs it)
Theorem-Proving	(IJCAR) Clausal Resolution for Modal Logics of Confluence (ARW-DT) A Resolution-Based Prover for Normal Modal Logics
Theorema	(PAS) The Theorema Approach to Mathematics
Theories of interpretation	(LC) Restrictiveness relative to notions of interpretation
Theory approximation	(iPRA) Application Patterns of Projection/Forgetting
Theory combination	(CAV) Yices 2.2
theory of almost sure validities	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
Theory of arrays	(SMT) Decision Procedures for Flat Array Properties
Theory of Play	(LC) The DNA of logic and games.
Theory of Strings	(CAV) A DPLL(T) Theory Solver for a Theory of Strings and Regular Expressions
theory S relative the class of formulae C)	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
Threat models	(STAST) Modelling User Devices in Security Ceremonies
Three-value logic	(LATD) Bitopological Duality and Three-valued Logic
Three-valued logic	(ARQNL) Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic
Three-valued Lukasiewicz Logic	(KR) An Abductive Reasoning Approach to the Belief-Bias Effect
three-valued semantics	(KR) An Abstraction Technique for the Verification of Multi-Agent Systems Against ATL Specifications
Three-valued Łukasiewicz Logic	(ICLP) Contextual Abductive Reasoning with Side-Effects
tiling problem	(UNIF) Two-sided unification is NP-complete
time	(FRIDA) Towards binary circuit models that faithfully reflect physical (un)solvability (DL) Temporalising EL Concepts with Time Intervals
Time Travel	(KR) Representing and Reasoning About Time Travel Narratives: Foundational Concepts
timed automata	(FRIDA) Model-Checking of Parameterized Timed-Systems (VSTTE) Model Checking Parameterized Timed Systems
timed transition systems	(VSTTE) Timed Refinements for Verification of Real-Time Object Code Programs
timed verification	(CAV) Diamonds are a Girl's Best Friend: Partial Order Reduction for Timed Automata With Abstractions
timing analysis	(PAS) Successfully Coping with Scalability of Symbolic Analysis in Timing Analysis
Timing Attacks	(CSF) TUC: Time-sensitive and Modular Analysis of Anonymous Communication
Timing of Security Decisions	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing
TLA	(ARQNL) Coalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics
TLA+	(FRIDA) Having SPASS with Pastry and TLA+
TLB	(VSTTE) Store Buffer Reduction with MMUs
TLS	(CSF) Actor Key Compromise: Consequences and Countermeasures
token	(ASA) Caetus tool
token machines	(CSL-LICS) The Geometry of Synchronization
token-passing systems	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach
Tool	(FCS-FCC) A tool for automating the computationally complete symbolic attacker
Tool description	(ORE) TROvE: a Graphical Tool to Evaluate OWL Reasoners
Tool paper	(UITP) Tinker, tailor, solver, proof
tool support	(IJCAR) A Tool that Incrementally Approximates Finite Satisfiability in Full Interval Temporal Logic
Tools	(CAV) Engineering a Static Verification Tool for GPU Kernels (CAV) Software Verification in the Google App-Engine Cloud
top-down query-answering	(ASPOCP) Query Answering in Resource-Based Answer Set Semantics
topological dynamics	(LC) Definable topological dynamics and real Lie groups
Topological vector spaces	(SD) Weak topologies for Linear Logic
topology	(ITP) Recursive Functions on Codatatypes via Domains and Topologies (CSF) The Complexity of Estimating Systematic Risk in Networks
Topos theory	(LC) A sheaf model of randomness
Tor	(CSF) TUC: Time-sensitive and Modular Analysis of Anonymous Communication
Total Space	(PC) Total Space in Resolution
TPTP	(ACL2) Experiments with TPTP-style Automated Theorem Provers on ACL2 Problems (Vampire) First Class Boolean Type in First-Order Theorem Proving and TPTP (PAAR) Automated Theorem Proving using the TPTP Process Instruction Language
TPTP process Instruction language	(PAAR) Automated Theorem Proving using the TPTP Process Instruction Language
tracing	(DL) Goal-Directed Tracing of Inferences in EL Ontologies
tractability boundaries	(DL) Pushing the CFDnc Envelope
tractability theory	(PC) Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction
Tractable Classes	(CSPSAT) Some New Tractable Classes of CSPs and their Relations with Backtracking Algorithms
Training of HC professionals in differential diagnosis	(KR4HC) Training residents in the application of clinical guidelines for differential diagnosis of the most frequent causes of arterial hypertension with decision tables
Trakhtenbrot theorem	(LATD) Trakhtenbrot theorem and first-order axiomatic extensions of MTL
transaction	(STAST) What You Enter Is What You Sign: input integrity in an online banking environment
transaction logic	(ICLP) Transaction Logic with (Complex) Events
transactions	(ICLP) Transaction Logic with (Complex) Events
Transfer	(Isabelle) From Types to Sets in Isabelle/HOL
transfer of meta-theory	(HOR) The dynamic pattern calculus as a higher-order pattern rewriting system
transfer theorem	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
transfinite reduction	(RTA-TLCA) Proof terms for infinitary rewriting
transformation	(NMR) Inference in the FO(C) Modelling Language
Transformation Analysis	(ITP) On the Formalization of Z-Transform in HOL
transformation system	(PRUV) Generation of Parametrically Uniform Knowledge Bases in a Relational Probabilistic Logic with Maximum Entropy Semantics
Transformations	(WPTE) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
transformer	(WING) ALICe: A Framework to Improve Affine Loop Invariant Computation
transition system	(CSL-LICS) Transition systems over games (CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability (POS) Generic CDCL -- A Formalization of Modern Propositional Satisfiability Solvers
Transitive closure	(CSL-LICS) Logical Characterization of Weighted Pebble Walking Automata (DL) How to Best Nest Regular Path Queries (PSC) Intuitionistic Ancestral Logic
Translation	(PAAR) The Efficiency of Automated Theorem Proving by Translation to Less Expressive Logics (PAAR) Beagle as a HOL4 external ATP method
translation validation	(VPT) Formal Replay of Translation Validation for Highly Optimised C
translations	(GSB) Comparing Sequent Calculi via Hilbert-style Axioms
TReasoner	(ORE) Evaluating OWL 2 Reasoners in the Context Of Checking Entity-Relationship Diagrams During Software Development
tree automata	(FRIDA) Parameterised Verification of Robot Protocols: An Automata Theoretic Approach (WST) Non-termination using Regular Languages
tree automaton	(DL) How to Best Nest Regular Path Queries
Tree-Automata	(RTA-TLCA) Tree Automata with Height Constraints between Brothers
trees	(LC) Budding Trees (CSL-LICS) MSO Queries on Trees: Enumerating Answers under Updates
treewidth	(KR) On OBDDs for CNFs of Bounded Treewidth (CSL-LICS) The Tractability Frontier of Graph-Like First-Order Query Sets (LaSh) Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability (PCCR) Structural Decomposition Methods: How They Matter
trimming	(SAT) MUS Extraction using Clausal Proofs
Trip Count Prediction	(WST) Real-world loops are easy to predict : a case study
true concurrency	(VPT) Branching Processes of Conservative Nested Petri Nets
Trust	(NMR) Belief Revision and Trust
Truth	(LC) Adding a Conditional to Kripke's Theory of Truth
truth predicates	(LATD) Definability of truth predicates in abstract algebraic logic
Truth-equational logics	(LATD) Generalizing the Leibniz and Suszko operators
Tukey	(LC) Generalized Ellentuck spaces and initial Tukey chains of non-p-points
tuple	(LFMTP) Variable Arity for LF
tupled pregroup grammars	(NLCS) Computing Italian clitic and relative clauses with tupled pregroups
Tupling	(WPTE) Verifying the Correctness of Tupling Transformations based on Conditional Rewriting
Turing machine	(ITP) Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete
Turing machines	(CSL-LICS) Turing Machines with Atoms, Constraint Satisfaction Problems, and Descriptive Complexity
Turing operator	(LC) Uniform and non-uniform reducibilities of algebraic structures
Turing reducibility	(LC) Reductions in computability theory from a constructive point of view
Turing's Halting Problem	(LC) A characterization for diagonalized--out objects
Turing-computable embedding	(INFINITY) Functors in Computable Model Theory
tutorial	(HOL) Modernising HOL's documentation (HOL) Writing proof automation for HOL4
twelf	(CICLOPS-WLPE) A Lambda Prolog Based Animation of Twelf Specifications
two-dimensional partial map	(CSL-LICS) Transition systems over games
two-player games	(CAV) Solving Games without Controllable Predecessor (LATD) Coupling games for Lukasiewicz logic (iPRA) Interpolants in Two-Player Games
two-player games on weighted graphs	(CSL-LICS) Secure Equilibria in Weighted Games
two-variable logic	(CSL-LICS) Decidability of Weak Logics with Deterministic Transitive Closure
two-variable logics	(CSL-LICS) Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction
two-way automata	(CSL-LICS) Two-Way Cost Automata and Cost Logics over Infinite Trees
Type	(CSL-LICS) System F with Coercion Constraints
Type and effect system	(CSL-LICS) Abstract Interpretation from Buchi Automata
Type Classes	(Linearity) Type Classes for Lightweight Substructural Types
Type containment	(CSL-LICS) System F with Coercion Constraints
type framework	(ACL2) Data Definitions in ACL2 Sedan
type inference	(ICLP) On Termination, Confluence and Consistent CHR-based Type Inference
Type Introduction	(WST) Type Introduction for Runtime Complexity Analysis
type isomorphism	(ITRS) On Isomorphism of "Functional'' Intersection and Union Types (CSL-LICS) Axioms and Decidability for Type Isomorphism in the Presence of Sums
type preservation	(CLC) Dualized Type Theory
type system	(CLC) Extensional Models of Typed Lambda-mu Calculus (CAV) The Spirit of Ghost Code (ACL2) Polymorphic Types In ACL2
Type systems	(DTP) On a style of presentation of type systems (ITRS) Liquid Intersection Types (CSL-LICS) Functional Reactive Types (ADDCT) Finding Minimum Type Error Sources
type theory	(NLCS) How to do things with types (DTP) Domain Specific Languages of Mathematics (ITP) Universe Polymorphism in Coq (CSL-LICS) A type theory for productive coprogramming via guarded recursion (INFINITY) Systems of Strength H(1) (LFMTP) Internal Adequacy of Bookkeeping in Coq (LFMTP) Some constructions on ω-groupoids (RTA-TLCA) The Structural Theory of Pure Type Systems
type-based theorems	(Isabelle) From Types to Sets in Isabelle/HOL
type-directed editing	(DTP) Type-Directed Editing for Dependently-Typed Programs.
typeclasses	(Coq) Presentation of Three Neat Tricks in Coq 8.5
Typed lambda calculus	(PSC) A typed lambda-calculus with call-by-name and call-by-value iteration
typed lambda-calculus	(RTA-TLCA) Abstract datatypes for real numbers in type theory
types	(CLC) A type system for Continuation Calculus (DTP) Type-Directed Editing for Dependently-Typed Programs. (RTA-TLCA) Amortised Resource Analysis and Typed Polynomial Interpretations
typical-case complexity	(POS) Typical-case complexity and the SAT competitions
typing	(SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism
U
Ubiquitous computing	(ORE) Mini-ME 2.0: powering the Semantic Web of Things
UD-randomness	(LC) UD-randomness and the Turing degrees
ultimately-periodic sets	(CSL-LICS) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
ultrafilter	(LC) Generalized Ellentuck spaces and initial Tukey chains of non-p-points (LC) Ultraproduct construction of representative utility functions with infinite-dimensional domain
unary regular language	(AISS) Unary Pushdown Automata and Straight-Line Programs
uncertainty	(ICLP) The P-Box CDF-Intervals: Reliable Constraint Reasoning with Quantifiable Information (DL) Reasoning about Belief Uncertainty in DL-Lite N bool (PRUV) A New DL‐Lite N Bool Probabilistic Extension Using Belief (ICLP) CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty
Uncertainty Reasoning	(IJCAR) The Bayesian Description Logic BEL (NMR) Probabilistic Inductive Logic Programming based on Answer Set Programming
undecidability	(LC) Generalizations of Hilbert's Tenth Problem (LC) Finite Inseparability of Elementary Theories Based on Connection (LATD) Undecidability of consequence relation in Full Non-associative Lambek Calculus
unfolding	(DL) A Stream-Temporal Query Language for Ontology Based Data Access (WPTE) Inverse Unfold Problem and Its Heuristic Solving (VPT) On Unfolding for Programs Using Strings as a Data Type
Unfolding graph rewriting	(TermGraph) Proving Termination of Unfolding Graph Rewriting for General Safe Recursion
unfoldings	(VPT) Branching Processes of Conservative Nested Petri Nets
Unification	(GSB) Simpler Proof Net Quantifiers: Unification Nets (Work in Progress) (UNIF) Hierarchical Combination of Matching Algorithms (Extended Abstract) (UNIF) Two-sided unification is NP-complete (UNIF) Towards a better-behaved unification algorithm for Coq (UNIF) On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract) (UNIF) Unification in the normal modal logic Alt1 (Coq) Towards a better-behaved unification algorithm for Coq (ITP) Universe Polymorphism in Coq (CSL-LICS) Equality and Fixpoints in the Calculus of Structures (DL) Matching with respect to general concept inclusions in the Description Logic EL (CSF) Modeling Diffie-Hellman Derivability for Automated Analysis (RTA-TLCA) Unification and Logarithmic Space (PAAR) Logtk : A Logic ToolKit for Automated Reasoning and its Implementation (HOR) Feebly not weakly
Unification type	(UNIF) From Admissibility to a New Hierarchy of Unification Types
uniform continuity	(CLC) Relative Computability and Uniform Continuity of Non-Extensional (aka Multivalued) 'Functions'
uniform distribution	(LC) UD-randomness and the Turing degrees
Uniform Interpolation	(KR) Toward a Knowledge Level Analysis of Forgetting (IJCAR) Count and Forget: Uniform Interpolation of SHQ-Ontologies (LC) On Uniform Interpolation for the Guarded Fragment (DL) Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes (ARW-DT) Computing Uniform Interpolants of ALCH-Ontologies with Background Knowledge (iPRA) Resolution Based Uniform Interpolation for Expressive Description Logics (iPRA) Application Patterns of Projection/Forgetting
Uniform interpolation and forgetting	(KR) Practical Uniform Interpolation and Forgetting for ALC TBoxes with Applications to Logical Difference
uniform iterativity	(LOLA) Programming and Verifying with Effect Handling and Iteration
uniform termination	(WST) Kurth's Criterion H Revisited (WST) A Solution to Endrullis-08 and Similar Problems
uniformity	(Linearity) A new point of view on the Taylor expansion of proof-nets and uniformity
Uniformization	(LC) Uniformization in the hereditarily finite list superstructure over the real exponential field
Uniformization Rule	(LC) Some properties of Intuitionistic Set Theory with the principle UP.
unifying theories of programming	(UITP) UTP2: Higher-Order Equational Reasoning by Pointing
Uninorm Logic	(LATD) Densification via polynomial extensions
unintentional	(STAST) Reflecting on the Ability of Enterprise Security Policy to Address Accidental Insider Threat
Union of non-disjoint theories	(ADDCT) Satisfiability Modulo Non-Disjoint Combinations of Theories Connected via Bridging Functions
Universal algebra	(CSL-LICS) A quest for algorithmically random infinite structures
Universal composability	(CSF) From input private to universally composable secure multiparty computation primitives
universal numbering	(LC) Relativized universal numberings
universal translation	(LATD) Definability of truth predicates in abstract algebraic logic
universally definable	(LATD) Definability of truth predicates in abstract algebraic logic
universe polymorphism	(Coq) Presentation of Three Neat Tricks in Coq 8.5
universes	(Coq) Presentation of Three Neat Tricks in Coq 8.5 (Coq) Proof-relevant rewriting strategies in Coq (ITP) Universe Polymorphism in Coq
unraveling	(WPTE) On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings
Unravelings	(WPTE) Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems
unsatisfiability proof	(POS) Validating Unsatisfiability Results of Clause Sharing Parallel SAT Solvers
unwinding relation	(CAV) A Conference Management System with Verified Document Confidentiality
up-to techniques	(CSL-LICS) Coinduction Up-To in a Fibrational Setting
update	(KR) A Dynamic Logic Framework for Abstract Argumentation (KR) Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments
updates	(ICLP) Incremental Tabling for Knowledge Representation and Reasoning (ICLP) On Strong and Default Negation in Answer-Set Program Updates (NMR) On Strong and Default Negation in Logic Program Updates
upper bound	(PC) n^O(log log n) size monotone proofs of the weak pigeonhole principle
Upper bounds	(LC) Complexity bounds for Multiagent Justification Logic
Upper Complexity Bounds	(LCC) Closing a Gap in the Complexity of Refinement Modal Logic
upper powerdomain	(LATD) Semantic information and fuzziness
Usability	(STAST) Decision justifications for wireless network selection (UITP) How to Put Usability into Focus: Using Focus Groups to Evaluate the Usability of Interactive Theorem Provers (ARW-DT) Towards Evaluating the Usability of Interactive Theorem Provers
usable rules	(RTA-TLCA) First-Order Formative Rules
Usable Security	(CSF) How task familiarity and cognitive predispositions impact behavior in a security game of timing (CSF) Who’s Afraid of Which Bad Wolf? A Survey of IT Security Risk Awareness
Use cases and deployments of computerized guidelines and protocols with EPRs	(KR4HC) Real Rules, Real Data -- Addressing Challenges of Reasoning HIPAA Privacy Rule in Health Information Exchange (HIE)
user interface	(UITP) A Logic-Independent IDE
user interfaces	(UITP) UTP2: Higher-Order Equational Reasoning by Pointing
user interfaces for interactive theorem provers	(ITP) Asynchronous User Interaction and Tool Integration in Isabelle/PIDE (ITP) Collaborative Interactive Theorem Proving with Clide
user perception	(STAST) Decision justifications for wireless network selection
Users	(STAST) Using Statistical Information to Communicate Android Permission Risks to Users
Utility Theory	(PRUV) Multi-Attribute Decision Making using Weighted Description Logics
V
vagueness	(LC) Formalizing vagueness as a doxastic, relational concept (PRUV) In Which Sense Is Fuzzy Logic a Logic for Vagueness?
Validation	(ICLP) Towards Assertion-based Debugging of Higher-Order (C)LP Programs
Validation of Numerical Programs	(NSV) Transformation of a PID Controller for Numerical Accuracy
validity	(PAS) A Model Theory for R-calculus without Cut
Vampire	(Vampire) Playing with AVATAR (Vampire) SAT solving experiments in Vampire (Vampire) My Life with an Automatic Theorem Prover
variable bindings	(LFMTP) A Generic Approach to Proofs about Substitution
Variable Dependencies	(QBF) Resolution Paths and Term Resolution
Variable Elimination	(ICLP) Lifted Variable Elimination for Probabilistic Logic Programming
Variational Bayes	(PLP) Exploring probabilistic grammars of symbolic music using PRISM
varieties	(LATD) The lattice of varieties generated by small residuated lattices
variety	(LATD) Semantial and syntactial charaterisation of some extensions of the class of MV-algebras
VASS	(AISS) Simulation Over One-Counter Nets is PSPACE-Complete
Vaught's conjecture	(INFINITY) Classes of structures with no intermediate isomorphism problems
VCG	(Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work)
vector addition systems	(CSL-LICS) Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems (CSL-LICS) Infinite-State Energy Games (CSL-LICS) Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Vector Space Semantics	(NLCS) A low-level treatment of quantifiers in categorical compositional distributional semantics
verification	(CHR) Automated Test Case Generation and Model Checking with CHR (KR) State-Boundedness for Decidability of Verification in Data-Aware Dynamic Systems (FRIDA) Having SPASS with Pastry and TLA+ (CAV) Engineering a Static Verification Tool for GPU Kernels (CAV) Program Verification through String Rewriting (CAV) Invariant verification of nonlinear hybrid automata networks of cardiac cells (CAV) Causal Termination of Multi-threaded Programs (CAV) Finding instability in biological models (CAV) From Invariant Checking to Invariant Inference Using Randomized Search (CAV) Automatic Atomicity Verification for Clients of Concurrent Data Structures (CAV) Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) (VeriSure) A Graphical Notation for Probabilistic Specifications (IJCAR) QBF Encoding of Temporal Properties and QBF-Based Verification (SAT) Dominant Controllability Check Using QBF-Solver and Netlist Optimizer (VSTTE) Store Buffer Reduction with MMUs (VSTTE) Formal Modeling and Verification of CloudProxy (VSTTE) The KeY Platform for Verification and Analysis of Java Programs (ITRS) Indexed linear logic and higher-order model checking (CSL-LICS) Senescent Ground Tree Rewrite Systems (SYNT) AbsSynthe: abstract synthesis from succinct safety specifications (VEMDP) Verifying Polymer Reaction Networks using Bisimulation (VEMDP) Modeling and Analysis of Genetic Boolean Gates Using the Infobiotics Workbench (CSF) Certificates for Verifiable Forensics (WST) Specifying and verifying liveness properties of QLOCK in CafeOBJ (Isabelle) Amortized Complexity Verified (VPT) A Note on Program Specialization. What Syntactical Properties of Residual Programs Can Reveal? (VPT) Verification of Multi-Party Ping-Pong Protocols via Program Transformation (VPT) Formal Replay of Translation Validation for Highly Optimised C (ARW-DT) Reasoning about Auctions (PAS) Programming Language Aggregation with Applications in Equivalence Checking (PAS) Automated verification of security protocols and services (PAS) The Verification of Conversion Algorithms between Finite Automata
verification condition generator	(Isabelle) Towards Structured Proofs for Program Verification (Ongoing Work)
Verification conditions	(VSTTE) A Verification Condition Visualizer
verification of object code	(VSTTE) Timed Refinements for Verification of Real-Time Object Code Programs
verification of requirement specification	(PAS) New predicate transformer for symbolic modeling
verification tools	(CAV) LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes (VERIFY) Reasoning About Vote Counting Schemes Using Light-weight and Heavy-weight Methods
verificiation	(FRIDA) Round model for distributed algorithms: from verification to implementation.
verified RTOS	(VSTTE) Efficient Refinement Checking in VCC
Verified Software	(CSF) Portable Software Fault Isolation
Verified verifiers	(VSTTE) Using Promela in a Fully Verified Executable LTL Model Checker (SHORT)
verifying compiler	(ITP) Proof Pearl: Proving a Simple Von Neumann Machine Turing Complete
veriT	(SMT) Extending SMT-LIB v2 with lambda-terms and polymorphism
viability	(DTP) Sequential decision problems and a computational theory of avoidability
Vickrey's theorem	(ACL2) On Vickrey's Theorem and the Use of ACL2 for Formal Reasoning in Economics
Video Games	(ICLP) Logic Programming as Scripting Language for Bots in Computer Games
Virtual Characters	(ICLP) Logic Programming as Scripting Language for Bots in Computer Games
virtual machine	(CICLOPS-WLPE) A Parallel Virtual Machine for Executing Forward-Chaining Linear Logic Programs
virtual substitution	(SMT) Better Answers to Real Questions
virtual term substitution	(PAS) A note on real quantifier elimination by virtual term substitution of unbounded degree
Visible strategies	(LOLA) Tensorial logic with algebraic effects
Visibly Pushdown Languages	(CAV) Symbolic Visibly Pushdown Automata (IJCAR) Visibly Linear Temporal Logic
visual and spatial cognition and computation	(KR) Computing Narratives of Cognitive User Experience for Building Design Analysis: KR for Industry Scale Computer-Aided Architecture Design
Visual Languages	(DL) Graphol: Ontology representation through diagrams
Visual query formulation	(DL) OptiqueVQS: Visual Query Formulation for OBDA
Visual query formulation interface	(DL) On Faceted Search over Knowledge Bases
visualization	(VSTTE) A Verification Condition Visualizer (VSTTE) The KeY Platform for Verification and Analysis of Java Programs (UITP) Advanced Proof Viewing in PROOFTOOL
von Neumann's Minimax theorem	(LC) Nash equilibrium semantics for Independence-Friendly Logic
vulnerability	(FCS-FCC) Adversary Gain vs. Defender Loss in Quantified Information Flow
W
W[2]-hardness	(PCCR) Backdoors into Two Occurrences
Wadge-like hierarchies	(LC) A new lower bound for the length of the hierarchy of norms
Wave-style Token machines	(Linearity) Wave-Style Token Machines and Quantum Lambda Calculi
weak arithmetic	(LC) The problem of a model without collection and without exponentiation
weak circular minimality	(LC) Some remarks on $\aleph_0$-categorical weakly circularly minimal structures
Weak Completion Semantics	(ICLP) Contextual Abductive Reasoning with Side-Effects (KR) An Abductive Reasoning Approach to the Belief-Bias Effect
weak constraints	(ASPOCP) On the Implementation of Weak Constraints in WASP
weak EXP hierarchy	(CSL-LICS) Subclasses of Presburger Arithmetic and the Weak EXP Hierarchy
weak memory	(ACL2) An ACL2 Mechanization of an Axiomatic Framework for Weak Memory
Weak Memory Models	(CAV) Don't sit on the fence: A static analysis approach to automatic fence insertion (CSF) Noninterference under Weak Memory Models
weak monadic second-order	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
weak normalization	(CLC) Dualized Type Theory (RTA-TLCA) The Structural Theory of Pure Type Systems
weak pigeonhole principle	(PC) n^O(log log n) size monotone proofs of the weak pigeonhole principle
Weak relevant model structures	(LC) Blocking the routes to triviality with depth relevance
weak simulation	(AISS) Simulation for infinite state systems.
weakly implicative logic	(LATD) Church-style type theories over finitary weakly implicative logics
weakly shallow	(IWC) Non-E-overlapping and weakly shallow TRSs are confluent (Extended abstract)
Web authentication	(CSF) Provably Sound Browser-Based Enforcement of Web Session Integrity
Web of Linked Data	(KR) Knowledge Maps of Web Graphs
web programming	(ICLP) Pengines: Web Logic Programming Made Easy
web scripts	(CSF) Stateful Declassification Policies for Event-Driven Programs
web service choreography	(WWV) A Local Logic for Realizability in Web Service Choreographies
Website Fingerprinting	(CSF) TUC: Time-sensitive and Modular Analysis of Anonymous Communication
weight	(SAT) Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
Weighted first-order logic	(CSL-LICS) Logical Characterization of Weighted Pebble Walking Automata
Weighted Model Counting	(PLP) Lifted Inference for Probabilistic Logic Programs
weights	(CSL-LICS) Weight Monitoring with Linear Temporal Logic: Complexity and Decidability
Weihrauch degree	(LC) Randomness in the Weihrauch degrees
Weihrauch reducibility	(LC) Reductions in computability theory from a constructive point of view
well-founded model	(ICLP) Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Well-Founded Semantics	(ICLP) Efficient Computation of the Well-Founded Semantics over Big Data (KR) The Well-Founded Semantics Is the Principle of Inductive Definition, revisited (RCRA) Efficient Computation of the Well-Founded Semantics over Big Data
Well-structured pushdown systems	(CSL-LICS) Hyper-Ackermannian Bounds for Pushdown Vector Addition Systems
well-supported models	(ICLP) On Strong and Default Negation in Answer-Set Program Updates (NMR) On Strong and Default Negation in Logic Program Updates
wellorder	(ITP) Cardinals in Isabelle/HOL
while-programs	(RTA-TLCA) Ramsey Theorem as an intuitionistic property of well founded relations
width	(SAT) Long Proofs of (Seemingly) Simple Formulas (PC) From Small Space to Small Width in Resolution (PC) Narrow Proofs May Be Maximally Long
Wiener measure	(CSL-LICS) A domain-theoretic approach to Brownian motion and general continuous stochastic processes
Winograd Schema Challenge	(KR) Tackling Winograd Schemas by Formalizing Relevance Theory in Knowledge Graphs
Winograd Schemas	(KR) Tackling Winograd Schemas by Formalizing Relevance Theory in Knowledge Graphs
witness	(VeriSure) Witnessing an SSA Transformation
WMSO	(CSL-LICS) Weak MSO: Automata and Expressiveness Modulo Bisimilarity
word equations	(CSL-LICS) Graph Logics with Rational Relations: The Role of Word Combinatorics (VPT) On Unfolding for Programs Using Strings as a Data Type
word-level model checking	(LCC) On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic
Workflow	(KR4HC) A Process-oriented Methodology for Modelling Cancer Treatment Trial Protocols
world view	(KR) First-Order Default Logic Revisited
wqo theory	(LC) Reverse mathematics of WQOs and Noetherian spaces
wrap ambiguity	(IWC) Critical Pairs in Network Rewriting
WWKL	(LC) Randomness in the Weihrauch degrees
X
XML	(ACL2) Industrial-Strength Documentation for ACL2 (UITP) The Certification Problem Format
XML and graph data	(CSL-LICS) Pattern Logics and Auxiliary Relations
XML Processing	(CAV) Symbolic Visibly Pushdown Automata
XML Schema	(CHR) From XML Schema to JSON Schema: Translation with CHR
XOR-SAT	(DCM) Interactive Particle Systems and Random Walks on Hypergraphs
xpath	(DL) XPath for DL-Lite Ontologies
XSB Prolog	(ICLP) Joint Tabling of Logic Program Abductions and Updates
XSD	(CHR) From XML Schema to JSON Schema: Translation with CHR
Y
Yablo's Paradox	(LC) A universal diagonal schema by fixed-points and Yablo’s paradox
Z
Z-Transform	(ITP) On the Formalization of Z-Transform in HOL
Zeno’s paradoxes	(LATD) Chaotic Fuzzy Liars, Degrees of Truth, and Fractal Images of Paradox
zero-knowledge proofs	(CSF) Malleable Signatures: New Definitions and Delegatable Anonymous Credentials
zero-one laws	(LC) On the almost sure validities in the finite in some fragments of monadic second-order logic
Σ
Σ^0_2-sets	(LC) On limitwise monotonic reducibility of Σ^0_2-sets.