1059 search results - page 79 / 212 » Standard Logics Are Valuation-Nonmonotonic |
138
click to vote
KBS
2007
15 years 6 months ago
2007
In this paper we study the brokering and matchmaking problem, that is, how a requester’s requirements and preferences can be matched against a set of offerings collected by a bro...
143
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
168
click to vote
CCS
2010
ACM
15 years 6 months ago
2010
ACM
Computational Indistinguishability Logic (CIL) is a logic for reasoning about cryptographic primitives in computational models. It captures reasoning patterns that are common in p...
144
click to vote
LOGCOM
2006
15 years 6 months ago
2006
Starting from a decomposition result of MTL-chains as ordinal sums, we focus our attention on a particular kind of indecomposable semihoops, namely weakly cancellative semihoops. ...
188
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
A declarative programming language has two kinds of semantics. The tract helps in reasoning about speci cations and correctness, while an operational semantics determines the mann...