scientific article; zbMATH DE number 1216123
From MaRDI portal
Publication:4215779
zbMath0903.68100MaRDI QIDQ4215779
Judy Goldsmith, Michael L. Littman, Martin Mundhenk
Publication date: 28 October 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (31)
Complexity of fixed point counting problems in Boolean networks ⋮ Decidability and complexity of action-based temporal planning over dense time ⋮ Strong planning under uncertainty in domains with numerous but identical elements (a generic approach) ⋮ Same-decision probability: a confidence measure for threshold-based decisions ⋮ Stochastic constraint programming: A scenario-based approach ⋮ Phase transitions of PP-complete satisfiability problems ⋮ Sequential Monte Carlo in reachability heuristics for probabilistic planning ⋮ Exact stochastic constraint optimisation with applications in network analysis ⋮ Flexible FOND Planning with Explicit Fairness Assumptions ⋮ A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases ⋮ Most probable explanations in Bayesian networks: complexity and tractability ⋮ Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results ⋮ A structured view on weighted counting with relations to counting, quantum computation and applications ⋮ Qualitative Numeric Planning: Reductions and Complexity ⋮ ASP (): Answer Set Programming with Algebraic Constraints ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ Fast strong planning for fully observable nondeterministic planning problems ⋮ Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework ⋮ On the complexity of propositional and relational credal networks ⋮ A survey of computational complexity results in systems and control ⋮ The complexity of agent design problems: Determinism and history dependence ⋮ Probabilistic Reasoning by SAT Solvers ⋮ On the Complexity of Value Iteration ⋮ Most relevant explanation: Computational complexity and approximation methods ⋮ The Computational Complexity of Understanding Binary Classifier Decisions ⋮ Complexity results for structure-based causality. ⋮ POMDPs under probabilistic semantics ⋮ The complexity of achievement and maintenance problems in agent-based systems ⋮ On the undecidability of probabilistic planning and related stochastic optimization problems ⋮ Contingent planning under uncertainty via stochastic satisfiability ⋮ Solving factored MDPs using non-homogeneous partitions
Uses Software
This page was built for publication:
