The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- Negotiating using rewards (Q1028955) (← links)
- Subjective logic and arguing with evidence (Q1028959) (← links)
- Practical reasoning as presumptive argumentation using action based alternating transition systems (Q1028960) (← links)
- The carneades model of argument and burden of proof (Q1028962) (← links)
- Argument based machine learning (Q1028963) (← links)
- Introducing possibilistic logic in ILP for dealing with exceptions (Q1028964) (← links)
- Metatheory of actions: beyond consistency (Q1028966) (← links)
- Exploiting functional dependencies in declarative problem specifications (Q1028967) (← links)
- Bounded model checking for knowledge and real time (Q1028970) (← links)
- Mining competent case bases for case-based reasoning (Q1028971) (← links)
- Uncertainty modelling for vague concepts: a prototype theory approach (Q1045986) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Reasoning from last conflict(s) in constraint programming (Q1045989) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- Memory intensive AND/OR search for combinatorial optimization in graphical models (Q1045991) (← links)
- Knowledge forgetting: properties and applications (Q1045992) (← links)
- Vivid: a framework for heterogeneous problem solving (Q1045993) (← links)
- Encoding deductive argumentation in quantified Boolean formulae (Q1045994) (← links)
- Stonian p-ortholattices: a new approach to the mereotopology \(RT_{0}\) (Q1045997) (← links)
- Two-terminal routing games with unknown active players (Q1045998) (← links)
- The *-minimax search procedure for trees containing chance nodes (Q1050777) (← links)
- Parallelism in vision (Q1054164) (← links)
- A quantitative analysis of the alpha-beta pruning algorithm (Q1055189) (← links)
- Macro-operators: A weak method for learning (Q1057073) (← links)
- A problem-decomposition method using differences or equivalence relations between states (Q1058310) (← links)
- Towards a general theory of action and time (Q1060013) (← links)
- Improved methods of estimating shape from shading using the light source coordinate system (Q1060853) (← links)
- Understanding objects with curved surfaces from a single perspective view of boundaries (Q1060856) (← links)
- A mechanical solution of Schubert's steamroller by many-sorted resolution (Q1060859) (← links)
- Ordering conjunctive queries (Q1060862) (← links)
- Saturation, nonmonotonic reasoning and the closed-world assumption (Q1060864) (← links)
- Semantical considerations on nonmonotonic logic (Q1060866) (← links)
- Depth-first iterative-deepening: An optimal admissible tree search (Q1062761) (← links)
- Top-down synthesis of divide-and-conquer algorithms (Q1062770) (← links)
- Independence assumptions and Bayesian updating (Q1064681) (← links)
- Languages with self-reference. I: Foundations (or: We can have everything in first-order logic!) (Q1068068) (← links)
- An analytical comparison of some rule-learning programs (Q1069315) (← links)
- Probabilistic logic (Q1073782) (← links)
- On the satisfiability of circumscription (Q1073786) (← links)
- Completeness results for circumscription (Q1073787) (← links)
- A generalization of alpha-beta and \(SSS^*\) search procedures (Q1076524) (← links)
- Closed-world databases and circumscription (Q1079022) (← links)
- Completeness results for inequality provers (Q1079960) (← links)
- A syntactic theory of belief and action (Q1085632) (← links)
- A logic to reason about likelihood (Q1090326) (← links)
- Some quantifiers require two-predicate scopes (Q1090330) (← links)
- Bayesian and non-Bayesian evidential updating (Q1091152) (← links)
- Variable precision logic (Q1091831) (← links)
- Proof by consistency (Q1094888) (← links)
- Temporal logics in AI: semantical and ontological considerations (Q1096384) (← links)
