607 search results - page 34 / 122 » Unifying Exact Completions |
MFCS
2005
Springer
15 years 4 months ago
2005
Springer
Systems of language equations of the form {ϕ(X1, . . . , Xn) = ∅, ψ(X1, . . . , Xn) = ∅} are studied, where ϕ, ψ may contain set-theoretic operations and concatenation; the...
74
Voted
AML
2005
14 years 10 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
JSAT
2007
14 years 10 months ago
2007
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
136
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
106
Voted
SEKE
2004
Springer
15 years 4 months ago
2004
Springer
The development of class models using the Rational Unified Process (RUP) requires complete, correct and unambiguous use case specification documents. The Use Case Driven Developmen...