Hochschulschrift
Techniques for avoiding redundancy in theorem proving based on the connection method
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
21 cm
- Umfang
-
202 S.
- Sprache
-
Deutsch
- Anmerkungen
-
graph. Darst.
Darmstadt, Techn. Hochsch., Diss., 1994 (Nicht für den Austausch)
- Schlagwort
-
Automatisches Beweisverfahren
Redundanzminderung
Konnektionsmethode
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.03.2025, 12:00 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
Ähnliche Objekte (12)
Advances in equational theorem proving : architecture, algorithms, and redundancy avoidance
Automated theorem proving
Automated theorem proving
Distributing equational theorem proving
Connection calculi for automated theorem proving in classical and non-classical logics
An Extensible Theorem Proving Frontend
Theorem proving in large theories
Requirement-based cooperative theorem proving
First order theorem proving modulo equations
Interactive theorem proving with indexed formulas
Theorem proving with the real numbers
Automated theorem proving in software engineering
Advances in equational theorem proving : architecture, algorithms, and redundancy avoidance
Automated theorem proving
Automated theorem proving
Distributing equational theorem proving
Connection calculi for automated theorem proving in classical and non-classical logics
An Extensible Theorem Proving Frontend
Theorem proving in large theories
Requirement-based cooperative theorem proving
First order theorem proving modulo equations
Interactive theorem proving with indexed formulas
Theorem proving with the real numbers
Automated theorem proving in software engineering
Advances in equational theorem proving : architecture, algorithms, and redundancy avoidance
Automated theorem proving
Automated theorem proving
Distributing equational theorem proving
Connection calculi for automated theorem proving in classical and non-classical logics
An Extensible Theorem Proving Frontend
Theorem proving in large theories
Requirement-based cooperative theorem proving
First order theorem proving modulo equations
Interactive theorem proving with indexed formulas
Theorem proving with the real numbers