A near-optimal method for reasoning about action (Q1134756): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mathematical thought. An introduction to the philosophy of mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Pushdown Machines in Terms of Time-Bounded Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming as a Discipline of Mathematical Nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3227561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intrinsically exponential complexity of the circularity problem for attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prospects and Limitations of Automatic Assertion Generation for Loop Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical decision method for propositional dynamic logic (Preliminary Report) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees and nest structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The synthesis of loop predicates / rank
 
Normal rank

Latest revision as of 03:57, 13 June 2024

scientific article
Language Label Description Also known as
English
A near-optimal method for reasoning about action
scientific article

    Statements

    A near-optimal method for reasoning about action (English)
    0 references
    0 references
    1980
    0 references
    propositional dynamic logic
    0 references
    program verification
    0 references
    decision method
    0 references
    tableau method
    0 references
    Hintikka set
    0 references
    exponential time
    0 references
    satisfiability problem
    0 references
    acceptance problem for linear-space-bounded alternating Turing machine
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references