367 search results - page 38 / 74 » A Rewriting Logic Sampler |
LOPSTR
1998
Springer
14 years 4 days ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
LOPSTR
2009
Springer
14 years 2 months ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...
CLEF
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
ISTA
2003
13 years 9 months ago
2003
: A new approach of building enterprise distributed applications for layer of business rules as standard part of architecture is proposed in this paper. The approach uses symbolic ...
CADE
2000
Springer
14 years 8 days ago
2000
Springer
Abstract. This article introduces two techniques to improve the propagation efficiency of CSP based finite model generation methods. One approach consists in statically rewriting ...