The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- Game tree searching by min/max approximation (Q1096402) (← links)
- Implementing Dempster's rule for hierarchical evidence (Q1096411) (← links)
- Distributed revision of composite beliefs (Q1096412) (← links)
- Belief, awareness, and limited reasoning (Q1096610) (← links)
- A search algorithm for motion planning with six degrees of freedom (Q1097053) (← links)
- Controlling recursive inference (Q1097714) (← links)
- Negation as failure: careful closure procedure (Q1097727) (← links)
- Formalizing nonmonotonic reasoning systems (Q1099647) (← links)
- Languages with self-reference. II: Knowledge, belief, and modality (Q1101099) (← links)
- Planning for conjunctive goals (Q1101262) (← links)
- Constraint propagation with interval labels (Q1101265) (← links)
- Evidential reasoning using stochastic simulation of causal models (Q1101266) (← links)
- Diagnosing multiple faults (Q1101418) (← links)
- A theory of diagnosis from first principles (Q1102126) (← links)
- Admissibility of \(AO^ *\) when heuristics overestimate (Q1102135) (← links)
- Network-based heuristics for constraint-satisfaction problems (Q1102137) (← links)
- Conspiracy numbers for min-max search (Q1102218) (← links)
- A pattern classification approach to evaluation function learning (Q1102763) (← links)
- Default reasoning and possibility theory (Q1103418) (← links)
- Reasoning about action. I: A possible worlds approach (Q1103419) (← links)
- Reasoning about action. II: The qualification problem (Q1103420) (← links)
- Constraint satisfaction from a deductive viewpoint (Q1103421) (← links)
- An approach to default reasoning based on a first-order conditional logic: Revised report (Q1103607) (← links)
- Learning by understanding analogies (Q1104112) (← links)
- Constraints on deformable models: Recovering 3D shape and nonrigid motion (Q1104122) (← links)
- Man-machine theorem proving in graph theory (Q1104124) (← links)
- A model for belief revision (Q1104127) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- Addendum to ``Bayesian and non-Bayesian evidential updating'' (Q1104763) (← links)
- On the relation between default and autoepistemic logic (Q1104771) (← links)
- Problems in formal temporal reasoning (Q1104773) (← links)
- A logical framework for default reasoning (Q1104777) (← links)
- The anomalous extension problem in default reasoning (Q1104922) (← links)
- A practically efficient and almost linear unification algorithm (Q1105360) (← links)
- Independence and Bayesian updating methods (Q1105391) (← links)
- Some fundamental properties of local constraint propagation (Q1105393) (← links)
- Autocircumscription (Q1105394) (← links)
- Quantifying inductive bias: AI learning algorithms and Valiant's learning framework (Q1106669) (← links)
- A first-order conditional logic for prototypical properties (Q1108818) (← links)
- Nonmonotonic logic and temporal projection (Q1108819) (← links)
- Comparative analysis (Q1108974) (← links)
- Explanation-based generalisation \(=\) partial evaluation (Q1109580) (← links)
- Generalized subsumption and its applications to induction and redundancy (Q1110345) (← links)
- Chronological ignorance: Experiments in nonmonotonic temporal reasoning (Q1114431) (← links)
- On the relationship between circumscription and negation as failure (Q1115207) (← links)
- An algorithm to compute circumscription (Q1115208) (← links)
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm (Q1115210) (← links)
- A generalization of collapsible cases of circumscription (Q1115424) (← links)
- Fixed points in propositional nonmonotonic logic (Q1115426) (← links)
- A four-valued semantics for terminological logics (Q1115428) (← links)
