Conferences in DBLP
Neil D. Jones Program Termination Analysis by Size-Change Graphs (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Lawrence C. Paulson SET Cardholder Registration: The Secrecy Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Andrei Voronkov Algorithms, Datastructures, and other Issues in Efficient Automated Deduction. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Haarslev , Ralf Möller , Michael Wessel The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Lutz NEXPTIME-Complete Description Logics with Concrete Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Haarslev , Ralf Möller , Anni-Yasmin Turhan Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Ulrike Sattler , Moshe Y. Vardi The Hybrid µ-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Franz Baader , Stephan Tobies The Inverse Method Implements the Automata Approach for Modal Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Regimantas Pliuskevicius Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL. [Citation Graph (0, 0)][DBLP ] Conf ] Carsten Lutz , Holger Sturm , Frank Wolter , Michael Zakharyaschev Tableaux for Temporal Description Logic with Constant Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Serenella Cerrito , Marta Cialdea Mayer Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. [Citation Graph (0, 0)][DBLP ] Conf ] Andrea Formisano , Eugenio G. Omodeo , Marco Temperini Instructing Equational Set-Reasoning with Otter. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Szeider NP-Completeness of Refutability by Literal-Once Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Reiner Hähnle , Neil V. Murray , Erik Rosenthal Ordered Resolution vs. Connection Graph Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Stuber A Model-Based Completeness Proof of Extended Narrowing and Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Hans de Nivelle , Ian Pratt-Hartmann A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Waldmann Superposition and Chaining for Totally Ordered Divisible Abelian Groups. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Ganzinger , Robert Nieuwenhuis , Pilar Nivela Context Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Robert Nieuwenhuis , Thomas Hillenbrand , Alexandre Riazanov , Andrei Voronkov On the Evaluation of Indexing Techniques for Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] Sylvie Doutre , Jérôme Mengin Preferred Extensions of Argumentation Frameworks: Query Answering and Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Pablo A. Armelín , David J. Pym Bunched Logic Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Kewen Wang A Top-Down Procedure for Disjunctive Well-Founded Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Beeson A Second-Order Theorem Prover Applied to Circumscription. [Citation Graph (0, 0)][DBLP ] Conf ] Christian Anger , Kathrin Konczak , Thomas Linke NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Benedetti Conditional Pure Literal Graphs. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Giunchiglia , Marco Maratea , Armando Tacchella , Davide Zambonin Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Enrico Giunchiglia , Massimo Narizzano , Armando Tacchella QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Schulz System Abstract: E 0.61. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Riazanov , Andrei Voronkov Vampire 1.1 (System Description). [Citation Graph (0, 0)][DBLP ] Conf ] Reinhold Letz , Gernot Stenz DCTP - A Disconnection Calculus Theorem Prover - System Abstract. [Citation Graph (0, 0)][DBLP ] Conf ] Marko Luther More On Implicit Syntax. [Citation Graph (0, 0)][DBLP ] Conf ] Brigitte Pientka Termination and Reduction Checking for Higher-Order Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Armin Fiedler P.rex: An Interactive Proof Explainer. [Citation Graph (0, 0)][DBLP ] Conf ] Stephan Schmitt , Lori Lorigo , Christoph Kreitz , Aleksey Nogin JProver : Integrating Connection-Based Theorem Proving into Interactive Proof Assistants. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Audemard , Laurent Henocque The eXtended Least Number Heuristic. [Citation Graph (0, 0)][DBLP ] Conf ] Kahlil Hodgson , John K. Slaney System Description: SCOTT-5. [Citation Graph (0, 0)][DBLP ] Conf ] Maria Paola Bonacina Combination of Distributed Search and Multi-search in Peers-mcd.d. [Citation Graph (0, 0)][DBLP ] Conf ] Luis Fariñas del Cerro , David Fauthoux , Olivier Gasquet , Andreas Herzig , Dominique Longin , Fabio Massacci Lotrec : The Generic Tableau Prover for Modal and Description Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Jens Happe The MODPROF Theorem Prover. [Citation Graph (0, 0)][DBLP ] Conf ] Peter F. Patel-Schneider , Roberto Sebastiani A New System and Methodology for Generating Random Modal Formulae. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Giesl , Deepak Kapur Decidable Classes of Inductive Theorems. [Citation Graph (0, 0)][DBLP ] Conf ] Xavier Urbain Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Lynch , Barbara Morawska Decidability and Complexity of Finitely Closable Linear Equational Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Harald Ganzinger , David A. McAllester A New Meta-complexity Theorem for Bottom-Up Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Arnon Avron , Iddo Lev Canonical Propositional Gentzen-Type Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Giese Incremental Closure of Free Variable Tableaux. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Egly , Stephan Schmitt Deriving Modular Programs from Short Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Peltier A General Method for Using Schematizations in Automated Deduction. [Citation Graph (0, 0)][DBLP ] Conf ] Aart Middeldorp Approximating Dependency Graphs Using Tree Automata Techniques. [Citation Graph (0, 0)][DBLP ] Conf ] Bernard Boigelot , Sébastien Jodogne , Pierre Wolper On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Bernhard Beckert , Steffen Schlager A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities. [Citation Graph (0, 0)][DBLP ] Conf ] Wolfgang Reif , Gerhard Schellhorn , Andreas Thums Flaw Detection in Formal Specifications. [Citation Graph (0, 0)][DBLP ] Conf ] Jürgen Avenhaus , Bernd Löchner CCE: Testing Ground Joinability. [Citation Graph (0, 0)][DBLP ] Conf ] Alessandro Armando , Luca Compagna , Silvio Ranise System Description: RDL : Rewrite and Decision Procedure Laboratory. [Citation Graph (0, 0)][DBLP ] Conf ] Joshua S. Hodas , Naoyuki Tamura lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Pastre MUSCADET 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction. [Citation Graph (0, 0)][DBLP ] Conf ] Jörg Lücke Hilberticus - A Tool Deciding an Elementary Sublanguage of Set Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Dominique Larchey-Wendling , Dominique Méry , Didier Galmiche STRIP: Structural Sharing for Efficient Proof-Search. [Citation Graph (0, 0)][DBLP ] Conf ] Volker Haarslev , Ralf Möller RACER System Description. [Citation Graph (0, 0)][DBLP ] Conf ] 