Conferences in DBLP
Allen Van Gelder Independently Checkable Proofs from Decision Procedures: Issues and Progress. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:1- [Conf ] Thomas Ball , Shuvendu K. Lahiri , Madanlal Musuvathi Zap: Automated Theorem Proving for Software Analysis. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:2-22 [Conf ] Robert Nieuwenhuis , Albert Oliveras Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:23-46 [Conf ] Douglas B. Lenat Scaling Up: Computers vs. Common Sense. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:47-47 [Conf ] Alessandro Dal Palù , Agostino Dovier , Enrico Pontelli A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:48-63 [Conf ] Matthias M. Hölzl , John N. Crossley Disjunctive Constraint Lambda Calculi. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:64-78 [Conf ] Yao Wu , Enrico Pontelli , Desh Ranjan Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:79-94 [Conf ] Christian Anger , Martin Gebser , Thomas Linke , André Neumann , Torsten Schaub The nomore++ Approach to Answer Set Solving. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:95-109 [Conf ] Gopalan Nadathur , Xiaochu Qi Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:110-124 [Conf ] Nachum Dershowitz The Four Sons of Penrose. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:125-138 [Conf ] Angelo Montanari , Alberto Policriti , Nicola Vitacolonna An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:139-153 [Conf ] Bernhard Beckert , Kerry Trentelman Second-Order Principles in Specification Languages for Object-Oriented Programs. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:154-168 [Conf ] Daniel J. Dougherty , Silvia Ghilezan , Pierre Lescanne , Silvia Likavec Strong Normalization of the Dual Classical Sequent Calculus. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:169-183 [Conf ] Salvador Lucas , José Meseguer Termination of Fair Computations in Term Rewriting. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:184-198 [Conf ] Jeroen Ketema , Jakob Grue Simonsen On Confluence of Infinitary Combinatory Reduction Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:199-214 [Conf ] Temur Kutsia , Mircea Marin Matching with Regular Constraints. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:215-229 [Conf ] Mirtha-Lina Fernández , Guillem Godoy , Albert Rubio Recursive Path Orderings Can Also Be Incremental. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:230-245 [Conf ] Marc Bezem , Thierry Coquand Automating Coherent Logic. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:246-260 [Conf ] Florina Piroi , Temur Kutsia The Theorema Environment for Interactive Proof Development. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:261-275 [Conf ] Magnus Björk A First Order Extension of Stålmarck's Method. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:276-291 [Conf ] Vladimir Aleksic , Anatoli Degtyarev Regular Derivations in Basic Superposition-Based Calculi. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:292-306 [Conf ] Wieslaw Szwast , Lidia Tendera On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:307-321 [Conf ] Chao Wang , Franjo Ivancic , Malay K. Ganai , Aarti Gupta Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:322-336 [Conf ] Hitoshi Ohsaki , Jean-Marc Talbot , Sophie Tison , Yves Roos Monotone AC-Tree Automata. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:337-351 [Conf ] Elaine Pimentel , Dale Miller On the Specification of Sequent Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:352-366 [Conf ] Amine Chaieb , Tobias Nipkow Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:367-380 [Conf ] Matthias Daum , Stefan Maus , Norbert Schirmer , M. Nassim Seghir Integration of a Software Model Checker into Isabelle. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:381-395 [Conf ] Deian Tabakov , Moshe Y. Vardi Experimental Evaluation of Classical Automata Constructions. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:396-411 [Conf ] Wolfgang Ahrendt , Andreas Roth , Ralf Sasse Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:412-426 [Conf ] Christoph Walther , Stephan Schweitzer Reasoning About Incompletely Defined Programs. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:427-442 [Conf ] Calvin Kai Fan Tang , Eugenia Ternovska Model Checking Abstract State Machines with Answer Set Programming. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:443-458 [Conf ] Didier Galmiche , Daniel Méry Characterizing Provability in . [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:459-473 [Conf ] Harvey Tuch , Gerwin Klein A Unified Memory Model for Pointers. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:474-488 [Conf ] Andrea Ferrara , Guoqiang Pan , Moshe Y. Vardi Treewidth in Verification: Local vs. Global. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:489-503 [Conf ] Laura Bozzelli , Aniello Murano , Adriano Peron Pushdown Module Checking. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:504-518 [Conf ] Jianjun Duan , Joe Hurd , Guodong Li , Scott Owens , Konrad Slind , Junxing Zhang Functional Correctness Proofs of Encryption Algorithms. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:519-533 [Conf ] Annabelle McIver , Tjark Weber Towards Automated Proof Support for Probabilistic Distributed Systems. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:534-548 [Conf ] David A. Basin , Sebastian Mödersheim , Luca Viganò Algebraic Intruder Deductions. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:549-564 [Conf ] Maarten Mariën , Rudradeb Mitra , Marc Denecker , Maurice Bruynooghe Satisfiability Checking for PC(ID). [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:565-579 [Conf ] Allen Van Gelder Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:580-594 [Conf ] Haiou Shen , Hantao Zhang Another Complete Local Search Method for SAT. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:595-605 [Conf ] Sylvie Coste-Marquis , Caroline Devred , Pierre Marquis Inference from Controversial Arguments. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:606-620 [Conf ] Mehdi Dastani , Guido Governatori , Antonino Rotolo , Leendert W. N. van der Torre Programming Cognitive Agents in Defeasible Logic. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:621-636 [Conf ] Jürgen Dix , Wolfgang Faber , V. S. Subrahmanian The Relationship Between Reasoning About Privacy and Default Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:637-650 [Conf ] Mikhail Sheremet , Dmitry Tishkovsky , Frank Wolter , Michael Zakharyaschev Comparative Similarity, Tree Automata, and Diophantine Equations. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:651-665 [Conf ] Laura Giordano , Valentina Gliozzi , Nicola Olivetti , Gian Luca Pozzato Analytic Tableaux for KLM Preferential and Cumulative Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:666-681 [Conf ] Dominique Larchey-Wendling Bounding Resource Consumption with Gödel-Dummett Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:682-696 [Conf ] Matthias Baaz , Rosalie Iemhoff On Interpolation in Existence Logics. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:697-711 [Conf ] Henning Christiansen , Davide Martinenghi Incremental Integrity Checking: Limitations and Possibilities. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:712-727 [Conf ] Carsten Fritz Concepts of Automata Construction from LTL. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:728-742 [Conf ]