The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- Loop-separable programs and their first-order definability (Q543631) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- Heuristic search through islands (Q578930) (← links)
- Fusion, propagation, and structuring in belief networks (Q578932) (← links)
- A theorem on the consistency of circumscription (Q578934) (← links)
- Using approximate reasoning to represent default knowledge (Q578935) (← links)
- Qualitative simulation (Q578946) (← links)
- Shading into texture (Q578948) (← links)
- An experimental logic based on the fundamental deduction principle (Q580998) (← links)
- Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
- A logical framework for depiction and image interpretation (Q582146) (← links)
- On the existence of nonterminating queries for a restricted class of PROLOG-clauses (Q582150) (← links)
- A world-championship-level Othello program (Q594609) (← links)
- On the measure of conflicts: Shapley inconsistency values (Q622103) (← links)
- The computational complexity of avoiding spurious states in state space abstraction (Q622104) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition (Q622107) (← links)
- Updating action domain descriptions (Q622109) (← links)
- Compactly representing utility functions using weighted goals and the Max aggregator (Q622111) (← links)
- Outlier detection for simple default theories (Q622112) (← links)
- Practical performance models of algorithms in evolutionary program induction and other domains (Q622115) (← links)
- Extended clause learning (Q622116) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- A logic-based axiomatic model of bargaining (Q622118) (← links)
- When is it better not to look ahead? (Q622121) (← links)
- Double preference relations for generalised belief change (Q622124) (← links)
- Kernel functions for case-based planning (Q622125) (← links)
- Implementing logical connectives in constraint programming (Q622127) (← links)
- Defeasible inheritance with doubt index and its axiomatic characterization (Q622128) (← links)
- Qualitative reasoning with directional relations (Q622129) (← links)
- Corrigendum to ``Ensembling neural networks: many could be better than all'' (Q622130) (← links)
- Instantiating abstract argumentation with classical logic arguments: postulates and properties (Q646494) (← links)
- Efficient solutions to factored MDPs with imprecise transition probabilities (Q646498) (← links)
- Local closed world reasoning with description logics under the well-founded semantics (Q646502) (← links)
- Hybrid tractability of valued constraint problems (Q646503) (← links)
- Inconsistent heuristics in theory and practice (Q646508) (← links)
- Learning qualitative models from numerical data (Q646510) (← links)
- On rules with existential variables: walking the decidability line (Q646515) (← links)
- Voting almost maximizes social welfare despite limited communication (Q646516) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Computational techniques for a simple theory of conditional preferences (Q646519) (← links)
- Contracting preference relations for database applications (Q646521) (← links)
- The local geometry of multiattribute tradeoff preferences (Q646524) (← links)
- Decision making with multiple objectives using GAI networks (Q646528) (← links)
- Representing preferences using intervals (Q646529) (← links)
- On the ERA ranking representability of pairwise bipartite ranking functions (Q646530) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- Incompleteness and incomparability in preference aggregation: complexity results (Q646535) (← links)
- Democratic approximation of lexicographic preference models (Q646538) (← links)
