ATL with Strategy Contexts and Bounded Memory
... Alternating-time temporal logic (ATL). Over the last ten years, ATL has been proposed as a new flavor of temporal logics for specifying and verifying properties in multi-agent systems (modeled as Concurrent Game Structures (CGS) [2]), in which several agents can concurrently act upon the behaviour of ...
... Alternating-time temporal logic (ATL). Over the last ten years, ATL has been proposed as a new flavor of temporal logics for specifying and verifying properties in multi-agent systems (modeled as Concurrent Game Structures (CGS) [2]), in which several agents can concurrently act upon the behaviour of ...
A Qualitative Theory of Dynamic Interactive Belief Revision
... our “action model”) and the “static” input-term to be operated upon (i.e., the “state model”) are essentially of the same type: epistemic plausibility models for the same language (and for the same set of agents). ...
... our “action model”) and the “static” input-term to be operated upon (i.e., the “state model”) are essentially of the same type: epistemic plausibility models for the same language (and for the same set of agents). ...
On the Construction of Analytic Sequent Calculi for Sub
... are logics that are strictly contained (as consequence relations) in classical logic. Thus, by choosing a subset of axioms and derivation rules that are derivable in (some proof system for) classical logic, one easily obtains a (proof system for a) sub-classical logic. Various important and useful n ...
... are logics that are strictly contained (as consequence relations) in classical logic. Thus, by choosing a subset of axioms and derivation rules that are derivable in (some proof system for) classical logic, one easily obtains a (proof system for a) sub-classical logic. Various important and useful n ...
Programming with Classical Proofs
... “real” programming languages, since these all have primitive datatypes. We will present this system in Chapter 4. Furthermore, he has developed :: catch, which is an extension of Herbelin’s IQCMP -calculus with catch and throw [21], this time with lists as a primitive datatype. Aschieri and Berardi ...
... “real” programming languages, since these all have primitive datatypes. We will present this system in Chapter 4. Furthermore, he has developed :: catch, which is an extension of Herbelin’s IQCMP -calculus with catch and throw [21], this time with lists as a primitive datatype. Aschieri and Berardi ...
Intuitionistic Type Theory - The collected works of Per Martin-Löf
... In particular, the premisses and conclusion of a logical inference are judgements. The distinction between propositions and judgements was clear from Frege to Principia. These notions have later been replaced by the formalistic notions of formula and theorem (in a formal system), respectively. Contr ...
... In particular, the premisses and conclusion of a logical inference are judgements. The distinction between propositions and judgements was clear from Frege to Principia. These notions have later been replaced by the formalistic notions of formula and theorem (in a formal system), respectively. Contr ...
Decision procedures in Algebra and Logic
... Structures whose axioms are all identities If the axioms defining a structure are all identities, the structure is a variety (not to be confused with algebraic variety in the sense of algebraic geometry). Identities are equations formulated using only the operations the structure allows, and variabl ...
... Structures whose axioms are all identities If the axioms defining a structure are all identities, the structure is a variety (not to be confused with algebraic variety in the sense of algebraic geometry). Identities are equations formulated using only the operations the structure allows, and variabl ...
