|
|
|
|
| LEADER |
03521nmm a2200397 u 4500 |
| 001 |
EB000655709 |
| 003 |
EBX01000000000000000508791 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540444046
|
| 100 |
1 |
|
|a Parigot, Michel
|e [editor]
|
| 245 |
0 |
0 |
|a Logic for Programming and Automated Reasoning
|h Elektronische Ressource
|b 7th International Conference, LPAR 2000 Reunion Island, France, November 6-10, 2000 Proceedings
|c edited by Michel Parigot, Andrei Voronkov
|
| 250 |
|
|
|a 1st ed. 2000
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2000, 2000
|
| 300 |
|
|
|a XIV, 490 p
|b online resource
|
| 505 |
0 |
|
|a The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus -- Solving Planning Problems by Partial Deduction -- A Kripkean Semantics for Dynamic Logic Programming
|
| 505 |
0 |
|
|a 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 --
|
| 505 |
0 |
|
|a 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 --
|
| 653 |
|
|
|a Compilers (Computer programs)
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Compilers and Interpreters
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Mathematical logic
|
| 653 |
|
|
|a Artificial Intelligence
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Artificial intelligence
|
| 653 |
|
|
|a Mathematical Logic and Foundations
|
| 700 |
1 |
|
|a Voronkov, Andrei
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Artificial Intelligence
|
| 028 |
5 |
0 |
|a 10.1007/3-540-44404-1
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44404-1?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511.3
|