Conferences in DBLP
Johann A. Makowsky From Hilbert's Program to a Logic Toolbox. [Citation Graph (0, 0)][DBLP ] Conf ] Marko Samer , Helmut Veith On the Notion of Vacuous Truth. [Citation Graph (0, 0)][DBLP ] Conf ] Richard J. Waldinger Whatever Happened to Deductive Question Answering? [Citation Graph (0, 0)][DBLP ] Conf ] Aharon Abadi , Alexander Rabinovich , Mooly Sagiv Decidable Fragments of Many-Sorted Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Pietro Abate , Rajeev Goré , Florian Widmann One-Pass Tableaux for Computation Tree Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Behzad Akbarpour , Lawrence C. Paulson Extending a Resolution Prover for Inequalities on Elementary Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Roland Axelsson , Martin Lange Model Checking the First-Order Fragment of Higher-Order Fixpoint Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Baaz , Agata Ciabattoni , Christian G. Fermüller Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. [Citation Graph (0, 0)][DBLP ] Conf ] David Baelde , Dale Miller Least and Greatest Fixed Points in Linear Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Leopoldo E. Bertossi , Loreto Bravo The Semantics of Consistency and Trust in Peer Data Exchange Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Bezem , Tore Langholm , Michal Walicki Completeness and Decidability in Sequence Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio HORPO with Computability Closure: A Reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Bonichon , David Delahaye , Damien Doligez Zenon : An Extensible Automated Theorem Prover Producing Checkable Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Sebastian Brandt Matching in Hybrid Terminologies. [Citation Graph (0, 0)][DBLP ] Conf ] Yannick Chevalier , Denis Lugiez , Michaël Rusinowitch Verifying Cryptographic Protocols with Subterms Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Cortier , Stéphanie Delaune Deciding Knowledge in Security Protocols for Monoidal Equational Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Zaynah Dargaye , Xavier Leroy Mechanized Verification of CPS Transformations. [Citation Graph (0, 0)][DBLP ] Conf ] Francien Dechesne , Mohammad Reza Mousavi , Simona Orzan Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphanie Delaune , Hai Lin , Christopher Lynch Protocol Verification Via Rigid/Flexible Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Laura Giordano , Valentina Gliozzi , Nicola Olivetti , Gian Luca Pozzato Preferential Description Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Philippe de Groote , Sarah Maarek , Ryo Yoshinaka On Two Extensions of Abstract Categorial Grammars. [Citation Graph (0, 0)][DBLP ] Conf ] Éric Jaeger , Catherine Dubois Why Would You Trust B ? [Citation Graph (0, 0)][DBLP ] Conf ] Yevgeny Kazakov , Ulrike Sattler , Evgeny Zolin How Many Legs Do I Have? Non-Simple Roles in Number Restrictions Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Emanuel Kieronski , Lidia Tendera On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards. [Citation Graph (0, 0)][DBLP ] Conf ] Adila Krisnadhi , Carsten Lutz Data Complexity in the EL Family of Description Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Ludwig , Uwe Waldmann An Extension of the Knuth-Bendix Ordering with LPO-Like Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Maieli Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Maarten Mariën , Johan Wittocx , Marc Denecker Integrating Inductive Definitions in SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Damiano Mazza , Michele Pagani The Separation Theorem for Differential Interaction Nets. [Citation Graph (0, 0)][DBLP ] Conf ] Maja Milicic Complexity of Planning in Action Formalisms Based on Description Logics. [Citation Graph (0, 0)][DBLP ] Conf ] David G. Mitchell , Faraz Hach , Raheleh Mohebali Faster Phylogenetic Inference with MXG. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Ferrante , Aniello Murano , Mimmo Parente Enriched µ-Calculus Pushdown Module Checking. [Citation Graph (0, 0)][DBLP ] Conf ] Luís Moniz Pereira , Alexandre Miguel Pinto Approved Models for Normal Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Gabriele Pulcini Permutative Additives and Exponentials. [Citation Graph (0, 0)][DBLP ] Conf ] Marko Samer , Stefan Szeider Algorithms for Propositional Model Counting. [Citation Graph (0, 0)][DBLP ] Conf ] Luigi Santocanale , Yde Venema Completeness for Flat Modal Fixpoint Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Mantas Simkus , Thomas Eiter \mathbbFDNC : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols. [Citation Graph (0, 0)][DBLP ] Conf ] Stéphane Demri , Alexander Rabinovich The Complexity of Temporal Logic with Until and Since over Ordinals. [Citation Graph (0, 0)][DBLP ] Conf ] Josef Urban , Geoff Sutcliffe ATP Cross-Verification of the Mizar MPTP Challenge Problems. [Citation Graph (0, 0)][DBLP ] Conf ] 