The following pages link to Artificial Intelligence (Q72340):
Displaying 50 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Construction of system of spheres-based transitively relational partial meet multiple contractions: an impossibility result (Q254004) (← links)
- SAT race 2015 (Q334795) (← links)
- On minimal constraint networks (Q359976) (← links)
- YAGO2: a spatially and temporally enhanced knowledge base from Wikipedia (Q360007) (← links)
- Learning multilingual named entity recognition from Wikipedia (Q360024) (← links)
- Computing pure Bayesian-Nash equilibria in games with finite actions and continuous types (Q360104) (← links)
- Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
- Algorithms and mechanisms for procuring services with uncertain durations using redundancy (Q420791) (← links)
- Minimal change: relevance and recovery revisited (Q490421) (← links)
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables (Q490443) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- Learning an efficient constructive sampler for graphs (Q511780) (← links)
- Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions (Q543608) (← links)
- Logic-based ontology comparison and module extraction, with an application to DL-Lite (Q622105) (← links)
- Updating action domain descriptions (Q622109) (← links)
- Representing preferences using intervals (Q646529) (← links)
- Approximating probabilistic inference in Bayesian belief networks is NP- hard (Q685336) (← links)
- Linear-space best-first search (Q685539) (← links)
- Rippling: A heuristic for guiding inductive proofs (Q685548) (← links)
- General branch and bound, and its relation to \(A^*\) and \(AO^*\) (Q792768) (← links)
- A critical examination of Allen's theory of action and time (Q809997) (← links)
- On market-inspired approaches to propositional satisfiability (Q814434) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments (Q814484) (← links)
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks (Q814531) (← links)
- An agenda-based framework for multi-issue negotiation (Q814532) (← links)
- Representing the Zoo World and the Traffic World in the language of the Causal Calculator (Q814554) (← links)
- Comparing formal theories of context in AI (Q814585) (← links)
- A comparative runtime analysis of heuristic algorithms for satisfiability problems (Q835804) (← links)
- Computer-aided proofs of Arrow's and other impossibility theorems (Q840816) (← links)
- On redundant topological constraints (Q891795) (← links)
- An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty (Q892228) (← links)
- Modelling structured societies: a multi-relational approach to context permeability (Q900309) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- Analysis of a probabilistic model of redundancy in unsupervised information extraction (Q991016) (← links)
- Learning action models from plan examples using weighted MAX-SAT (Q1028900) (← links)
- An algorithm for distributing coalitional value calculations among cooperating agents (Q1028940) (← links)
- Negotiating using rewards (Q1028955) (← links)
- Subjective logic and arguing with evidence (Q1028959) (← links)
- Closed-world databases and circumscription (Q1079022) (← links)
- Explanation-based generalisation \(=\) partial evaluation (Q1109580) (← links)
- Circumscription - a form of non-monotonic reasoning (Q1140440) (← links)
- Theorem proving with abstraction (Q1149799) (← links)
- An investigation of the causes of pathology in games (Q1173415) (← links)
- Impediments to universal preference-based default theories (Q1182162) (← links)
- A theory of conflict resolution in planning (Q1204872) (← links)
