Logic Programming 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Palamidessi, Catuscia (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2003.
• Σειρά: Lecture Notes in Computer Science, 2916
• Θέματα: Computer science.; Software engineering.; Computer programming.; Programming languages (Electronic computers).; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Software Engineering/Programming and Operating Systems.; Programming Techniques.; Programming Languages, Compilers, Interpreters.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Artificial Intelligence (incl. Robotics).

Πίνακας περιεχομένων:

• 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.