Conferences in DBLP
Franz Baader , Jan Hladik , Carsten Lutz , Frank Wolter From Tableaux to Automata for Description Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:1-32 [Conf ] Serge Autexier , Carsten Schürmann Disproving False Conjectures. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:33-48 [Conf ] Francisco-Jesús Martín-Mateos , José-Antonio Alonso , María-José Hidalgo , José-Luis Ruiz-Reina A Formal Proof of Dickson's Lemma in ACL2. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:49-58 [Conf ] Alberto Ciaffaglione , Luigi Liquori , Marino Miculan Imperative Object-Based Calculi in Co-inductive Type Theories. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:59-77 [Conf ] Robert Nieuwenhuis , Albert Oliveras Congruence Closure with Integer Offsets. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:78-90 [Conf ] Christoph Walther , Stephan Schweitzer A Machine-Verified Code Generator. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:91-106 [Conf ] Matthias Baaz , Christian G. Fermüller A Translation Characterizing the Constructive Content of Classical Theories. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:107-121 [Conf ] Sebastian Brandt , Anni-Yasmin Turhan , Ralf Küsters Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:122-136 [Conf ] Bernhard Heinemann Extended Canonicity of Certain Topological Properties of Set Spaces. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:137-151 [Conf ] Silvio Ghilardi , Luigi Santocanale Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:152-166 [Conf ] Jürgen Giesl , René Thiemann , Peter Schneider-Kamp , Stephan Falke Improving Dependency Pairs. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:167-182 [Conf ] Kumar Neeraj Verma On Closure under Complementation of Equational Tree Automata for Theories Extending AC. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:183-197 [Conf ] Barbara Morawska Completeness of E-Unification with Eager Variable Elimination. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:198-212 [Conf ] Serikzhan Badaev Computable Numberings. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:213- [Conf ] Boris Konev , Anatoli Degtyarev , Michael Fisher Handling Equality in Monodic Temporal Resolution. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:214-228 [Conf ] Dietmar Berwanger , Erich Grädel , Stephan Kreutzer Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:229-243 [Conf ] Davy Van Nieuwenborgh , Dirk Vermeir Ordered Diagnosis. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:244-258 [Conf ] Toshiko Wakaki , Katsumi Inoue , Chiaki Sakama , Katsumi Nitta Computing Preferred Answer Sets in Answer Set Programming. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:259-273 [Conf ] Quoc Bao Vo , Abhaya C. Nayak , Norman Y. Foo A Syntax-Based Approach to Reasoning about Actions and Events. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:274-288 [Conf ] Thomas Wilke Minimizing Automata on Infinite Words. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:289- [Conf ] Margarita V. Korovina Gandy's Theorem for Abstract Structures without the Equality Test. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:290-301 [Conf ] Martin Fränzle , Christian Herde Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:302-316 [Conf ] Thierry Boy de la Tour , Mnacho Echenim NP-Completeness Results for Deductive Problems on Stratified Terms. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:317-331 [Conf ] Dietrich Kuske Is Cantor's Theorem Automatic? [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:332-345 [Conf ] Markus Lohrey Automatic Structures of Bounded Degree. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:346-360 [Conf ] Jean-Michel Couvreur , Nasser Saheb , Grégoire Sutre An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:361-375 [Conf ] Christoph Beierle , Gabriele Kern-Isberner A Logical Study on Qualitative Default Reasoning with Probabilities. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:376-388 [Conf ] Paola Bruscoli , Alessio Guglielmi On Structuring Proof Search for First Order Linear Logic. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:389-406 [Conf ] Furio Honsell , Marina Lenisa , Rekha Redamalla Strict Geometry of Interaction Graph Models. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:407-421 [Conf ] Didier Galmiche , J.-M. Notin Connection-Based Proof Construction in Non-commutative Logic. [Citation Graph (0, 0)][DBLP ] LPAR, 2003, pp:422-436 [Conf ]