The following pages link to (Q4016561):
Displaying 50 items.
- Bounded situation calculus action theories (Q286407) (← links)
- Online belief tracking using regression for contingent planning (Q334802) (← links)
- John McCarthy's legacy (Q543573) (← links)
- Non-Markovian control in the Situation Calculus (Q543575) (← links)
- \(\mathcal M\)odular-\(\mathcal E\) and the role of elaboration tolerance in solving the qualification problem (Q543579) (← links)
- A unifying action calculus (Q543584) (← links)
- A semantic characterization of a useful fragment of the situation calculus with knowledge (Q543586) (← links)
- Iterated belief change in the situation calculus (Q543588) (← links)
- First-order logical filtering (Q543591) (← links)
- The situation calculus: a case for modal logic (Q616039) (← links)
- Knowledge, action, and the frame problem (Q814427) (← links)
- Nonmonotonic causal theories (Q814551) (← links)
- Logic-based subsumption architecture (Q814558) (← links)
- Heuristic planning: A declarative approach based on strategies for action selection (Q814564) (← links)
- A causal approach to nonmonotonic reasoning (Q814640) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- Tableau-based automata construction for dynamic linear time temporal logic (Q862830) (← links)
- Approximate postdictive reasoning with answer set programming (Q893596) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Property persistence in the situation calculus (Q991025) (← links)
- Linear temporal logic as an executable semantics for planning languages (Q1006453) (← links)
- Inductive situation calculus (Q1028914) (← links)
- Metatheory of actions: beyond consistency (Q1028966) (← links)
- A logical formalization of the OCC theory of emotions (Q1036048) (← links)
- What robots can do: robot programs and effective achievability (Q1274278) (← links)
- Formalizing narratives using nested circumscription (Q1274680) (← links)
- Reasoning about actions: steady versus stabilizing state constraints (Q1274697) (← links)
- Let's plan it deductively! (Q1274761) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- Probabilistic Horn abduction and Bayesian networks (Q1313950) (← links)
- Proving properties of states in the situation calculus (Q1313962) (← links)
- Representing action: indeterminacy and ramifications (Q1389538) (← links)
- The independent choice logic for modelling multiple agents under uncertainty (Q1391346) (← links)
- Ramification and causality (Q1399132) (← links)
- ConGolog, a concurrent programming language based on the situation calculus (Q1583234) (← links)
- From situation calculus to fluent calculus: State update axioms as a solution to the inferential frame problem (Q1606307) (← links)
- The qualification problem: A solution to the problem of anomalous models (Q1606323) (← links)
- Belief revision and projection in the epistemic situation calculus (Q1680698) (← links)
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems (Q1711885) (← links)
- On the evaluation of agent behaviors (Q1853676) (← links)
- Nested abnormality theories (Q1855215) (← links)
- A circumscriptive calculus of events (Q1855238) (← links)
- Modality and interrupts (Q1891265) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Mechanical verification on strategies (Q1896369) (← links)
- Reasoning about time in the situation calculus (Q1924726) (← links)
- Integrating actions and state constraints: A closed-form solution to the ramification problem (sometimes) (Q1978240) (← links)
- Abduction to plausible causes: an event-based model of belief update (Q2171257) (← links)
- Non-terminating processes in the situation calculus (Q2188782) (← links)
- Epistemic GDL: a logic for representing and reasoning about imperfect information games (Q2238622) (← links)
