|
|
|
|
LEADER |
04956nam a22005775i 4500 |
001 |
978-3-540-24599-5 |
003 |
DE-He213 |
005 |
20151204161000.0 |
007 |
cr nn 008mamaa |
008 |
121227s2003 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540245995
|9 978-3-540-24599-5
|
024 |
7 |
|
|a 10.1007/b94619
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.758
|
072 |
|
7 |
|a UMZ
|2 bicssc
|
072 |
|
7 |
|a UL
|2 bicssc
|
072 |
|
7 |
|a COM051230
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
245 |
1 |
0 |
|a Logic Programming
|h [electronic resource] :
|b 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings /
|c edited by Catuscia Palamidessi.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2003.
|
300 |
|
|
|a XII, 524 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2916
|
505 |
0 |
|
|a Invited 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 |
|a Computer science.
|
650 |
|
0 |
|a Software engineering.
|
650 |
|
0 |
|a Computer programming.
|
650 |
|
0 |
|a Programming languages (Electronic computers).
|
650 |
|
0 |
|a Computer logic.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|
650 |
2 |
4 |
|a Programming Techniques.
|
650 |
2 |
4 |
|a Programming Languages, Compilers, Interpreters.
|
650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Artificial Intelligence (incl. Robotics).
|
700 |
1 |
|
|a Palamidessi, Catuscia.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540206422
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2916
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/b94619
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|