000 | 05126nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-48242-0 | ||
003 | DE-He213 | ||
005 | 20240423132530.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540482420 _9978-3-540-48242-0 |
||
024 | 7 |
_a10.1007/3-540-48242-3 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTA347.A78 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
072 | 7 |
_aUYQ _2thema |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aLogic Programming and Automated Reasoning _h[electronic resource] : _b6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings / _cedited by Harald Ganzinger, David McAllester, Andrei Voronkov. |
250 | _a1st ed. 1999. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c1999. |
|
300 |
_aXII, 404 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 ; _v1705 |
|
505 | 0 | _aSession 1 -- Proofs About Lists Using Ellipsis -- Session 2 -- On the Complexity of Counting the Hilbert Basis of a Linear Diophantine System -- Solving Combinatorial Problems with Regular Local Search Algorithms -- Evidence Algorithm and Sequent Logical Inference Search -- Session 3 -- First Order Linear Temporal Logic over Finite Time Structures -- Model Checking Games for the Alternation-Free ?-Calculus and Alternating Automata -- Animating TLA Specifications -- Session 4 -- Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems -- Cancellative Superposition Decides the Theory of Divisible Torsion-Free Abelian Groups -- Regular Sets of Descendants for Constructor-Based Rewrite Systems -- Session 5 -- Practical Reasoning for Expressive Description Logics -- Complexity of Terminological Reasoning Revisited -- Session 6 -- On the Complexity of Single-Rule Datalog Queries -- Session 7 -- Abstracting Properties in Concurrent Constraint Programming -- A Fixpoint Semantics for Reasoning about Finite Failure -- Extensions to the Estimation Calculus -- Session 8 -- Beth Definability for the Guarded Fragment -- Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas -- Session 9 -- Resource Management in Linear Logic Proof Search Revisited -- Focusing and Proof-Nets in Linear and Non-commutative Logic -- Session 10 -- CHAT Is ? (SLG-WAM) -- Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog -- A Partial Evaluation Framework for Curry Programs. | |
520 | _aThis volume contains the papers presented at the Sixth International Conference on Logic for Programming and Automated Reasoning (LPAR'99), held in Tbilisi, Georgia, September 6-10, 1999, and hosted by the University of Tbilisi. Forty-four papers were submitted to LPAR'99. Each of the submissions was reviewed by three program committee members and an electronic program comĀ mittee meeting was held via the Internet. Twenty-three papers were accepted. We would like to thank the many people who have made LPAR'99 possible. We are grateful to the following groups and individuals: to the program committee and the additional referees for reviewing the papers in a very short time, to the organizing committee, and to the local organizers of the INTAS workshop in Tbilisi in April 1994 (Khimuri Rukhaia, Konstantin Pkhakadze, and Gela Chankvetadze). And last but not least, we would like to thank Konstantin - rovin, who maintained the program committee Web page; Uwe Waldmann, who supplied macros for these proceedings and helped us to install some programs for the electronic management of the program committee work; and Bill McCune, who implemented these programs. | ||
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aComputer systems. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aComputer System Implementation. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aGanzinger, Harald. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aMcAllester, David. _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: _z9783540664925 |
776 | 0 | 8 |
_iPrinted edition: _z9783662184653 |
830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v1705 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-48242-3 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188797 _d188797 |