000 | 04045nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-24609-1 | ||
003 | DE-He213 | ||
005 | 20160624101903.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540246091 _9978-3-540-24609-1 |
||
024 | 7 |
_a10.1007/b94792 _2doi |
|
050 | 4 | _aQ334-342 | |
050 | 4 | _aTJ210.2-211.495 | |
072 | 7 |
_aUYQ _2bicssc |
|
072 | 7 |
_aTJFM1 _2bicssc |
|
072 | 7 |
_aCOM004000 _2bisacsh |
|
082 | 0 | 4 |
_a006.3 _223 |
245 | 1 | 0 |
_aLogic Programming and Nonmonotonic Reasoning _h[electronic resource] : _b7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings / _cedited by Vladimir Lifschitz, Ilkka Niemelä. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2004. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2004. |
|
300 |
_aX, 370 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 Computer Science, _x0302-9743 ; _v2923 |
|
505 | 0 | _aInvited Papers -- Constraints and Probabilistic Networks: A Look At The Interface -- Toward A Universal Inference Engine -- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative -- Regular Papers -- Semantics for Dynamic Logic Programming: A Principle-Based Approach -- Probabilistic Reasoning With Answer Sets -- Answer Sets: From Constraint Programming Towards Qualitative Optimization -- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties -- Reasoning About Actions and Change in Answer Set Programming -- Almost Definite Causal Theories -- Simplifying Logic Programs Under Uniform and Strong Equivalence -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Graphs and Colorings for Answer Set Programming: Abridged Report -- Nondefinite vs. Definite Causal Theories -- Logic Programs With Monotone Cardinality Atoms -- Set Constraints in Logic Programming -- Verifying the Equivalence of Logic Programs in the Disjunctive Case -- Uniform Equivalence for Equilibrium Logic and Logic Programs -- Partial Stable Models for Logic Programs with Aggregates -- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs -- Using Criticalities as a Heuristic for Answer Set Programming -- Planning with Preferences Using Logic Programming -- Planning with Sensing Actions and Incomplete Information Using Logic Programming -- Deduction in Ontologies via ASP -- Strong Equivalence for Causal Theories -- Answer Set Programming with Clause Learning -- Properties of Iterated Multiple Belief Revision -- System Descriptions -- System Description: DLV with Aggregates -- GNT — A Solver for Disjunctive Logic Programs -- LPEQ and DLPEQ — Translators for Automated Equivalence Testing of Logic Programs -- DLV DB : Bridging the Gap between ASP Systems and DBMSs -- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs -- WSAT(CC) — A Fast Local-Search ASP Solver -- Smodels with CLP—A Treatment of Aggregates in ASP -- nlp: A Compiler for Nested Logic Programming. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aLifschitz, Vladimir. _eeditor. |
|
700 | 1 |
_aNiemelä, Ilkka. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540207214 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2923 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b94792 |
942 |
_2EBK3066 _cEBK |
||
999 |
_c32360 _d32360 |