977 search results - page 128 / 196 » Logic programming with infinite sets |
100
click to vote
SEMWEB
2007
Springer
15 years 6 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
CONSTRAINTS
2007
15 years 17 days ago
2007
In the ECAD area, the Test Generation (TG) problem consists in finding an input vector test for some possible diagnosis (a set of faults) of a digital circuit. Such tests may have ...
213
Voted
POPL
2004
ACM
16 years 26 days ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
164
Voted
POPL
2001
ACM
16 years 26 days ago
2001
ACM
We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higher-order logic program, the proof checker is replaced by a nondeter...
221
click to vote
POPL
2009
ACM
16 years 1 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...