2783 search results - page 397 / 557 » The Nature Of Near-Synonymic Relations |
139
click to vote
LICS
1999
IEEE
15 years 5 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...
137
click to vote
FSTTCS
1999
Springer
15 years 5 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
104
click to vote
GIS
1999
ACM
15 years 5 months ago
1999
ACM
An important activity in the design of a particular database application consists in identifying the integrity constraints that must hold on the database, and that are used to det...
103
click to vote
ICLP
1999
Springer
15 years 5 months ago
1999
Springer
Knowledge representation in logics, even in the order-sorted logic that includes a sort hierarchy, tends to lose the conciseness and the nuances of natural language. If we could c...
136
click to vote
IFIP
1999
Springer
15 years 5 months ago
1999
Springer
: In a relatively short period of time, educational technology has become a basic component of the instructional life of almost every College or University around the world. The wa...