|
Conferences in DBLP
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras. [Citation Graph (, )][DBLP]
Completeness Results for Memory Logics. [Citation Graph (, )][DBLP]
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination. [Citation Graph (, )][DBLP]
Temporalization of Probabilistic Propositional Logic. [Citation Graph (, )][DBLP]
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings. [Citation Graph (, )][DBLP]
The Logic of Proofs as a Foundation for Certifying Mobile Computation. [Citation Graph (, )][DBLP]
ATL with Strategy Contexts and Bounded Memory. [Citation Graph (, )][DBLP]
A Relational Model of a Parallel and Non-deterministic lambda-Calculus. [Citation Graph (, )][DBLP]
The NP-Completeness of Reflected Fragments of Justification Logics. [Citation Graph (, )][DBLP]
Taming Modal Impredicativity: Superlazy Reduction. [Citation Graph (, )][DBLP]
Positive Fork Graph Calculus. [Citation Graph (, )][DBLP]
Games on Strings with a Limited Order Relation. [Citation Graph (, )][DBLP]
Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees. [Citation Graph (, )][DBLP]
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic. [Citation Graph (, )][DBLP]
A Clausal Approach to Proof Analysis in Second-Order Logic. [Citation Graph (, )][DBLP]
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics. [Citation Graph (, )][DBLP]
Light Linear Logic with Controlled Weakening. [Citation Graph (, )][DBLP]
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm. [Citation Graph (, )][DBLP]
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System. [Citation Graph (, )][DBLP]
Tableaux and Hypersequents for Justification Logic. [Citation Graph (, )][DBLP]
Topological Forcing Semantics with Settling. [Citation Graph (, )][DBLP]
Automata and Answer Set Programming. [Citation Graph (, )][DBLP]
A Labeled Natural Deduction System for a Fragment of CTL*. [Citation Graph (, )][DBLP]
Conservativity for Logics of Justified Belief. [Citation Graph (, )][DBLP]
Unifying Sets and Programs via Dependent Types. [Citation Graph (, )][DBLP]
Product-Free Lambek Calculus Is NP-Complete. [Citation Graph (, )][DBLP]
Games on Multi-stack Pushdown Systems. [Citation Graph (, )][DBLP]
Data Privacy for Knowledge Bases. [Citation Graph (, )][DBLP]
Fixed Point Theorems on Partial Randomness. [Citation Graph (, )][DBLP]
Decidability and Undecidability in Probability Logic. [Citation Graph (, )][DBLP]
A Bialgebraic Approach to Automata and Formal Language Theory. [Citation Graph (, )][DBLP]
|