Representation results for defeasible logic

Representation Theory for Default Logic

Representing Isabelle in LF

Residuated Park Theories

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning

Resolution-based Query Answering for Semantic Access to Relational Databases: A Research Note

Resource Adaptive Agents in Interactive Theorem Proving

Resource-Bound Quantification for Graph Transformation

Resource-distribution via Boolean constraints

Results on the quantitative mu-calculus qMu

Resumptions, Weak Bisimilarity and Big-Step Semantics for While with Interactive I/O: An Exercise in Mixed Induction-Coinduction

Retractions of Types with Many Atoms

Reverse Bisimulations on Stable Configuration Structures

Revising Type-2 Computation and Degrees of Discontinuity

Rewrite based Verification of XML Updates

Rewriting and Well-Definedness within a Proof System

Rewriting modulo in Deduction modulo

Rewriting Preserving Recognizability of Finite Tree Languages

Rich Counter-Examples for Temporal-Epistemic Logic Model Checking

Robust Vacuity for Branching Temporal Logic