Logic for programming, artificial intelligence, and reasoning. 10th international conference, LPAR 2003, Almaty, Kazakhstan, September 22--26, 2003. Proceedings (Q1416839)

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1007.00026). Indexed articles: \textit{Baader, Franz; Hladik, Jan; Lutz, Carsten; Wolter, Frank}, From tableaux to automata for description logics, 1-32 [Zbl 1273.03095] \textit{Autexier, Serge; Schürmann, Carsten}, Disproving false conjectures, 33-48 [Zbl 1273.03045] \textit{Martín-Mateos, F. J.; Alonso, J. A.; Hidalgo, M. J.; Ruiz-Reina, J. L.}, A formal proof of Dickson's lemma in ACL2, 49-58 [Zbl 1273.68323] \textit{Ciaffaglione, Alberto; Liquori, Luigi; Miculan, Marino}, Imperative object-based calculi in co-inductive type theories, 59-77 [Zbl 1273.03105] \textit{Nieuwenhuis, Robert; Oliveras, Albert}, Congruence closure with integer offsets, 78-90 [Zbl 1273.68326] \textit{Baaz, Matthias; Fermüller, Christian G.}, A translation characterizing the constructive content of classical theories, 107-121 [Zbl 1273.03160] \textit{Brandt, Sebastian; Turhan, Anni-Yasmin; Küsters, Ralf}, Extensions of non-standard inferences to description logics with transitive roles, 122-136 [Zbl 1273.68371] \textit{Heinemann, Bernhard}, Extended canonicity of certain topological properties of set spaces, 137-151 [Zbl 1273.03070] \textit{Ghilardi, Silvio; Santocanale, Luigi}, Algebraic and model theoretic techniques for fusion decidability in modal logics, 152-166 [Zbl 1273.03068] \textit{Giesl, Jürgen; Thiemann, René; Schneider-Kamp, Peter; Falke, Stephan}, Improving dependency pairs, 167-182 [Zbl 1273.68320] \textit{Verma, Kumar Neeraj}, On closure under complementation of equational tree automata for theories extending AC, 183-197 [Zbl 1273.03138] \textit{Morawska, Barbara}, Completeness of \(E\)-unification with eager variable elimination, 198-212 [Zbl 1273.68325] \textit{Konev, Boris; Degtyarev, Anatoli; Fisher, Michael}, Handling equality in monodic temporal resolution, 214-228 [Zbl 1273.03062] \textit{Berwanger, Dietmar; Grädel, Erich; Kreutzer, Stephan}, Once upon a time in the West. Determinacy, definability, and complexity of path games, 229-243 [Zbl 1273.91081] \textit{Van Nieuwenborgh, Davy; Vermeir, Dirk}, Ordered diagnosis, 244-258 [Zbl 1273.68376] \textit{Wakaki, Toshiko; Inoue, Katsumi; Sakama, Chiaki; Nitta, Katsumi}, Computing preferred answer sets in answer set programming, 259-273 [Zbl 1273.68377] \textit{Bao Vo, Quoc; Nayak, Abhaya; Foo, Norman}, A syntax-based approach to reasoning about actions and events, 274-288 [Zbl 1273.68370] \textit{Korovina, Margarita}, Gandy's theorem for abstract structures without the equality test, 290-301 [Zbl 1273.03123] \textit{Fränzle, Martin; Herde, Christian}, Efficient SAT engines for concise logics: accelerating proof search for zero-one linear constraint systems, 302-316 [Zbl 1273.68319] \textit{Boy de la Tour, Thierry; Echenim, Mnacho}, NP-completeness results for deductive problems on stratified terms, 317-331 [Zbl 1273.68316] \textit{Kuske, Dietrich}, Is Cantor's theorem automatic?, 332-345 [Zbl 1273.03124] \textit{Lohrey, Markus}, Automatic structures of bounded degree, 346-360 [Zbl 1257.03033] \textit{Couvreur, Jean-Michel; Saheb, Nasser; Sutre, Grégoire}, An optimal automata approach to LTL model checking of probabilistic systems, 361-375 [Zbl 1273.68224] \textit{Beierle, Christoph; Kern-Isberner, Gabriele}, A logical study on qualitative default reasoning with probabilities, 376-388 [Zbl 1273.03076] \textit{Bruscoli, Paola; Guglielmi, Alessio}, On structuring proof search for first order linear logic, 389-406 [Zbl 1273.03163] \textit{Honsell, Furio; Lenisa, Marina; Redamalla, Rekha}, Strict geometry of interaction graph models, 407-421 [Zbl 1273.03179] \textit{Galmiche, D.; Notin, J.-M.}, Connection-based proof construction in non-commutative logic, 422-436 [Zbl 1273.03165]