<--- Back to Details
First PageDocument Content
Theoretical computer science / Mathematical logic / Mathematics / Logic programming / Logic in computer science / Automated theorem proving / Formal methods / Unification / Lambda calculus / Constraint logic programming / Conjunctive normal form
Date: 2013-08-19 07:45:21
Theoretical computer science
Mathematical logic
Mathematics
Logic programming
Logic in computer science
Automated theorem proving
Formal methods
Unification
Lambda calculus
Constraint logic programming
Conjunctive normal form

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Download Document from Source Website

File Size: 145,01 KB

Share Document on Facebook

Similar Documents

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach  Lecture “Automated Reasoning”

¨ DES SAARLANDES UNIVERSITAT FR 6.2 – Informatik Christoph Weidenbach Lecture “Automated Reasoning”

DocID: 1qJex - View Document

Microsoft Word - IBSdoc

Microsoft Word - IBSdoc

DocID: 1qERD - View Document

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

Learning Partially Observable Action Models: Efficient Algorithms Dafna Shahaf Allen Chang Eyal Amir Computer Science Department University of Illinois, Urbana-Champaign Urbana, IL 61801, USA {dshahaf2,achang6,eyal}@uiuc

DocID: 1qzAi - View Document

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

Parameterized Proof Complexity∗ Stefan Dantchev, Barnaby Martin, and Stefan Szeider Department of Computer Science Durham University, Durham, England, UK [s.s.dantchev,b.d.martin,stefan.szeider]@durham.ac.uk

DocID: 1qorC - View Document