206 search results - page 20 / 42 » Semantics, modularity, and rewriting logic |
177
click to vote
LOPSTR
1998
Springer
15 years 10 months 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...
164
click to vote
CLEF
2005
Springer
15 years 11 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...
160
click to vote
IJAR
2007
15 years 6 months ago
2007
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
155
click to vote
INFORMATICALT
2000
15 years 5 months ago
2000
The paper presents a simple programming language and rewriting system called GENS. It is based on an extension of the -calculus called E-calculus. GENS is a multiparadigm language:...
182
click to vote
ACMICEC
2005
ACM
15 years 11 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...