Logic programming : 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2916 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic programming, 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, proceedings, Catuscia Palamidessi (ed.), Berlin, Springer, 2003, 1 vol. (XII-520 p.), Lecture notes in computer science, 3-540-20642-6 • Logic Programming, Texte imprimé, 9783662171011 |
Obsah:
- 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.