- Douglas B. Lenat:
Scaling Up: Computers vs. Common Sense. LPAR 2005: 47-47 - Salvador Lucas
, José Meseguer:
Termination of Fair Computations in Term Rewriting. LPAR 2005: 184-198 - Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe:
Satisfiability Checking for PC(ID). LPAR 2005: 565-579 - Annabelle McIver, Tjark Weber:
Towards Automated Proof Support for Probabilistic Distributed Systems. LPAR 2005: 534-548 - Angelo Montanari, Alberto Policriti, Nicola Vitacolonna:
An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures. LPAR 2005: 139-153 - Gopalan Nadathur, Xiaochu Qi:
Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages. LPAR 2005: 110-124 - Robert Nieuwenhuis, Albert Oliveras:
Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools. LPAR 2005: 23-46 - Hitoshi Ohsaki, Jean-Marc Talbot, Sophie Tison, Yves Roos:
Monotone AC-Tree Automata. LPAR 2005: 337-351 - Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli:
A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem. LPAR 2005: 48-63 - Elaine Pimentel, Dale Miller:
On the Specification of Sequent Systems. LPAR 2005: 352-366 - Florina Piroi, Temur Kutsia:
The Theorema Environment for Interactive Proof Development. LPAR 2005: 261-275 - Haiou Shen, Hantao Zhang:
Another Complete Local Search Method for SAT. LPAR 2005: 595-605 - Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter, Michael Zakharyaschev:
Comparative Similarity, Tree Automata, and Diophantine Equations. LPAR 2005: 651-665 - Wieslaw Szwast, Lidia Tendera:
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity. LPAR 2005: 307-321 - Deian Tabakov, Moshe Y. Vardi:
Experimental Evaluation of Classical Automata Constructions. LPAR 2005: 396-411 - Calvin Kai Fan Tang, Eugenia Ternovska:
Model Checking Abstract State Machines with Answer Set Programming. LPAR 2005: 443-458 - Harvey Tuch, Gerwin Klein:
A Unified Memory Model for Pointers. LPAR 2005: 474-488 - Christoph Walther, Stephan Schweitzer:
Reasoning About Incompletely Defined Programs. LPAR 2005: 427-442 - Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti Gupta:
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination. LPAR 2005: 322-336 - Yao Wu, Enrico Pontelli, Desh Ranjan:
Computational Issues in Exploiting Dependent And-Parallelism in Logic Programming: Leftness Detection in Dynamic Search Trees. LPAR 2005: 79-94 - 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 [contents]
