The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- A differential semantics for jointree algorithms (Q814601) (← links)
- Revision by comparison (Q814602) (← links)
- \(\text{DA}^2\) merging operators (Q814605) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Combining probabilistic logic programming with the power of maximum entropy (Q814608) (← links)
- Qualitative choice logic (Q814609) (← links)
- Conditional logic of actions and causation (Q814610) (← links)
- A nonmonotonic observation logic (Q814611) (← links)
- Configuration landscape analysis and backbone guided local search. I: Satisfiability and maximum satisfiability (Q814612) (← links)
- On the computational complexity of qualitative coalitional games (Q814613) (← links)
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- The limitation of Bayesianism (Q814616) (← links)
- Multi-modal diagnosis combining case-based and model-based reasoning: a formal and experimental analysis (Q814620) (← links)
- Order-sorted logic programming with predicate hierarchy (Q814621) (← links)
- Qualitatively faithful quantitative prediction (Q814624) (← links)
- Solving weighted CSP by maintaining arc consistency (Q814626) (← links)
- Efficient learning equilibrium (Q814627) (← links)
- A selective sampling approach to active feature selection (Q814628) (← links)
- Updating beliefs with incomplete observations (Q814629) (← links)
- Conformant planning via symbolic model checking and heuristic search (Q814631) (← links)
- Great expectations. II: Generalized expected utility as a universal decision rule (Q814633) (← links)
- Approximating cost-based abduction is NP-hard (Q814635) (← links)
- Generalized region connection calculus (Q814636) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- Learning a decision maker's utility function from (possibly) inconsistent behavior (Q814638) (← links)
- Decidability of SHIQ with complex role inclusion axioms (Q814639) (← links)
- A causal approach to nonmonotonic reasoning (Q814640) (← links)
- A formal theory for reasoning about parthood, connection, and location (Q814642) (← links)
- An incremental algorithm for DLO quantifier elimination via constraint propagation (Q814643) (← links)
- A correction to ``Nonmonotonic inconsistency'' (Q814644) (← links)
- Managing concurrency in temporal planning using planner-scheduler interaction (Q834400) (← links)
- Reasoning about coalitional games (Q834401) (← links)
- Coherence graphs (Q834402) (← links)
- On the notion of concept. II (Q834403) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- Ranking games (Q835803) (← links)
- A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804) (← links)
- Spatial reasoning in a fuzzy region connection calculus (Q835806) (← links)
- Filtering algorithms for the multiset ordering constraint (Q835808) (← links)
- Computing leximin-optimal solutions in constraint networks (Q835811) (← links)
- Long-distance mutual exclusion for planning (Q835814) (← links)
- Algorithms for the coalitional manipulation problem (Q835815) (← links)
- Using arguments for making and explaining decisions (Q835816) (← links)
- Computing the fault tolerance of multi-agent deployment (Q835818) (← links)
- Concise finite-domain representations for PDDL planning tasks (Q835819) (← links)
- Learning from planner performance (Q835821) (← links)
- Anytime heuristic search for partial satisfaction planning (Q835822) (← links)
- A heuristic search approach to planning with temporally extended preferences (Q835825) (← links)
