Conferences in DBLP
Frédéric Blanqui , Jean-Pierre Jouannaud , Albert Rubio Higher-Order Termination: From Kruskal to Computability. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Limet , Pierre Pillot Deciding Satisfiability of Positive Second Order Joinability Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Codish , Peter Schneider-Kamp , Vitaly Lagoon , René Thiemann , Jürgen Giesl SAT Solving for Argument Filterings. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Falke , Deepak Kapur Inductive Decidability Using Implicit Induction. [Citation Graph (0, 0)][DBLP ] Conf ] Germain Faure Matching Modulo Superdevelopments Application to Second-Order Matching. [Citation Graph (0, 0)][DBLP ] Conf ] Georg Moser Derivational Complexity of Knuth-Bendix Orders Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Bonfante , Jean-Yves Marion , Romain Péchoux A Characterization of Alternating Log Time by First Order Functional Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Blanqui , Colin Riba Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Kentaro Kikuchi On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Agata Ciabattoni , Kazushige Terui Modular Cut-Elimination: Finding Proofs or Counterexamples. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Schürmann , Mark-Oliver Stehr An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Bonichon , Olivier Hermant A Semantic Completeness Proof for TaMeD. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Giese Saturation Up to Redundancy for Tableau and Sequent Calculi. [Citation Graph (0, 0)][DBLP ] Conf ] Laura Bozzelli , Régis Gascon Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Christian G. Fermüller , Robert Kosik Combining Supervaluation and Degree Based Reasoning Under Vagueness. [Citation Graph (0, 0)][DBLP ] Conf ] Boris Motik , Ulrike Sattler A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes. [Citation Graph (0, 0)][DBLP ] Conf ] Alwen Tiu A Local System for Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe , Benjamin Grégoire , Fernando Pastawski CIC[^( )]: Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Ozan Kahramanogullari Reducing Nondeterminism in the Calculus of Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Hendrik Decker , Davide Martinenghi A Relaxed Approach to Integrity and Inconsistency in Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman , Yoad Lustig , Moshe Y. Vardi On Locally Checkable Properties. [Citation Graph (0, 0)][DBLP ] Conf ] Véronique Cortier , Eugen Zalinescu Deciding Key Cycles for Security Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Tobias Gedell , Reiner Hähnle Automating Verification of Loops by Parallelization. [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Nathalie Bertrand , Ph. Schnoebelen On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. [Citation Graph (0, 0)][DBLP ] Conf ] John Matthews , J. Strother Moore , Sandip Ray , Daron Vroon Verification Condition Generation Via Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] Elvira Albert , Puri Arenas , Germán Puebla An Incremental Approach to Abstraction-Carrying Code. [Citation Graph (0, 0)][DBLP ] Conf ] Pawel Pietrzak , Jesús Correas , Germán Puebla , Manuel V. Hermenegildo Context-Sensitive Multivariant Assertion Checking in Modular Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Alvaro Cortés-Calabuig , Marc Denecker , Ofer Arieli , Maurice Bruynooghe Representation of Partial Knowledge and Query Answering in Locally Complete Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Philipp Rümmer Sequential, Parallel, and Quantified Updates of First-Order Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Pablo R. Fillottrani , Guillermo Ricardo Simari Representing Defaults and Negative Information Without Negation-as-Failure. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan Kavanagh , David G. Mitchell , Eugenia Ternovska , Ján Manuch , Xiaohong Zhao , Arvind Gupta Constructing Camin-Sokal Phylogenies Via Answer Set Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Barbara Fila , Siva Anantharaman Automata for Positive Core XPath Queries on Compressed Documents. [Citation Graph (0, 0)][DBLP ] Conf ] Nachum Dershowitz , Jieh Hsiang , Guan-Shieng Huang , Daher Kaiss Boolean Rings for Intersection-Based Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Ganzinger , Konstantin Korovin Theory Instantiation. [Citation Graph (0, 0)][DBLP ] Conf ] Clark Barrett , Robert Nieuwenhuis , Albert Oliveras , Cesare Tinelli Splitting on Demand in SAT Modulo Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruttomesso , Alessandro Cimatti , Anders Franzén , Alberto Griggio , Roberto Sebastiani Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis. [Citation Graph (0, 0)][DBLP ] Conf ] Hélène Kirchner , Silvio Ranise , Christophe Ringeissen , Duc-Khanh Tran Automatic Combinability of Rewriting-Based Satisfiability Procedures. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruttomesso , Alessandro Cimatti , Anders Franzén , Alberto Griggio , Alessandro Santuari , Roberto Sebastiani To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT (EUF ÈT ). [Citation Graph (0, 0)][DBLP ] Conf ] Peter Baumgartner , Alexander Fuchs , Cesare Tinelli Lemma Learning in the Model Evolution Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] 