The following pages link to (Q4215779):
Displaying 35 items.
- Most probable explanations in Bayesian networks: complexity and tractability (Q433524) (← links)
- Fast strong planning for fully observable nondeterministic planning problems (Q504220) (← links)
- On the complexity of propositional and relational credal networks (Q518627) (← links)
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results (Q645074) (← links)
- Most relevant explanation: Computational complexity and approximation methods (Q766267) (← links)
- The complexity of achievement and maintenance problems in agent-based systems (Q814461) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Solving factored MDPs using non-homogeneous partitions (Q814475) (← links)
- Stochastic constraint programming: A scenario-based approach (Q850457) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Complexity of fixed point counting problems in Boolean networks (Q2119407) (← links)
- Decidability and complexity of action-based temporal planning over dense time (Q2124463) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- POMDPs under probabilistic semantics (Q2344358) (← links)
- Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) (Q2373707) (← links)
- Same-decision probability: a confidence measure for threshold-based decisions (Q2375339) (← links)
- Sequential Monte Carlo in reachability heuristics for probabilistic planning (Q2389632) (← links)
- The complexity of agent design problems: Determinism and history dependence (Q2502156) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- The complexity of optimal monotonic planning: the bad, the good, and the causal graph (Q2871457) (← links)
- Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework (Q3011967) (← links)
- (Q3455599) (← links)
- Probabilistic Reasoning by SAT Solvers (Q3638188) (← links)
- Probabilistic Planning with Reduced Models (Q4968375) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- Flexible FOND Planning with Explicit Fairness Assumptions (Q5094037) (← links)
- Qualitative Numeric Planning: Reductions and Complexity (Q5139597) (← links)
- ASP (): Answer Set Programming with Algebraic Constraints (Q5140023) (← links)
- The Computational Complexity of Understanding Binary Classifier Decisions (Q5856459) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases (Q6163648) (← links)
- ``Guess what I'm doing'': extending legibility to sequential decision tasks (Q6566623) (← links)
