2152 search results - page 266 / 431 » On Automating the Calculus of Relations |
194
click to vote
ICLP
2001
Springer
15 years 11 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...
176
click to vote
LACL
2001
Springer
15 years 11 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...
261
click to vote
SIGECOM
2000
ACM
15 years 10 months ago
2000
ACM
We introduce an information bundling model that addresses two important but relatively unstudied issues in real markets for information goods: automated customization of content b...
175
click to vote
CSL
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
191
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...