000 | 05072nam a22006135i 4500 | ||
---|---|---|---|
001 | 978-3-540-24599-5 | ||
003 | DE-He213 | ||
005 | 20240423132441.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2003 gw | s |||| 0|eng d | ||
020 |
_a9783540245995 _9978-3-540-24599-5 |
||
024 | 7 |
_a10.1007/b94619 _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] : _b19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, Proceedings / _cedited by Catuscia Palamidessi. |
250 | _a1st ed. 2003. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2003. |
|
300 |
_aXII, 524 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 ; _v2916 |
|
505 | 0 | _aInvited Talks -- Achieving Type Safety for Low-Level Code -- Logic Information Systems for Logic Programmers -- A Logic Programming View of Authorization in Distributed Systems -- Compositional Verification of Infinite State Systems -- A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods -- Invited Tutorials -- Concurrency, Time, and Constraints -- Symbolic Model-Checking for Biochemical Systems -- Component-Based Software Development and Logic Programming -- A Tutorial on Proof Theoretic Foundations of Logic Programming -- Regular Papers -- Objective: In Minimum Context -- Handling Existential Derived Predicates in View Updating -- Efficient Evaluation of Logic Programs for Querying Data Integration Systems -- Argumentation Databases -- Order and Negation as Failure -- Computing Minimal Models, Stable Models, and Answer Sets -- Uniform Equivalence of Logic Programs under the Stable Model Semantics -- Answer Set Programming Phase Transition: A Study on Randomly Generated Programs -- Termination Analysis with Types Is More Accurate -- A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation -- Intensional Sets in CLP -- Implementing Constraint Propagation by Composition of Reductions -- Forward versus Backward Verification of Logic Programs -- Native Preemptive Threads in SWI-Prolog -- Flow Java: Declarative Concurrency for Java -- On the Complexity of Dependent And-Parallelism in Logic Programming -- Higher-Order Substitution Tree Indexing -- Incremental Evaluation of Tabled Logic Programs -- On Deterministic Computations in the Extended Andorra Model -- Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL -- Is There an Optimal Generic Semantics for First-Order Equations? -- Loop Formulas for Disjunctive Logic Programs -- Default Knowledge in Logic Programs with Uncertainty -- Posters -- A Generic Persistence Model for (C)LP Systems -- Definitions in Answer Set Programming -- A New Mode Declaration for Tabled Predicates -- Adding the Temporal Relations in Semantic Web Ontologies -- Polynomial-Time Learnability from Entailment -- Integration of Semantic Networks for Corpus-Based Word Sense Disambiguation -- Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents -- A Real Implementation for Constructive Negation -- Simulating Security Systems Based on Logigrams -- Online Justification for Tabled Logic Programs -- Inducing Musical Rules with ILP -- A Distinct-Head Folding Rule -- Termination Analysis of Logic Programs -- Refactoring Logic Programs -- Termination of Logic Programs for Various Dynamic Selection Rules -- Adding Preferences to Answer Set Planning -- Controlling Semi-automatic Systems with FLUX -- The Language Model LMNtal. | |
650 | 0 | _aSoftware engineering. | |
650 | 0 | _aComputer programming. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aComputer science. | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aSoftware Engineering. |
650 | 2 | 4 | _aProgramming Techniques. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aArtificial Intelligence. |
700 | 1 |
_aPalamidessi, Catuscia. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540206422 |
776 | 0 | 8 |
_iPrinted edition: _z9783662171011 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2916 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/b94619 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187880 _d187880 |