A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic (Q2386107): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MOCHA / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11229-004-2446-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4246105541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating-time temporal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded model checking using satisfiability solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing semantics of logics for multi-agent systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3141897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501688 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:27, 10 June 2024

scientific article
Language Label Description Also known as
English
A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic
scientific article

    Statements

    A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    temporal epistemic logic
    0 references
    verification of game-like structures
    0 references
    symbolic model checking
    0 references
    multi-agent systems
    0 references
    concurrent epistemic game structures
    0 references
    0 references