1061 search results - page 51 / 213 » Dependently Sorted Logic |
FLAIRS
2004
13 years 11 months ago
2004
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly t...
AGP
2003
IEEE
14 years 3 months ago
2003
IEEE
There are very few approaches to measure the execution costs of lazy functional (logic) programs. The use of a lazy execution mechanism implies that the complexity of an evaluation...
ICDT
2003
ACM
14 years 3 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
BIRTHDAY
2000
Springer
14 years 2 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
LACL
1998
Springer
14 years 2 months ago
1998
Springer
In this paper we give a formal description of the parsing model that underlies the treatment of Long Distance Dependencies, Topic and Focus, Ellipsis and Quantification in, amongs...