First order theorem proving modulo equations

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Dimensions: 30 cm

Extent: 124 S.

Language: Deutsch

Notes: Literaturverz. S. 117 - 124

Event: Veröffentlichung

(where): Saarbrücken

(who): MPI Informatik

(when): 1992

Creator: Wertz, Ulrich

Table of contents: https://d-nb.info/931195381/04

Rights: Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.

Last update: 11.03.2025, 11:53 AM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

Wertz, Ulrich
MPI Informatik

Time of origin

1992

Other Objects (12)

Hochschulschrift

First-order theorem proving modulo equations

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Hochschulschrift

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Hochschulschrift

Proving Theorems of Higher-Order Logic with SMT Solvers

Hochschulschrift | Online-Publikation

Equality and extensionality in automated higher-order theorem proving

Hochschulschrift

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

Hochschulschrift

First-order theorem proving modulo equations

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Hochschulschrift

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Hochschulschrift

Proving Theorems of Higher-Order Logic with SMT Solvers

Hochschulschrift | Online-Publikation

Equality and extensionality in automated higher-order theorem proving

Hochschulschrift

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

Hochschulschrift

First-order theorem proving modulo equations

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Hochschulschrift

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Hochschulschrift

Proving Theorems of Higher-Order Logic with SMT Solvers

Hochschulschrift | Online-Publikation

Equality and extensionality in automated higher-order theorem proving

Hochschulschrift

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

First order theorem proving modulo equations

Object Details

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

First-order theorem proving modulo equations

First order logic and automated theorem proving

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Automated theorem proving

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Proving Theorems of Higher-Order Logic with SMT Solvers

Equality and extensionality in automated higher-order theorem proving

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

First-order theorem proving modulo equations

First order logic and automated theorem proving

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Automated theorem proving

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Proving Theorems of Higher-Order Logic with SMT Solvers

Equality and extensionality in automated higher-order theorem proving

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

First-order theorem proving modulo equations

First order logic and automated theorem proving

First order logic and automated theorem proving

Theorem Proving in Higher Order Logics - Emerging Trends

Automated theorem proving

Automated theorem proving

Proving theorems of higher-order logic with SMT solvers

Higher-Order Automated Theorem Proving for Natural Language Semantics

Proving Theorems of Higher-Order Logic with SMT Solvers

Equality and extensionality in automated higher-order theorem proving

Equality and extensionality in automated higher-order theorem proving

Proving non-reachability by modulo-place invariants

Related objects

Reset password