000 | 03990nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-39813-4 | ||
003 | DE-He213 | ||
005 | 20240423132447.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540398134 _9978-3-540-39813-4 |
||
024 | 7 |
_a10.1007/b13986 _2doi |
|
050 | 4 | _aQA76.758 | |
072 | 7 |
_aUMZ _2bicssc |
|
072 | 7 |
_aCOM051230 _2bisacsh |
|
072 | 7 |
_aUMZ _2thema |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aLogic for Programming, Artificial Intelligence, and Reasoning _h[electronic resource] : _b10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings / _cedited by Moshe Vardi, Andrei Voronkov. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXI, 436 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2850 |
|
505 | 0 | _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. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aVardi, Moshe. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aVoronkov, Andrei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540201014 |
776 | 0 | 8 |
_iPrinted edition: _z9783662197622 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2850 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b13986 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187998 _d187998 |