Solving strong controllability of temporal problems with uncertainty using SMT (Q2342602): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10601-014-9167-5 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-014-9167-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079572428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing Mathematical Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remote Agent: to boldly go where no AI system has gone before / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MathSAT5 SMT Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving strong controllability of temporal problems with uncertainty using SMT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Flexible Difference Constraint Propagation for DPLL(T) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solution techniques for disjunctive temporal reasoning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Linear Quantifier Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quantifier Elimination Algorithm for Linear Real Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling contingency in temporal constraint networks: from consistency to controllabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Controllability of Disjunctive Temporal Problems with Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing All-Pairs Shortest Paths by Leveraging Low Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LIBRARY FOR DOING POLYHEDRAL OPERATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the number of clauses by renaming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10601-014-9167-5 / rank
 
Normal rank

Latest revision as of 02:22, 18 December 2024

scientific article
Language Label Description Also known as
English
Solving strong controllability of temporal problems with uncertainty using SMT
scientific article

    Statements

    Solving strong controllability of temporal problems with uncertainty using SMT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 April 2015
    0 references
    temporal problems
    0 references
    strong controllability
    0 references
    temporal reasoning under uncertainty
    0 references
    satisfiability modulo theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers