Logic programming : ; proceedings 17th international conference, ICLP 2001, Paphos, Cyprus, November 26-December 1, 2001
保存先:
| 団体著者: | |
|---|---|
| その他の著者: | |
| フォーマット: | Livre numérique |
| 言語: | Anglais |
| 出版事項: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| シリーズ: | Lecture notes in computer science
2237 |
| 主題: | |
| オンライン･アクセス: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| 注記: |
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, 17th international conference, ICLP 2001, Paphos, Cyprus, November 26-December 1, 2001, Philippe Codognet (ed.), Berlin, Springer, 2001, 1 vol. (XI-364 p.), Lecture notes in computer science, 3-540-42935-2 • Logic Programming, Texte imprimé, 9783662208083 |
目次:
- Invited Speakers
- Solving the Multiplication Constraint in Several Approximation Spaces
- Is Logic Really Dead or Only Just Sleeping?
- Design of Syntactic Program Transformations by Abstract Interpretation of Semantic Transformations
- X-tegration Some Cross-Enterprise Thoughts
- Tutorials
- Building Real-Life Applications with Prolog
- Natural Language Tabular Parsing
- A Close Look at Constraint-Based Concurrency
- Probabilistic Databases and Logic Programming
- Conference Papers
- Understanding Memory Management in Prolog Systems
- PALS: An Or-Parallel Implementation of Prolog on Beowulf Architectures
- On a Tabling Engine That Can Exploit Or-Parallelism
- Revisiting the Cardinality Operator and Introducing the Cardinality-PathConstraint Family
- Optimizing Compilation of Constraint Handling Rules
- Building Constraint Solvers with HAL
- Practical Aspects for a Working Compile Time Garbage Collection System for Mercury
- Positive Boolean Functions as Multiheaded Clauses
- Higher-Precision Groundness Analysis
- Speculative Beats Conservative Justification
- Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming
- A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives
- Fixed-Parameter Complexity of Semantics for Logic Programs
- Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
- Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
- Fages Theorem for Programs with Nested Expressions
- Semantics of Normal Logic Programs with Embedded Implications
- A Multi-adjoint Logic Approach to Abductive Reasoning
- Proving Correctness and Completeness of Normal Programs A Declarative Approach
- An Order-Sorted Resolution with ImplicitlyNegative Sorts
- Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic
- A Computational Model for Functional Logic Deductive Databases
- A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases.