Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog

Proving Termination of Normalization Functions for Conditional Expressions

Proving Termination of Probabilistic Programs Using Patterns

Proviola: A Tool for Proof Re-animation

Psi-calculi: a framework for mobile processes with nominal data and logic

PSPACE Bounds for Rank-1 Modal Logics

PSPACE Reasoning for Graded Modal Logics

Ptarithmetic

Public Announcement Logic in Geometric Frameworks

Pure Type Systems without Explicit Contexts

Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification

QBF-Based Boolean Function Bi-Decomposition

Qualitative Analysis of Partially-observable Markov Decision Processes

Qualitative Logics and Equivalences for Probabilistic Systems

Quanta: a Language for Modeling and Manipulating Information Structures

Quantified Propositional Logspace Reasoning

Quantifier Elimination by Dependency Sequents

Quantifier elimination for the reals with a predicate for the powers of two

Quantifier-Free Interpolation of a Theory of Arrays

Quantitative classical realizability