Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Year | Title | BibTeX cite key | |||||
---|---|---|---|---|---|---|---|
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
1994 | Refutational Theorem Proving for Hierarchic First-Order Theories In: Applicable Algebra in Engineering, Communication and Computing (AAECC) [5], 193-212 | BachmairGanzingerWaldmann-94-aaecc | |||||
1993 | Set Constraints are the Monadic Class In: Eighth Annual IEEE Symposium on Logic in Computer Science, 75-83 | BachmairGanzingerWaldmann-93-lics | |||||
1993 | Superposition with simplification as a decision procedure for the monadic class with equality In: Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, KGC'93, 83-96 | BachmairGanzingerWaldmann-93-kgs | |||||
1992 | Theorem proving for hierarchic first-order theories In: Algebraic and Logic Programming, 420-434 | BachmairGanzingerWaldmann-92-alp | |||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
|