- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540528371
3540528377
9780387528373
0387528377
- Dimensions
-
25 cm
- Extent
-
142 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Literaturverz. S. 132 - 139
- Bibliographic citation
-
Lecture notes in computer science ; 446 : Lecture notes in artificial intelligence
- Keyword
-
Logische Programmierung
Terminierung
Automatisches Beweisverfahren
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, London, Paris, Tokyo, Hong Kong, Barcelona
- (who)
-
Springer
- (when)
-
1990
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:28 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Plümer, Lutz
- Springer
Time of origin
- 1990
Other Objects (12)
Termination proofs for logic programs
Automated termination proofs
Continuous semantics for termination proofs
Automating recursive definitions and termination proofs in higher-order logic
Reconstructing a logic for inductive proofs of properties of functional programs
Reconstructing a logic for inductive proofs of properties of functional programs
Termination Proofs of Rewriting Systems
Proofs, programs and executable specifications in higher order logic
Proofs, programs and executable specifications in higher order logic
Reconstruction of a logic for inductive proofs of properties of functional programs
Reconstruction of a logic for inductive proofs of properties of functional programs
Programs, proofs, processes : proceedings
Termination proofs for logic programs
Automated termination proofs
Continuous semantics for termination proofs
Automating recursive definitions and termination proofs in higher-order logic
Reconstructing a logic for inductive proofs of properties of functional programs
Reconstructing a logic for inductive proofs of properties of functional programs
Termination Proofs of Rewriting Systems
Proofs, programs and executable specifications in higher order logic
Proofs, programs and executable specifications in higher order logic
Reconstruction of a logic for inductive proofs of properties of functional programs
Reconstruction of a logic for inductive proofs of properties of functional programs
Programs, proofs, processes : proceedings
Termination proofs for logic programs
Automated termination proofs
Continuous semantics for termination proofs
Automating recursive definitions and termination proofs in higher-order logic
Reconstructing a logic for inductive proofs of properties of functional programs
Reconstructing a logic for inductive proofs of properties of functional programs
Termination Proofs of Rewriting Systems
Proofs, programs and executable specifications in higher order logic
Proofs, programs and executable specifications in higher order logic
Reconstruction of a logic for inductive proofs of properties of functional programs
Reconstruction of a logic for inductive proofs of properties of functional programs