000 | 05131nam a22006255i 4500 | ||
---|---|---|---|
001 | 978-3-540-27775-0 | ||
003 | DE-He213 | ||
005 | 20240423125651.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2004 gw | s |||| 0|eng d | ||
020 |
_a9783540277750 _9978-3-540-27775-0 |
||
024 | 7 |
_a10.1007/b99475 _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 Programming _h[electronic resource] : _b20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings / _cedited by Bart Demoen, Vladimir Lifschitz. |
250 | _a1st ed. 2004. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2004. |
|
300 |
_aXII, 484 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, _x1611-3349 ; _v3132 |
|
505 | 0 | _aInvited Talks -- Termination by Abstraction -- Answer Set Programming and the Design of Deliberative Agents -- Regular Talks -- Abstract Domains Based on Regular Types -- Termination of Logic Programs Using Various Dynamic Selection Rules -- Improving Prolog Programs: Refactoring for Prolog -- Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP -- The Refined Operational Semantics of Constraint Handling Rules -- Compiling Ask Constraints -- Constraint Handling Rules and Tabled Execution -- Possible Worlds Semantics for Probabilistic Logic Programs -- Limiting Resolution: From Foundations to Implementation -- Generalised Kernel Sets for Inverse Entailment -- On Programs with Linearly Ordered Multiple Preferences -- Splitting an Operator -- Simplifying Logic Programs Under Answer Set Semantics -- On Acyclic and Head-Cycle Free Nested Logic Programs -- Fast Query Evaluation with (Lazy) Control Flow Compilation -- Speculative Computations in Or-Parallel Tabled Logic Programs -- ?Prolog: A Logic Programming Language with Names, Binding and ?-Equivalence -- Implementation Results in Classical Constructive Negation -- On Hybridization of Local Search and Constraint Propagation -- Arc-Consistency + Unit Propagation = Lookahead -- The period Constraint -- Non-viability Deductions in Arc-Consistency Computation -- Compiling Prioritized Circumscription into Answer Set Programming -- Enhancing the Magic-Set Method for Disjunctive Datalog Programs -- Rectilinear Steiner Tree Construction Using Answer Set Programming -- Adding Domain Dependent Knowledge into Answer Set Programs for Planning -- Multi-agent Coordination as Distributed Logic Programming -- Logic Programs with Annotated Disjunctions -- Poster Presentations -- Abstract Interpretation-Based Mobile CodeCertification -- Labeled Logic Programs -- Xcerpt and XChange – Logic Programming Languages for Querying and Evolution on the Web -- Protein Folding Simulation in CCP -- Applying CLP to Predict Extra-Functional Properties of Component-Based Models -- Main Results of the OADymPPaC Project -- FDBG, the CLP Debugger Library of SICStus Prolog -- Development of Semantic Debuggers Based on Refinement Calculus -- A Tracer Driver to Enable Debugging, Monitoring and Visualization of CLP Executions from a Single Tracer -- Grid Service Selection with PPDL -- Concurrent Constraint Programming and Tree–Based Acoustic Modelling -- MProlog: An Extension of Prolog for Modal Logic Programming -- Probabilistic Choice Operators as Global Constraints: Application to Statistical Software Testing -- Constraint-Based Synchronization and Verification of Distributed Java Programs -- JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR -- Agent Oriented Logic Programming Constructs in Jinni 2004. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aArtificial Intelligence. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
700 | 1 |
_aDemoen, Bart. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aLifschitz, Vladimir. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540226710 |
776 | 0 | 8 |
_iPrinted edition: _z9783662173978 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v3132 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b99475 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c180447 _d180447 |