LEADER 06293nam 22008055 450 001 9910144033403321 005 20250624205534.0 010 $a3-540-39813-9 024 7 $a10.1007/b13986 035 $a(CKB)1000000000212214 035 $a(SSID)ssj0000324500 035 $a(PQKBManifestationID)11282663 035 $a(PQKBTitleCode)TC0000324500 035 $a(PQKBWorkID)10314345 035 $a(PQKB)11668307 035 $a(DE-He213)978-3-540-39813-4 035 $a(MiAaPQ)EBC3088450 035 $a(PPN)155183842 035 $a(BIP)9008330 035 $a(EXLCZ)991000000000212214 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic for Programming, Artificial Intelligence, and Reasoning $e10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings /$fedited by Moshe Vardi, Andrei Voronkov 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XI, 436 p.) 225 1 $aLecture Notes in Artificial Intelligence ;$v2850 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-20101-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aFrom Tableaux to Automata for Description Logics -- Disproving False Conjectures -- A Formal Proof of Dickson?s Lemma in ACL2 -- Imperative Object-Based Calculi in Co-inductive Type Theories -- Congruence Closure with Integer Offsets -- A Machine-Verified Code Generator -- A Translation Characterizing the Constructive Content of Classical Theories -- Extensions of Non-standard Inferences to Description Logics with Transitive Roles -- Extended Canonicity of Certain Topological Properties of Set Spaces -- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics -- Improving Dependency Pairs -- On Closure under Complementation of Equational Tree Automata for Theories Extending AC -- Completeness of E-Unification with Eager Variable Elimination -- Computable Numberings -- Handling Equality in Monodic Temporal Resolution -- Once upon a Time in the West -- Ordered Diagnosis -- Computing Preferred Answer Sets in Answer Set Programming -- A Syntax-Based Approach to Reasoning about Actions and Events -- Minimizing Automata on Infinite Words -- Gandy?s Theorem for Abstract Structures without the Equality Test -- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems -- NP-Completeness Results for Deductive Problems on Stratified Terms -- Is Cantor?s Theorem Automatic? -- Automatic Structures of Bounded Degree -- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems -- A Logical Study on Qualitative Default Reasoning with Probabilities -- On Structuring Proof Search for First Order Linear Logic -- Strict Geometry of Interaction Graph Models -- Connection-Based Proof Construction in Non-commutative Logic. 330 $aThisvolumecontainsthepaperspresentedattheTenthInternationalConference on Logic for Programming, Arti'cial Intelligence, and Reasoning (LPAR 2003), heldonSeptember22-26,2003,inAlmaty,Kazakhstan,togetherwiththeFourth International Workshop on Implementation of Logics. There were 65 submissions, of which 8 belonged to the special submission category of experimental papers, intended to describe implementations or c- parisons of systems, or experiments with systems. Each submission was reviewed by at least three program committee members and an electronic program c- mitteemeetingwasheldviatheInternet.Weareverygratefultothe32program committee members for their e'orts and for the quality of their reviews and d- cussions. Finally, the committee decided to accept 27 papers. The program also included ?ve invited talks, by Franz Baader, Serikzhan Badaev, Dexter Kozen, Sergei Goncharov, and Thomas Wilke. Apart from the program committee, we would also like to thank the other people who have made LPAR 2003 possible: the external reviewers and the local organizers Serikzhan Badaev and Anna Romina. The Internet-based submission software and the program-committee disc- sion software were provided by the second co-chair. 410 0$aLecture Notes in Artificial Intelligence ;$v2850 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aComputer programming 606 $aComputer logic 606 $aLogic, Symbolic and mathematical 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aSoftware Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/I14029 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 0$aComputer programming. 615 0$aComputer logic. 615 0$aLogic, Symbolic and mathematical. 615 14$aSoftware Engineering/Programming and Operating Systems. 615 24$aArtificial Intelligence. 615 24$aProgramming Techniques. 615 24$aSoftware Engineering. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a006.3 702 $aVardi$b Moshe Y$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVoronkov$b Andrei$f1959-$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLPAR (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144033403321 996 $aLogic for Programming, Artificial Intelligence, and Reasoning$9772423 997 $aUNINA