Publications
Server halma.mpi-inf.mpg.de
Publications
Entries sorted by: 1. Author,Editor - 2. by Group - 4. with BibTeX cite keys
Login to this database
Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Show entries starting with: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
 | Year | Title | BibTeX cite key | ||||
|---|---|---|---|---|---|---|---|
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| 2000 | On the Alternation-free Horn mu-calculus In: Proceedings of the 7th International Conference on Logic for Programming and Automated Reasoning (LPAR-2000), 418-435 | Talbot2000c | | |||
| 2000 | The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard In: Information Processing Letters [74], 27-33 | TalbotIPL2000 | | ||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
| | ||||||
Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)