Logic for programming and automated reasoning : 7th international conference, LPAR 2000, Reunion Island, France, November 6-10, 2000 : proceedings
Gardado en:
| Autor Principal: | |
|---|---|
| Autor Corporativo: | |
| Outros autores: | |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science. Lecture notes in artificial intelligence
1955 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic for programming and automated reasoning, 7th international conference, LPAR 2000, Michel Parigot, Andrei Voronkov (Eds.), 2000, New York, Springer, 1 vol. (XIII-486 p.), Lecture notes in computer science, 3-540-41285-9 • Logic for Programming and Automated Reasoning, Texte imprimé, 9783662162378 |
Table des matières:
- Nonmononic reasoning
- On the Complexity of Theory Curbing
- Descriptive complexity
- Graph Operations and Monadic Second-Order Logic: A Survey
- Efficient First Order Functional Program Interpreter with Time Bound Certifications
- Specification and automatic proof-assistants
- Encoding Temporal Logics in Executable Z: A Case Study for the ZETA System
- Behavioural Constructor Implementation for Regular Algebras
- An Extensible Proof Text Editor
- A Tactic Language for the System Coq
- Theorem proving
- Proof Simplification for Model Generation and Its Applications
- Have SPASS with OCC1N = g
- Verification
- Compiling and Verifying Security Protocols
- Equational Binary Decision Diagrams
- A PVS Proof Obligation Generator for Lustre Programs
- Logic programming and CLP
- Efficient Structural Information Analysis for Real CLP Languages
- Playing Logic Programs with the Alpha-Beta Algorithm
- Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
- Nonclassical logics and lambda calculus
- Quantified Propositional Gödel Logics
- Proof-Search in Implicative Linear Logic as a Matching Problem
- A New Model Construction for the Polymorphic Lambda Calculus
- Church s Lambda Delta Calculus
- Logic and databases
- Querying Inconsistent Databases
- How to Decide Query Containment under Constraints Using a Description Logic
- Program analysis
- Static Reduction Analysis for Imperative Object Oriented Languages
- An Abstract Interpretation Approach to Termination of Logic Programs
- Using an Abstract Representation to Specialize Functional Logic Programs
- Binding-Time Analysis by Constraint Solving
- Mu-calculus
- Efficient Evaluation Methods for Guarded Logics and Datalog LITE
- On the Alternation-Free Horn ?-Calculus.-Planning and reasoning about actions
- The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus
- Solving Planning Problems by Partial Deduction
- A Kripkean Semantics for Dynamic Logic Programming.