10. LPAR 2003:
Almaty, Kazakhstan
Moshe Y. Vardi, Andrei Voronkov (Eds.):
Logic for Programming, Artificial Intelligence, and Reasoning, 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings.
Lecture Notes in Computer Science 2850 Springer 2003, ISBN 3-540-20101-7
- Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter:
From Tableaux to Automata for Description Logics.
1-32

- Serge Autexier, Carsten Schürmann:
Disproving False Conjectures.
33-48

- 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.
49-58

- Alberto Ciaffaglione, Luigi Liquori, Marino Miculan:
Imperative Object-Based Calculi in Co-inductive Type Theories.
59-77

- Robert Nieuwenhuis, Albert Oliveras:
Congruence Closure with Integer Offsets.
78-90

- Christoph Walther, Stephan Schweitzer:
A Machine-Verified Code Generator.
91-106

- Matthias Baaz, Christian G. Fermüller:
A Translation Characterizing the Constructive Content of Classical Theories.
107-121

- Sebastian Brandt, Anni-Yasmin Turhan, Ralf Küsters:
Extensions of Non-standard Inferences to Descriptions Logics with Transitive Roles.
122-136

- Bernhard Heinemann:
Extended Canonicity of Certain Topological Properties of Set Spaces.
137-151

- Silvio Ghilardi, Luigi Santocanale:
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics.
152-166

- Jürgen Giesl, René Thiemann, Peter Schneider-Kamp, Stephan Falke:
Improving Dependency Pairs.
167-182

- Kumar Neeraj Verma:
On Closure under Complementation of Equational Tree Automata for Theories Extending AC.
183-197

- Barbara Morawska:
Completeness of E-Unification with Eager Variable Elimination.
198-212

- Serikzhan Badaev:
Computable Numberings.
213

- Boris Konev, Anatoli Degtyarev, Michael Fisher:
Handling Equality in Monodic Temporal Resolution.
214-228

- Dietmar Berwanger, Erich Grädel, Stephan Kreutzer:
Once upon a Time in a West - Determinacy, Definability, and Complexity of Path Games.
229-243

- Davy Van Nieuwenborgh, Dirk Vermeir:
Ordered Diagnosis.
244-258

- Toshiko Wakaki, Katsumi Inoue, Chiaki Sakama, Katsumi Nitta:
Computing Preferred Answer Sets in Answer Set Programming.
259-273

- Quoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo:
A Syntax-Based Approach to Reasoning about Actions and Events.
274-288

- Thomas Wilke:
Minimizing Automata on Infinite Words.
289

- Margarita V. Korovina:
Gandy's Theorem for Abstract Structures without the Equality Test.
290-301

- Martin Fränzle, Christian Herde:
Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.
302-316

- Thierry Boy de la Tour, Mnacho Echenim:
NP-Completeness Results for Deductive Problems on Stratified Terms.
317-331

- Dietrich Kuske:
Is Cantor's Theorem Automatic?
332-345

- Markus Lohrey:
Automatic Structures of Bounded Degree.
346-360

- Jean-Michel Couvreur, Nasser Saheb, Grégoire Sutre:
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.
361-375

- Christoph Beierle, Gabriele Kern-Isberner:
A Logical Study on Qualitative Default Reasoning with Probabilities.
376-388

- Paola Bruscoli, Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic.
389-406

- Furio Honsell, Marina Lenisa, Rekha Redamalla:
Strict Geometry of Interaction Graph Models.
407-421

- Didier Galmiche, J.-M. Notin:
Connection-Based Proof Construction in Non-commutative Logic.
422-436

Last update Thu May 23 02:40:45 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page