Populational Announcement Logic (PPAL)
| Autor: | Mario R. F. Benevides, Vitor Machado |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
Model checking
Flexibility (engineering) General Computer Science Semantics (computer science) Computer science Programming language Probabilistic logic 020207 software engineering 0102 computer and information sciences 02 engineering and technology Semantics computer.software_genre Mathematical proof 01 natural sciences Theoretical Computer Science Decidability TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering computer Axiom Hardware_LOGICDESIGN |
| Zdroj: | LSFA |
| ISSN: | 1571-0661 |
| DOI: | 10.1016/j.entcs.2020.02.007 |
| Popis: | Populational Announcement Logic (PPAL), is a variant of the standard Public Announcement Logic (PAL) with a fuzzy-inspired semantics, where instead of specific agents we have populations and groups. The semantics and the announcement logic are defined, and an example is provided. We show validities analogous to PAL axioms and their proofs, and also provide a proof of decidability. We briefly talk about model checking and compare the framework against probabilistic logic. We conclude that the main advantage of PPAL over PAL is the flexibility to work with previously defined agents. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect