Logic for Programming and Automated Reasoning 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Parigot, Michel (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Voronkov, Andrei (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2000.
Έκδοση:1st ed. 2000.
Σειρά:Lecture Notes in Artificial Intelligence ; 1955
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
Πίνακας περιεχομένων:
  • 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.