11017 search results - page 382 / 2204 » Closure Systems and their Structure |
186
click to vote
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
209
click to vote
EDBTW
2004
Springer
16 years 7 days ago
2004
Springer
Many users and applications require the integration of semi-structured data from autonomous, heterogeneous Web sources. Over the last years mediator systems have emerged that use d...
190
click to vote
IJCAI
1989
15 years 8 months ago
1989
The knowledge to be acquired for the development of knowledge based systems is often distributed across a group of experts rather than available for elicitation from a single expe...
183
click to vote
TROB
2002
15 years 6 months ago
2002
Reconfigurable software is highly desired for automated machine tool control systems for low-cost products and short time to market. In this paper, we propose a software architectu...
162
click to vote
ACS
2006
15 years 7 months ago
2006
cal Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems George Voutsadakis Received: 24 May 2006 / Accepted: 28 August 2006 / Published online: 25 October 2006