default search action
12th LPAR 2005: Montego Bay, Jamaica
- Geoff Sutcliffe, Andrei Voronkov:
Logic for Programming, Artificial Intelligence, and Reasoning, 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings. Lecture Notes in Computer Science 3835, Springer 2005, ISBN 3-540-30553-X - Allen Van Gelder:
Independently Checkable Proofs from Decision Procedures: Issues and Progress. 1 - Thomas Ball, Shuvendu K. Lahiri, Madanlal Musuvathi:
Zap: Automated Theorem Proving for Software Analysis. 2-22 - Robert Nieuwenhuis, Albert Oliveras
:
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools. 23-46 - Douglas B. Lenat:
Scaling Up: Computers vs. Common Sense. 47-47 - Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli:
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem. 48-63 - Matthias M. Hölzl, John N. Crossley:
Disjunctive Constraint Lambda Calculi. 64-78 - Yao Wu, Enrico Pontelli, Desh Ranjan:
Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees. 79-94 - Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub
The nomore++ Approach to Answer Set Solving. 95-109 - Gopalan Nadathur, Xiaochu Qi:
Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages. 110-124 - Nachum Dershowitz:
The Four Sons of Penrose. 125-138 - Angelo Montanari, Alberto Policriti
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. 139-153 - Bernhard Beckert, Kerry Trentelman:
Second-Order Principles in Specification Languages for Object-Oriented Programs. 154-168 - Daniel J. Dougherty, Silvia Ghilezan
Strong Normalization of the Dual Classical Sequent Calculus. 169-183 - Salvador Lucas
Termination of Fair Computations in Term Rewriting. 184-198 - Jeroen Ketema, Jakob Grue Simonsen:
On Confluence of Infinitary Combinatory Reduction Systems. 199-214 - Temur Kutsia
Matching with Regular Constraints. 215-229 - Mirtha-Lina Fernández, Guillem Godoy, Albert Rubio:
Recursive Path Orderings Can Also Be Incremental. 230-245 - Marc Bezem, Thierry Coquand:
Automating Coherent Logic. 246-260 - Florina Piroi
The Theorema Environment for Interactive Proof Development. 261-275 - Magnus Björk:
A First Order Extension of Stålmarck's Method. 276-291 - Vladimir Aleksic, Anatoli Degtyarev:
Regular Derivations in Basic Superposition-Based Calculi. 292-306 - Wieslaw Szwast, Lidia Tendera
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. 307-321 - Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti Gupta:
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination. 322-336 - Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison
Monotone AC-Tree Automata. 337-351 - Elaine Pimentel
On the Specification of Sequent Systems. 352-366 - Amine Chaieb, Tobias Nipkow
Verifying and Reflecting Quantifier Elimination for Presburger Arithmetic. 367-380 - Matthias Daum, Stefan Maus, Norbert Schirmer, Mohamed Nassim Seghir:
Integration of a Software Model Checker into Isabelle. 381-395 - Deian Tabakov, Moshe Y. Vardi:
Experimental Evaluation of Classical Automata Constructions. 396-411 - Wolfgang Ahrendt
Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics. 412-426 - Christoph Walther, Stephan Schweitzer:
Reasoning About Incompletely Defined Programs. 427-442 - Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. 443-458 - Didier Galmiche, Daniel Méry:
Characterizing Provability in . 459-473 - Harvey Tuch, Gerwin Klein
A Unified Memory Model for Pointers. 474-488 - Andrea Ferrara, Guoqiang Pan, Moshe Y. Vardi:
Treewidth in Verification: Local vs. Global. 489-503 - Laura Bozzelli, Aniello Murano
Pushdown Module Checking. 504-518 - Jianjun Duan, Joe Hurd, Guodong Li, Scott Owens
Functional Correctness Proofs of Encryption Algorithms. 519-533 - Annabelle McIver
Towards Automated Proof Support for Probabilistic Distributed Systems. 534-548 - David A. Basin, Sebastian Mödersheim
Algebraic Intruder Deductions. 549-564 - Maarten Mariën, Rudradeb Mitra, Marc Denecker
Satisfiability Checking for PC(ID). 565-579 - Allen Van Gelder:
Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning. 580-594 - Haiou Shen, Hantao Zhang:
Another Complete Local Search Method for SAT. 595-605 - Sylvie Coste-Marquis
Inference from Controversial Arguments. 606-620 - Mehdi Dastani, Guido Governatori
Programming Cognitive Agents in Defeasible Logic. 621-636 - Jürgen Dix, Wolfgang Faber
The Relationship Between Reasoning About Privacy and Default Logics. 637-650 - Mikhail Sheremet
Comparative Similarity, Tree Automata, and Diophantine Equations. 651-665 - Laura Giordano
Analytic Tableaux for KLM Preferential and Cumulative Logics. 666-681 - Dominique Larchey-Wendling:
Bounding Resource Consumption with Gödel-Dummett Logics. 682-696 - Matthias Baaz
On Interpolation in Existence Logics. 697-711 - Henning Christiansen
Incremental Integrity Checking: Limitations and Possibilities. 712-727 - Carsten Fritz:
Concepts of Automata Construction from LTL. 728-742
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-18 18:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: