3119 search results - page 170 / 624 » General Default Logic |
CADE
2010
Springer
13 years 12 months ago
2010
Springer
Abstract. Formulas are often monotonic in the sense that if the formula is satisfiable for given domains of discourse, it is also satisfiable for all larger domains. Monotonicity i...
JANCL
2007
13 years 10 months ago
2007
ABSTRACT. We formulate a formal framework in which we combine the theory of dynamic epistemic logic and the theory of games. In particular, we show how we can use tools of dynamic ...
IGPL
1998
13 years 10 months ago
1998
A formula A is said to have the contractionproperty in a logic L i whenever A;A;? `L B (when ? is a multiset) also A;? `L B. In MLL and in MALL without the additive constants a fo...
NC
2007
13 years 10 months ago
2007
In quantum computational logic meanings of sentences are identified with quantum information quantities: systems of qubits or, more generally, mixtures of systems of qubits. We co...
SPC
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Most attempts at analysing secure information flow in programs are based on domain-specific logics. Though computationally feahese approaches suffer from the need for ...