4617 search results - page 569 / 924 » Automation of Diagrammatic Reasoning |
202
click to vote
ICLP
2001
Springer
16 years 1 days ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
212
click to vote
ICLP
2001
Springer
16 years 1 days ago
2001
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling...
205
click to vote
LACL
2001
Springer
16 years 1 days ago
2001
Springer
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
214
click to vote
LACL
2001
Springer
16 years 1 days ago
2001
Springer
Abstract. Two kinds of framework for stating grammars of natural languages emerged during the 20th century. Here we call them generativeenumerative syntax (GES) and model-theoretic...
192
click to vote
LOPSTR
2001
Springer
16 years 1 days ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...