Content deleted Content added
was: please do not modifiy other people's comments |
→Domains? Solvers?: new section |
||
Line 19:
Anything missing? - [[User:Paolo Liberatore|Liberatore]]([[User talk:Paolo Liberatore|T]]) 11:23, 9 March 2006 (UTC)
== Domains? Solvers? ==
There seem to be several problems with this article:
* The domains section gives some examples, and then starts talking about "finite domains" -- is this correct? Some of the example domains are infinite, right? e.g. the linear-arithmetic constraints?
* The implementations section lists tools, such as drools, which supposedly solve such problems, but I'm pretty sure (might be wrong) that most of these tools can't actually solve any of the example domains, and/or would have disasterous performance.
* All of the examples given are standard examples from [[satisfiability modulo theories]], which have nice, clean formalized notions of these domains,and are very fast at solving them ... yet this article barely mentions this.
So I'm confused ... help appreciated.[[User:Linas|linas]] ([[User talk:Linas|talk]]) 18:21, 16 June 2011 (UTC)
| |||