1 |
A New Algorithm for Normal Dominance Constraints
|
|
|
|
In: ACM-SIAM Symposium on Discrete Algorithms - SODA'2003 ; https://hal.inria.fr/inria-00536536 ; ACM-SIAM Symposium on Discrete Algorithms - SODA'2003, Jan 2004, New Orleans, Louisiana, United States. pp.59-67 ; http://portal.acm.org/citation.cfm?id=982801 (2004)
|
|
BASE
|
|
Show details
|
|
2 |
An Efficient Graph Algorithm for Dominance Constraints
|
|
|
|
In: ISSN: 0196-6774 ; EISSN: 1090-2678 ; Journal of Algorithms in Cognition, Informatics and Logic ; https://hal.inria.fr/inria-00536539 ; Journal of Algorithms in Cognition, Informatics and Logic, Elsevier, 2003, Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms, 48 (1), pp.194-219. ⟨10.1016/S0196-6774(03)00050-6⟩ ; http://portal.acm.org/citation.cfm?id=989537 (2003)
|
|
BASE
|
|
Show details
|
|
3 |
Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment
|
|
|
|
In: ISSN: 1879-2294 ; EISSN: 0304-3975 ; Theoretical Computer Science ; https://hal.inria.fr/inria-00099677 ; Theoretical Computer Science, Elsevier, 2003, 293 (2), pp.321-343 (2003)
|
|
BASE
|
|
Show details
|
|
4 |
Tree Descriptions, Constraints and Incrementality
|
|
|
|
In: Computing Meaning ; https://hal.inria.fr/inria-00100450 ; H. Bunt, R. Muskens and E. Thijsse (eds). Computing Meaning, Kluwer Academic Publishers, 23 p, 2001, Studies in Linguistics and Philosophy Series (2001)
|
|
BASE
|
|
Show details
|
|
|
|