4573 search results - page 527 / 915 » Automated Reasoning |
164
click to vote
ICLP
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Groundness analysis of logic programs using Pos-based abstract interpretation is one of the clear success stories of the last decade in the area of logic program analysis...
147
Voted
ICLP
2001
Springer
15 years 9 months 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...
159
click to vote
ICLP
2001
Springer
15 years 9 months 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...
149
click to vote
LACL
2001
Springer
15 years 9 months 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 ...
147
Voted
LACL
2001
Springer
15 years 9 months 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...