1032 search results - page 110 / 207 » Extended Computation Tree Logic |
102
click to vote
ENTCS
2006
14 years 10 months ago
2006
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
CP
2007
Springer
15 years 4 months ago
2007
Springer
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
DATESO
2004
14 years 11 months ago
2004
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
103
click to vote
LICS
1994
IEEE
15 years 2 months ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...